COMPUTATIONAL GEOMETRY COLUMN 23

DOI10.1142/S0218195994000148zbMath0804.51030OpenAlexW2053927628MaRDI QIDQ4312280

Joseph O'Rourke

Publication date: 27 November 1994

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

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

zbMATH Keywords

triangulationtetrahedralization

Mathematics Subject Classification ID

Three-dimensional polytopes (52B10) Polyhedra and polytopes; regular figures, division of spaces (51M20) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items (3)

USING LONGEST-SIDE BISECTION TECHNIQUES FOR THE AUTOMATIC REFINEMENT OF DELAUNAY TRIANGULATIONS ⋮ Complexity of the bisection method ⋮ Lepp-bisection algorithms, applications and mathematical properties

This page was built for publication: COMPUTATIONAL GEOMETRY COLUMN 23