Faster Circle Packing with Application to Nonobtuse Triangulation

DOI10.1142/S0218195997000296MaRDI QIDQ4365029zbMATH OpenOpenAlexFDO

Authors David Eppstein

Publication date 26 February 1998

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

Full work available at URL https://doi.org/10.1142/s0218195997000296

zbMATH Keywords

circle packingmesh generationnonobtuse triangulation

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Linear-size nonobtuse triangulation of polygons
• POLYNOMIAL-SIZE NONOBTUSE TRIANGULATION OF POLYGONS
• Split packing: packing circles into triangles with optimal worst-case density
• scientific article; zbMATH DE number 1629820

Cited in

(9)

• Linear-size nonobtuse triangulation of polygons
• 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
• Quadrilateral meshes for PSLGs
• A fast and practical method to pack spheres for mesh generation
• Acute triangulations of polyhedra and \(\mathbb R^N\)
• QUADRILATERAL MESHING BY CIRCLE PACKING
• A new method for coarsening tetrahedral meshes
• Diamond-kite meshes: adaptive quadrilateral meshing and orthogonal circle packing

This page was built for publication: Faster Circle Packing with Application to Nonobtuse Triangulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4365029)