Skip to main content

Exact Medial Axis Computation for Circular Arc Boundaries

  • Conference paper
  • 3239 Accesses

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

Abstract

We propose a method to compute the algebraically correct medial axis for simply connected planar domains which are given by boundary representations composed of rational circular arcs. The algorithmic approach is based on the Divide-&-Conquer paradigm, as used in [12]. However, we show how to avoid inaccuracies in the medial axis computations arising from a non-algebraic biarc construction of the boundary. To this end we introduce the Exact Circular Arc Boundary representation (ECAB), which allows algebraically exact calculation of bisector curves. Fractions of these bisector curves are then used to construct the exact medial axis. We finally show that all necessary computations can be performed over the field of rational numbers with a small number of adjoint square-roots.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cgal, Computational Geometry Algorithms Library, http://www.cgal.org

  2. Aichholzer, O., Aigner, W., Aurenhammer, F., Hackl, T., Jüttler, B., Rabl, M.: Medial Axis Computation for Planar Free-Form Shapes. Computer Aided Design 41(5), 339–349 (2009)

    Article  Google Scholar 

  3. Berberich, E., Eigenwillig, A., Hemmer, M., Hert, S., Mehlhorn, K., Schömer, E.: A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 174–186. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  4. Blum, H.: A Transformation for Extracting New Descriptors of Shape. In: Wathen-Dunn, W. (ed.) Models for the Perception of Speech and Visual Form, pp. 362–380. MIT Press, Cambridge (1967)

    Google Scholar 

  5. Burnikel, C.: Rational Points on Circles. Research Report MPI-I-98-1-023. Max-Planck-Institut für Informatik, Saarbrücken (1998)

    Google Scholar 

  6. Burnikel, C., Funke, S., Mehlhorn, K., Schirra, S., Schmitt, S.: A Separation Bound for Real Algebraic Expressions. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 154–265. Springer, Heidelberg (2001)

    Google Scholar 

  7. Elber, G., Kim, M.-S.: Bisector Curves of Planar Rational Curves. Computer-Aided Design 30(14), 1089–1096 (1998)

    Article  MATH  Google Scholar 

  8. Emiris, I.Z., Karavelas, M.I.: The Predicates of the Apollonius Diagram: Algorithmic Analysis and Implementation. Computational Geometry 33(1-2), 18–57 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  9. Emiris, I.Z., Tsigaridas, E.P., Tzoumas, G.M.: Exact Delaunay Graph of Smooth Convex Pseudo-circles: General Predicates, and Implementation for Ellipses. In: SIAM/ACM Joint Conference on Geometric and Physical Modeling 2009, pp. 211–222. ACM, New York (2009)

    Chapter  Google Scholar 

  10. Emiris, I.Z., Tzoumas, G.M.: Exact and Efficient Evaluation of the Incircle Predicate for Parametric Ellipses and Smooth Convex Objects. Computer-Aided Design 40(6), 691–700 (2008)

    Article  Google Scholar 

  11. Hanniel, I., Muthuganapathy, R., Elber, G., Kim, M.-S.: Precise Voronoi Cell Extraction of Free-form Rational Planar Closed Curves. In: SPM 2005, pp. 51–59. ACM, New York (2005)

    Google Scholar 

  12. Kunkel, P.: The Tangency Problem of Apollonius: Three Looks. BSHM Bulletin: Journal of the British Society for the History of Mathematics 22, 34–46 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  13. Li, C., Yap, C., Pion, S., Du, Z., Sharma, V.: The Core Library, http://cs.nyu.edu/exact/core_pages/downloads.html

  14. Mehlhorn, K., Näher, S.: The LEDA Platform for Combinatorial and Geometric Computing. Cambridge University Press, Cambridge (1999)

    MATH  Google Scholar 

  15. Schinzel, A., Sierpinski, W.: Elementary Theory of Numbers, 2nd edn. North-Holland Mathematical Library, vol. 31 (1988)

    Google Scholar 

  16. Yap, C.K., Dubé, T.: The Exact Computation Paradigm. In: Du, D.-Z., Hwang, F.K. (eds.) Computing in Euclidean Geometry, pp. 452–492. World Scientific Press, Singapore (1995)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aichholzer, O., Aigner, W., Hackl, T., Wolpert, N. (2012). Exact Medial Axis Computation for Circular Arc Boundaries. In: Boissonnat, JD., et al. Curves and Surfaces. Curves and Surfaces 2010. Lecture Notes in Computer Science, vol 6920. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27413-8_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27413-8_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-27412-1

  • Online ISBN: 978-3-642-27413-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics