Abstract
Let L be a set of line segments in three dimensional Euclidean space. In this paper, we prove several characterizations of tetrahe-dralizations. We present an O(nmlog n) algorithm to determine whether L is the edge set of a tetrahedralization, where m is the number of segments and n is the number of endpoints in L. We show that it is NP-complete to decide whether L contains the edge set of a tetrahe-dralization. We also show that it is NP-complete to decide whether L is tetrahedralizable. © Springer-Verlag Berlin Heidelberg 2002.
Cite
CITATION STYLE
Yang, B., Wang, C. A., & Chin, F. (2002). Algorithms and complexity for tetrahedralization detections. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2518 LNCS, pp. 296–307). https://doi.org/10.1007/3-540-36136-7_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
