Document Open Access Logo

Between Shapes, Using the Hausdorff Distance

Authors Marc van Kreveld, Tillmann Miltzow, Tim Ophelders, Willem Sonke, Jordi L. Vermeulen

PDF
Thumbnail PDF

File

LIPIcs.ISAAC.2020.13.pdf
  • Filesize: 0.84 MB
  • 16 pages

Document Identifiers

Author Details

Marc van Kreveld
  • Department of Information and Computing Sciences, Utrecht University, The Netherlands
Tillmann Miltzow
  • Department of Information and Computing Sciences, Utrecht University, The Netherlands
Tim Ophelders
  • Department of Computational Mathematics, Science and Engineering, Michigan State University, East Lansing, MI, USA
Willem Sonke
  • Department of Mathematics and Computer Science, TU Eindhoven, The Netherlands
Jordi L. Vermeulen
  • Department of Information and Computing Sciences, Utrecht University, The Netherlands

Funding

Research on the topic of this paper was initiated at the 4th Workshop on Applied Geometric Algorithms (AGA 2018) in Langbroek, The Netherlands, supported by the Netherlands Organisation for Scientific Research (NWO) under project no. 639.023.208.
  • van Kreveld, Marc: supported by the NWO TOP grant no. 612.001.651.
  • Miltzow, Tillmann: supported by the NWO Veni grant EAGER.
  • Vermeulen, Jordi L.: supported by the NWO TOP grant no. 612.001.651.

Cite AsGet BibTex

Marc van Kreveld, Tillmann Miltzow, Tim Ophelders, Willem Sonke, and Jordi L. Vermeulen. Between Shapes, Using the Hausdorff Distance. In 31st International Symposium on Algorithms and Computation (ISAAC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 181, pp. 13:1-13:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
https://doi.org/10.4230/LIPIcs.ISAAC.2020.13

Abstract

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 a generalization of this result on Hausdorff distances and middle shapes, and show some related properties. We also show that a generalization of such middle shapes implies a morph with a bounded rate of change. Finally, we explore a generalization of the concept of a Hausdorff middle to more than two sets and show how to approximate or compute it.

Subject Classification

ACM Subject Classification
  • Theory of computation → Computational geometry
Keywords
  • computational geometry
  • Hausdorff distance
  • shape interpolation

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. P.K. Agarwal, J. Pach, and M. Sharir. State of the union (of geometric objects). Technical report, American Mathematical Society, 2008. Google Scholar
  2. O. Aichholzer, F. Aurenhammer, D. Alberts, and B. Gärtner. A novel type of skeleton for polygons. Journal of Universal Computer Science, 1(12):752-761, 1995. Google Scholar
  3. H. Alt, B. Behrends, and J. Blömer. Approximate matching of polygonal shapes. Annals of Mathematics and Artificial Intelligence, 13(3):251-265, September 1995. Google Scholar
  4. H. Alt, P. Braß, M. Godau, C. Knauer, and C. Wenk. Computing the Hausdorff distance of geometric patterns and shapes. In Boris Aronov, Saugata Basu, János Pach, and Micha Sharir, editors, Discrete and Computational Geometry - The Goodman-Pollack Festschrift, pages 65-76. Springer, 2003. Google Scholar
  5. H. Alt and L.J. Guibas. Discrete geometric shapes: Matching, interpolation, and approximation. In Handbook of Computational Geometry, pages 121-153. Elsevier, 2000. Google Scholar
  6. Nicolas Aspert, Diego Santa-Cruz, and Touradj Ebrahimi. Mesh: Measuring errors between surfaces using the Hausdorff distance. In Proc. IEEE International Conference on Multimedia and Expo, volume 1, pages 705-708, 2002. Google Scholar
  7. M.J. Atallah. A linear time algorithm for the Hausdorff distance between convex polygons. Information Processing Letters, 17(4):207-209, 1983. Google Scholar
  8. G. Barequet, M.T. Goodrich, A. Levi-Steiner, and D. Steiner. Contour interpolation by straight skeletons. Graphical Models, 66(4):245-260, 2004. Google Scholar
  9. G. Barequet and A. Vaxman. Nonlinear interpolation between slices. International Journal of Shape Modeling, 14(01):39-60, 2008. Google Scholar
  10. J.-D. Boissonnat. Shape reconstruction from planar cross sections. Computer Vision, Graphics, and Image Processing, 44(1):1-29, 1988. Google Scholar
  11. Paolo Cignoni, Claudio Rocchini, and Roberto Scopigno. Metro: measuring error on simplified surfaces. Computer Graphics Forum, 17(2):167-174, 1998. Google Scholar
  12. M. de Berg, O. Cheong, M. van Kreveld, and M. Overmars. Computational Geometry: Algorithms and Applications. Springer, 3rd edition, 2008. Google Scholar
  13. M.G. Dobbins, L. Kleist, T. Miltzow, and P. Rzążewski. ∀∃ℝ-completeness and area-universality. In International Workshop on Graph-Theoretic Concepts in Computer Science, pages 164-175. Springer, 2018. Google Scholar
  14. M.-P. Dubuisson and Anil K. Jain. A modified hausdorff distance for object matching. In Proceedings of 12th IEEE International Conference on Pattern Recognition, volume 1, pages 566-568, 1994. Google Scholar
  15. A. Dumitrescu and G. Rote. On the Fréchet distance of a set of curves. In CCCG, pages 162-165, 2004. Google Scholar
  16. S. Fortune. A sweepline algorithm for Voronoi diagrams. Algorithmica, 2(1-4):153, 1987. Google Scholar
  17. Barequet G. and M. Sharir. Piecewise-linear interpolation between polygonal slices. Computer Vision and Image Understanding, 63(2):251-272, 1996. Google Scholar
  18. C. Gotsman and V. Surazhsky. Guaranteed intersection-free polygon morphing. Computers & Graphics, 25(1):67-75, 2001. Google Scholar
  19. D. Halperin and M. Sharir. Arrangements. In C.D. Tóth, J. O'Rourke, and J.E. Goodman, editors, Handbook of Discrete and Computational Geometry, chapter 28, pages 723-762. Chapman and Hall/CRC, 3rd edition, 2018. Google Scholar
  20. K. Kedem, R. Livne, J. Pach, and M. Sharir. On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles. Discrete & Computational Geometry, 1(1):59-71, 1986. Google Scholar
  21. E. Koutsoupias, C. H. Papadimitriou, and M. Sideri. On the optimal bisection of a polygon. ORSA Journal on Computing, 4(4):435-438, 1992. Google Scholar
  22. J.S.B. Mitchell, D.M. Mount, and C.H. Papadimitriou. The discrete geodesic problem. SIAM Journal on Computing, 16(4):647-668, 1987. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact