QUADRILATERAL MESHING BY CIRCLE PACKING

DOI10.1142/S0218195900000206zbMath1074.52505MaRDI QIDQ4682180

David Eppstein, Marshall W. Bern

Publication date: 10 June 2005

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

power diagramVoronoi diagramnonobtuse triangulationkitesangle condition

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Circle packings and discrete conformal geometry (52C26)

Related Items

Quadrilateral meshes for PSLGs, A fast and practical method to pack spheres for mesh generation, Overlapping Yee FDTD method on nonorthogonal grids, Computing convex quadrangulations, Efficient electromagnetic modeling based on automated quadrilateral meshing of polygons., Hexagon-based all-quadrilateral mesh generation with guaranteed angle bounds, Guaranteed-quality all-quadrilateral mesh generation with feature preservation, Adaptive multi‐resolution triangulations based on physical compression, Generation of finite element mesh with variable size over an unbounded 2D domain, Generation of tetrahedral mesh of variable element size by sphere packing over an unbounded 3D domain, Optimal angle bounds for quadrilateral meshes, Experimental results on quadrangulations of sets of fixed points

Cites Work

• Nonobtuse triangulation of polygons
• Drawing the planar dual
• Second derivatives of circles packings and conformal mappings
• Linear-size nonobtuse triangulation of polygons
• Paving: A new approach to automated quadrilateral mesh generation
• POLYNOMIAL-SIZE NONOBTUSE TRIANGULATION OF POLYGONS
• On the Angle Condition in the Finite Element Method
• Faster Circle Packing with Application to Nonobtuse Triangulation