Fishburn, P.C. and J.A. Reeds, Unit distances between vertices of a convex polygon, Computational Geometry: Theory and Applications 2 (1992) 81-91. Many years ago Danzer resolved an open question of ErdGs by constructing a convex 9-gon, each vertex of which has the same distance to three other verti
Computing the extreme distances between two convex polygons
β Scribed by H Edelsbrunner
- Publisher
- Elsevier Science
- Year
- 1985
- Tongue
- English
- Weight
- 605 KB
- Volume
- 6
- Category
- Article
- ISSN
- 0196-6774
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Examples are given of n vertex convex polygons for which the distances between a fixed vertex and the remaining vertices, visited in order, form a multi-modal function. We show that this function may have as many as n/2 modes, or local maxima. Further examples are given of n vertex convex polygons i
This paper presents a geometric pruning method for computing the Hausdorff distance between two B-spline curves. It presents a heuristic method for obtaining the one-sided Hausdorff distance in some interval as a lower bound of the Hausdorff distance, which is also possibly the exact Hausdorff dista