Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
153 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Medial Parametrization of Arbitrary Planar Compact Domains with Dipoles (2403.03622v2)

Published 6 Mar 2024 in cs.GR and math.AG

Abstract: We present medial parametrization, a new approach to parameterizing any compact planar domain bounded by simple closed curves. The basic premise behind our proposed approach is to use two close Voronoi sites, which we call dipoles, to construct and reconstruct an approximate piecewise-linear version of the original boundary and medial axis through Voronoi tessellation. The boundaries and medial axes of such planar compact domains offer a natural way to describe the domain's interior. Any compact planar domain is homeomorphic to a compact unit circular disk admits a natural parameterization isomorphic to the polar parametrization of the disk. Specifically, the medial axis and the boundary generalize the radial and angular parameters, respectively. In this paper, we present a simple algorithm that puts these principles into practice. The algorithm is based on the simultaneous re-creation of the boundaries of the domain and its medial axis using Voronoi tessellation. This simultaneous re-creation provides partitions of the domain into a set of "skinny" convex polygons wherein each polygon is essentially a subset of the medial edges (which we call the spine) connected to the boundary through exactly two straight edges (which we call limbs). This unique structure enables us to convert the original Voronoi tessellation into quadrilaterals and triangles (at the poles of the medial axis) neatly ordered along the domain boundary, thereby allowing proper parametrization of the domain. Our approach is agnostic to the number of holes and disconnected components bounding the domain. We investigate the efficacy of our concept and algorithm through several examples.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (31)
  1. Mesh parameterization methods and their applications. Found. Trends. Comput. Graph. Vis., 2(2):105–171, January 2006. ISSN 1572-2740. doi:10.1561/0600000011. URL https://doi.org/10.1561/0600000011.
  2. Gerald Farin. Chapter 1 - a history of curves and surfaces in cagd. In Gerald Farin, Josef Hoschek, and Myung-Soo Kim, editors, Handbook of Computer Aided Geometric Design, pages 1–21. North-Holland, Amsterdam, 2002. ISBN 978-0-444-51104-1. doi:https://doi.org/10.1016/B978-044451104-1/50002-2. URL https://www.sciencedirect.com/science/article/pii/B9780444511041500022.
  3. Harold Scott Macdonald Coxeter. Introduction to geometry. New York, London, 1961.
  4. An introduction to splines for use in computer graphics and geometric modeling. Morgan Kaufmann, 1995.
  5. Eugene L. Wachspress. A rational finite element basis. Academic Press, 114, 1975.
  6. Smooth parametric surfaces and n-sided patches. In Computation of curves and surfaces, pages 457–498. Springer, 1990.
  7. Generalized b-spline surfaces of arbitrary topology. In Proceedings of the 17th annual conference on Computer graphics and interactive techniques, pages 347–356, 1990.
  8. A multisided generalization of bézier surfaces. ACM Transactions on Graphics (TOG), 8(3):204–234, 1989.
  9. Michael S Floater. Mean value coordinates. Computer aided geometric design, 20(1):19–27, 2003.
  10. Interior distance using barycentric coordinates. Computer Graphics Forum, 28(5):1279–1288, 2009.
  11. Mean value coordinates for closed triangular meshes. In Seminal Graphics Papers: Pushing the Boundaries, Volume 2: Originally published in ACM Siggraph 2005, pages 223–228. ACM Siggraph, 2023.
  12. The delaunay/voronoi selection graph: a method for extracting shape information from 2-d dot-patterns with an extension to 3-d. In BMVC92, pages 19–28. Springer, 1992a.
  13. RL Ogniewicz. Skeleton-space: a multiscale shape description combining region and boundary information. age, 7(8):9, 1994.
  14. Approximating the medial axis from the voronoi diagram with a convergence guarantee. Algorithmica, 38(1):179–200, 2004.
  15. Voronoi diagram based automated skeleton extraction from colour scanned maps. In 2006 3rd International Symposium on Voronoi Diagrams in Science and Engineering, pages 186–195. IEEE, 2006.
  16. A pruning algorithm for stable voronoi skeletons. Journal of Mathematical Imaging and Vision, 42(2):225–237, 2012.
  17. On the generation and pruning of skeletons using generalized voronoi diagrams. Pattern Recognition Letters, 33(16):2113–2119, 2012.
  18. The crust and the β𝛽\betaitalic_β-skeleton: Combinatorial curve reconstruction. Graphical models and image processing, 60(2):125–135, 1998a.
  19. A new voronoi-based surface reconstruction algorithm. In Proceedings of the 25th annual conference on Computer graphics and interactive techniques, pages 415–421, 1998b.
  20. Integrated skeleton and boundary shape representation for medical image interpretation. In European Conference on Computer Vision, pages 725–729. Springer, 1992b.
  21. Christopher Gold. Crust and anti-crust: a one-step boundary and skeleton extraction algorithm. In Proceedings of the fifteenth annual symposium on Computational geometry, pages 189–196, 1999.
  22. A one-step crust and skeleton extraction algorithm. Algorithmica, 30(2):144–163, 2001.
  23. Automated conversion of 2d triangular mesh into quadrilateral mesh with directionality control. In IMR, pages 77–86, 1998.
  24. A robust two-step procedure for quad-dominant remeshing. Computer Graphics Forum, 25(3):537–546, 2006.
  25. Recent advances in remeshing of surfaces. Shape analysis and structuring, pages 53–82, 2008.
  26. 2d finite element mesh generation by medial axis subdivision. Advances in engineering software and workstations, 13(5-6):313–324, 1991.
  27. On the isomorphism between the medial axis and a dual of the delaunay graph. In 2009 Sixth International Symposium on Voronoi Diagrams, pages 89–95, 2009. doi:10.1109/ISVD.2009.18.
  28. Modelling with implicit surfaces that interpolate. ACM Transactions on Graphics (TOG), 21(4):855–873, 2002.
  29. Bézier guarding: precise higher-order meshing of curved 2d domains. ACM Transactions on Graphics (TOG), 39(4):103–1, 2020.
  30. Paneling architectural freeform surfaces. In ACM SIGGRAPH 2010 papers, pages 1–10. ACM Siggraph, New York, NY, USA, 2010.
  31. Construction of iso-contours, bisectors, and voronoi diagrams on triangulated surfaces. IEEE Transactions on Pattern Analysis and Machine Intelligence, 33(8):1502–1517, 2010.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets