Skip to main content
Conference Proceedings

On greedy tetrahedralization of points in 3D

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1994) 834 LNCS 532-540
DOI: 10.1007/3-540-58325-4_220
0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we show that a set of points in 3-D is not always greedy tetrahedralizable if the definition of greedy tetrahedralization is a straight-forward extension of the 2 - D counterpart. By generalizing the greedy definition, we show that there always exists such a tetrahedralization, which can be determined by a fast algorithm.

Cite

CITATION STYLE

APA

Chin, F. Y., & Wang, C. A. (1994). On greedy tetrahedralization of points in 3D. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 834 LNCS, pp. 532–540). Springer Verlag. https://doi.org/10.1007/3-540-58325-4_220

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free