arXiv · cs/9908016
Quadrilateral Meshing by Circle Packing
Abstract
We use circle-packing methods to generate quadrilateral meshes for polygonal domains, with guaranteed bounds both on the quality and the number of elements. We show that these methods can generate meshes of several types: (1) the elements form the cells of a Voronoi diagram, (2) all elements have two opposite right angles, (3) all elements are kites, or (4) all angles are at most 120 degrees. In each case the total number of elements is O(n), where n is the number of input vertices.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Marshall Bern, David Eppstein. 1999-08-19. Quadrilateral Meshing by Circle Packing. https://searcharxiv.com/abs/cs/9908016
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.