Getting around a lower bound for the minimum Hausdorff distance
Open Access
- 30 June 1998
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 10 (3) , 197-202
- https://doi.org/10.1016/s0925-7721(97)00032-1
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Applications of Parametric Searching in Geometric OptimizationJournal of Algorithms, 1994
- The upper envelope of voronoi surfaces and its applicationsDiscrete & Computational Geometry, 1993
- New Upper Bounds in Klee’s Measure ProblemSIAM Journal on Computing, 1991
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstaclesDiscrete & Computational Geometry, 1986
- Finding kth paths and p-centers by generating and searching good data structuresJournal of Algorithms, 1983