Benjamin Raichel

My Picture

Email: [email protected]
Office: ECSS 4.226

Hi, welcome to my page. I am an assistant professor in the Computer Science Department at UT Dallas. My research interests lie broadly in Computer Science Theory, but primarily I work on problems in Computational Geometry and Geometric Approximation Algorithms.


Current Students:

Please read this before contacting me about research.


Teaching:

My PhD advisor was Sariel Har-Peled. Here is a copy of my CV, and here is a sneezing bear.

My research on other sites:   arXiv     dblp     Google Scholar

Published Papers:

  1. Metric Violation Distance: Hardness and Approximation
    With Chenglin Fan and Gregory Van Buskirk. ACM-SIAM Symposium on Discrete Algorithms (SODA), 2018.

  2. Sparse Approximate Conic Hulls
    With Gregory Van Buskirk and Nicholas Ruozzi. Neural Information Processing Systems (NIPS), 2017.

  3. Computing the Frechet Gap Distance
    With Chenglin Fan. Symposium on Computational Geometry (SoCG), 2017.

  4. A Treehouse with Custom Windows: Minimum Distortion Embeddings into Bounded Treewidth Graphs
    With Amir Nayyeri. ACM-SIAM Symposium on Discrete Algorithms (SODA), 2017.

  5. Most Likely Voronoi Diagrams in Higher Dimensions
    With Nirman Kumar, Subhash Suri, and Kevin Verbeek.
    Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2016.

  6. Avoiding the Global Sort: A Faster Contour Tree Algorithm
    With Seshadhri Comandur. Symposium on Computational Geometry (SoCG), 2016.

  7. Sparse Approximation via Generating Point Sets
    With Avrim Blum and Sariel Har-Peled. ACM-SIAM Symposium on Discrete Algorithms (SODA), 2016.

  8. Reality Distortion: Exact and Approximate Algorithms for Embedding into the Line
    With Amir Nayyeri. IEEE Symposium on Foundations of Computer Science (FOCS), 2015.

  9. From Proximity to Utility: A Voronoi Partition of Pareto Optima
    With Hsien-Chih Chang and Sariel Har-Peled. Symposium on Computational Geometry (SoCG), 2015.

  10. Space Exploration via Proximity Search
    With Sariel Har-Peled, Nirman Kumar, and David Mount. Symposium on Computational Geometry (SoCG), 2015.

  11. On the Complexity of Randomly Weighted Voronoi Diagrams
    With Sariel Har-Peled. Symposium on Computational Geometry (SoCG), 2014.
    Invited to the DCG special issue for SoCG 2014.

  12. Net and Prune: A Linear Time Algorithm for Euclidean Distance Problems
    With Sariel Har-Peled. ACM Symposium on the Theory of Computing (STOC) 2013.

  13. Fault Tolerant Clustering Revisited
    With Nirman Kumar. Presented at YRF at SoCG 2013.
    Canadian Conference on Computational Geometry (CCCG), 2013.

  14. Geometric Packing under Non-uniform Constraints
    With Alina Ene and Sariel Har-Peled. Symposium on Computational Geometry (SoCG), 2012.

  15. On the Expected Complexity of Voronoi Diagrams on Terrains
    With Anne Driemel and Sariel Har-Peled. Symposium on Computational Geometry (SoCG), 2012.

  16. The Frechet Distance Revisited and Extended [Full Version] [Master's Thesis]
    With Sariel Har-Peled. ACM Transactions on Algorithms 10 (1):3:1-3:22, 2014.
    Also in Symposium on Computational Geometry (SoCG), 2011.

Manuscripts:

  1. Viewing the Rings of a Tree: Minimum Distortion Embeddings into Trees
    With Amir Nayyeri. In submission to STOC 2018.
  2. Fast Clustering with Lower Bounds
    With Alina Ene and Sariel Har-Peled. Presented at YRF at SoCG 2012. [arXiv version]

crazy rotating geometry
--I did not create this GIF, but may the interwebs
carry my message of thanks to whoever did.















...that gives us the idea of what the idea
that wants to be transmitted wants to be.
--Reggie Watts