Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance
From MaRDI portal
Publication:3183457
DOI10.1007/978-3-642-03367-4_20zbMath1253.68333MaRDI QIDQ3183457
Matthew Skala, J. Ian Munro, Alejandro Salinger, Reza Dorrigiv, Robert Fraser, Arash Farzan, Stephane Durocher, Alejandro López-Ortiz
Publication date: 20 October 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03367-4_20
52B55: Computational aspects related to convexity
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Cites Work
- Unnamed Item
- Unnamed Item
- A polynomial solution for the Potato-peeling problem
- Geometric applications of a matrix-searching algorithm
- The algebraic degree of geometric optimization problems
- Applications of second-order cone programming
- Hausdorff approximation of convex polygons
- An optimal algorithm for finding minimal enclosing triangles
- Optimal Search in Planar Subdivisions
- On the Continuous Fermat-Weber Problem
- Discrete and Computational Geometry