Issue No. 01 - January/February (2008 vol. 14)

ISSN: 1077-2626

pp: 73-83

ABSTRACT

<p><b>Abstract</b>—This paper presents the layer-based representation of polyhedrons and its use for point-in-polyhedron tests. In the representation, the facets and edges of a polyhedron are sequentially arranged, and so the binary search algorithm is efficiently used to speed up inclusion tests. In comparison with conventional representation for polyhedrons, the layer-based representation we propose greatly reduces the storage requirement because it represents much information implicitly, though it still has a storage complexity <i>O(n)</i>. It is simple to implement, and robust for inclusion tests because many singularities are erased in constructing the layer-based representation. Incorporating an octree structure for organizing polyhedrons, our approach can run at a speed comparable with BSP-based inclusion tests, and at the same time greatly reduce storage and preprocessing time in treating large polyhedrons. We have developed an efficient solution for point-in-polyhedron tests with the time complexity varying between <i>O(n)</i> and <i>O(log n)</i>, depending on the polyhedron shape and the constructed representation, and less than <i>O(log^3 n)</i> in most cases. The time complexity of preprocess is between <i>O(n)</i> and <i>O(n^2)</i>, varying with polyhedrons, where <i>n</i> is the edge number of a polyhedron.</p>

INDEX TERMS

computational geometry, polyhedron, point containment, solid representation

CITATION

J. Li, H. Sun, E. Wu and W. Wang, "Layer-Based Representation of Polyhedrons for Point Containment Tests," in

*IEEE Transactions on Visualization & Computer Graphics*, vol. 14, no. , pp. 73-83, 2007.

doi:10.1109/TVCG.2007.70407

CITATIONS