An optimal algorithm for finding minimal enclosing triangles
Journal of Algorithms
The algebraic degree of geometric optimization problems
Discrete & Computational Geometry
On solving geometric optimization problems using shortest paths
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Minimal enclosing parallelogram with application
Proceedings of the eleventh annual symposium on Computational geometry
I/O-efficient algorithms for contour-line extraction and planar graph blocking
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Computing the Constrained Euclidean Geodesic and Link Center of a Simple Polygon with Applications
CGI '96 Proceedings of the 1996 Conference on Computer Graphics International
On the Continuous Fermat-Weber Problem
Operations Research
On a general method for maximizing and minimizing among certain geometric problems
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Notes on searching in multidimensional monotone arrays
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Hausdorff approximation of convex polygons
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
Given a simple polygon P , we consider the problem of finding a convex polygon Q contained in P that minimizes H (P ,Q ), where H denotes the Hausdorff distance. We call such a polygon Q a Hausdorff core of P . We describe polynomial-time approximations for both the minimization and decision versions of the Hausdorff core problem, and we provide an argument supporting the hardness of the problem.