Simplicial mesh of an arbitrary polyhedron.

DOI10.1016/j.crma.2003.12.033zbMath1052.65011OpenAlexW2086807720MaRDI QIDQ1876839

Paul-Louis George, Houman Borouchaki

Publication date: 20 August 2004

Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.crma.2003.12.033

zbMATH Keywords

polyhedronSteiner pointsDelaunay triangulation algorithmboundary surface mesh

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial aspects of finite geometries (05B25) Computer-aided design (modeling of curves and surfaces) (65D17)

Cites Work

• Unnamed Item
• Unnamed Item
• Triangulating a nonconvex polytope
• Triangulating a simple polygon in linear time
• On the difficulty of triangulating three-dimensional nonconvex polyhedra
• Automatic mesh generator with specified boundary
• Approximating constrained tetrahedrizations
• Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
• Efficient three‐dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints