Minimal tetrahedralizations of a class of polyhedra

DOI10.1023/B:JOCO.0000038910.06360.0azbMath1075.65031MaRDI QIDQ1888167

Boting Yang, Cao An Wang

Publication date: 22 November 2004

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:joco.0000038910.06360.0a

zbMATH Keywords

computational geometry; bipyramid polyhedra; minimal tetrahedralizations

Mathematics Subject Classification ID

52B55: Computational aspects related to convexity

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

65D18: Numerical aspects of computer graphics, image analysis, and computational geometry

65D17: Computer-aided design (modeling of curves and surfaces)

52B45: Dissections and valuations (Hilbert's third problem, etc.)