Data Archiving and Networked Services (DANS) · 28 citations · 16 references
Natural SciencesComputer ScienceMathematicsComputational GeometryGeometrySet TheoryConvex GeometryGeometric ApproximationMetric GeometryShape AnalysisShape InterpolationShape MetricsConvex Hull AlgorithmsGeometric InterpolationHausdorff DistanceShapeShape CorrespondenceShape-preserving Interpolation
Given two shapes A and B in the plane with Hausdorff distance 1, is there a shape S with Hausdorff distance 1/2 to and from A and B? The answer is always yes, and depending on convexity of A and/or B, S may be convex, connected, or disconnected. We show that our result can be generalized to give an interpolated shape between A and B for any interpolation variable α between 0 and 1, and prove that the resulting morph has a bounded rate of change with respect to α. Finally, we explore a generalization of the concept of a Hausdorff middle to more than two input sets. We show how to approximate or compute this middle shape, and that the properties relating to the connectedness of the Hausdorff middle extend from the case with two input sets. We also give bounds on the Hausdorff distance between the middle set and the input.
16
<i>Metro</i>: Measuring Error on Simplified Surfaces
Paolo Cignoni, C. Rocchini, Roberto Scopigno · Computer Graphics Forum · 1998 · 1.5K citations
Handbook of discrete and computational geometry
Choice Reviews Online · 1998 · 1.5K citations · Full text
A modified Hausdorff distance for object matching
Marie-Pierre Dubuisson, A.K. Jain · 2002 · 1.5K citations
A sweepline algorithm for Voronoi diagrams
Steven Fortune · Algorithmica · 1987 · 1.1K citations