Detecting tetrahedralizations of a set of line segments☆
Review articleOpen access
Abstract:

AbstractLet L be a set of line segments in three dimensional Euclidean space. In this paper, we prove several characterizations of tetrahedralizations. We present an O(mnlogn) 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 distinct endpoints of segments in L. We show that it is NP-complete to decide whether L contains the edge set of a tetrahedralization. We also show that it is NP-complete to decide whether L is a subset of the edge set of a tetrahedralization.

Request full text

References (0)

Cited By (0)

No reference data.
No citation data.
Advertisement
Join Copernicus Academic and get access to over 12 million papers authored by 7+ million academics.
Join for free!