Minimal Tetrahedralizations of a Class of Polyhedra

Boting Yang () and Cao An Wang ()
Additional contact information
Boting Yang: University of Regina
Cao An Wang: Memorial University of Newfoundland

Journal of Combinatorial Optimization, 2004, vol. 8, issue 3, No 2, 265 pages

Abstract: Abstract Given a simple polyhedron P in the three dimensional Euclidean space, different tetrahedralizations of P may contain different numbers of tetrahedra. The minimal tetrahedralization is a tetrahedralization with the minimum number of tetrahedra. In this paper, we present some properties of the graph of polyhedra. Then we identify a class of polyhedra and show that this kind of polyhedra can be minimally tetrahedralized in O(n 2) time.

Keywords: computational geometry; polyhedron; tetrahedralization (search for similar items in EconPapers)
Date: 2004
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1023/B:JOCO.0000038910.06360.0a Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:8:y:2004:i:3:d:10.1023_b:joco.0000038910.06360.0a

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1023/B:JOCO.0000038910.06360.0a

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().