Skip to main content

Hausdorff and Minimal Distances between Parametric Freeforms in \(\mathbb R^2\) and \(\mathbb R^3\)

  • Conference paper
Advances in Geometric Modeling and Processing (GMP 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4975))

Included in the following conference series:

Abstract

We present algorithms to derive the precise Hausdorff distance and/or the minimal distance between two freeform shapes, either curves or surfaces, in or . The events at which the Hausdorff/minimal distance can occur are identified and means to efficiently compute these events are presented. Examples are also shown and the extension to arbitrary dimensions is briefly discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alt, H., Scharf, L.: Computing the Hausdorff distance between sets of curves. In: Proceedings of the 20th European Workshop on Computational Geometry (EWCG), Seville, Spain, pp. 233–236 (2004)

    Google Scholar 

  2. Cignoni, P., Rocchini, C., Scopigno, R.: Metro: Measuring error on simplified surfaces. Computer Graphics Forum 17(2), 167–174 (1998)

    Article  Google Scholar 

  3. Elber, G., Kim, M.S.: Geometric constraint solver using multivariate rational spline functions. In: Proc. of the ACM symposium on Solid Modeling and Applications, pp. 1–10 (2001)

    Google Scholar 

  4. Elber, G., Grandine, T., Kim, M.S.: Surface Self-Intersection Computation via Algebraic Decomposition. functions. In: SPM 2007 (submitted for publication, 2007)

    Google Scholar 

  5. Hanniel, I., Elber, G.: Subdivision Termination Criteria in Subdivision Multivariate Solvers. Computer Aided Design 39, 369–378 (2007)

    Article  Google Scholar 

  6. IRIT 9.5 User’s Manual, Technion (2005), http://www.cs.technion.ac.il/~irit

  7. Johnson, D.: Minimum distance queries for haptic rendering. PhD thesis, Computer Science Department, University of Utah (2005)

    Google Scholar 

  8. Jüttler, B.: Bounding the Hausdorff Distance of Implicitely Defined and/or parametric Curves. In: Lyche, T., Schumaker, L.L. (eds.) Matematical Methods in CAGD, Oslo, pp. 1–10 (2000)

    Google Scholar 

  9. Pekerman, D., Elber, G., Kim, M.-S.: Self-Intersection Detection and Elimination in freeform Curves. In: Computer Aided Design (accepted for publication)

    Google Scholar 

  10. SYNAPS (SYmbolic Numeric ApplicationS), http://www-sop.inria.fr/galaad/software/synaps

Download references

Author information

Authors and Affiliations

Authors

Editor information

Falai Chen Bert Jüttler

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Elber, G., Grandine, T. (2008). Hausdorff and Minimal Distances between Parametric Freeforms in \(\mathbb R^2\) and \(\mathbb R^3\) . In: Chen, F., Jüttler, B. (eds) Advances in Geometric Modeling and Processing. GMP 2008. Lecture Notes in Computer Science, vol 4975. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79246-8_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-79246-8_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-79245-1

  • Online ISBN: 978-3-540-79246-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics