Algorithms for triangulating polyhedra into a small number of tetrahedra

dc.creator	Stojanović, Milica
dc.date.accessioned	2023-05-12T09:58:07Z
dc.date.available	2023-05-12T09:58:07Z
dc.date.issued	2005
dc.identifier.issn	0025-5165
dc.identifier.uri	https://rfos.fon.bg.ac.rs/handle/123456789/307
dc.description.abstract	Two algorithms for triangulating polyhedra, which give the number of tetrahedra depending linearly on the number of vertices, are discussed. Since the smallest possible number of tetrahedra necessary to triangulate given polyhedra is of interest, for the first–"Greedy peeling" algorithm, we give a better estimation of the greatest number of tetrahedra (3n - 20 instead of 3n - 11), while for the second one–"cone triangulation", we discuss cases when it is possible to improve it in such a way as to obtain a smaller number of tetrahedra.	en
dc.publisher	Društvo matematičara Srbije, Beograd
dc.rights	openAccess
dc.rights.uri	https://creativecommons.org/licenses/by/4.0/
dc.source	Matematički vesnik
dc.subject	triangulation of polyhedra	en
dc.subject	minimal triangulation	en
dc.title	Algorithms for triangulating polyhedra into a small number of tetrahedra	en
dc.type	article
dc.rights.license	BY
dc.citation.epage	9
dc.citation.issue	1-2
dc.citation.other	57(1-2): 1-9
dc.citation.spage	1
dc.citation.volume	57
dc.identifier.fulltext	http://prototype2.rcub.bg.ac.rs/bitstream/id/966/303.pdf
dc.identifier.rcub	conv_6
dc.identifier.scopus	2-s2.0-29244460949
dc.type.version	publishedVersion