Fast slicing of orthogonal covers using DCEL.(English)Zbl 1377.68284
Barneva, Reneta P. (ed.) et al., Combinatorial image analysis. 15th international workshop, IWCIA 2012, Austin, TX, USA, November 28–30, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-34731-3/pbk). Lecture Notes in Computer Science 7655, 16-30 (2012).
Summary: A combinatorial algorithm to find the intersection of an axis-parallel slicing plane with the orthogonal cover of a digital object is presented in this paper. The orthogonal cover is the smallest-volume 3D orthogonal polyhedron containing the object and stored in a doubly connected edge list (DCEL). Its intersection with the slicing plane consists of one or more isothetic polygons that provide topological information about the cover. The algorithm traverses the vertices on the polyhedron boundary and lying on the slicing plane, and the direction of next move from a vertex is determined by a set of linear equations in the integer domain. Results for few objects with successive slicing planes are presented to demonstrate the effectiveness and elegance of the algorithm.
For the entire collection see [Zbl 1259.68001].
For the entire collection see [Zbl 1259.68001].
MSC:
| 68U05 | Computer graphics; computational geometry (digital and algorithmic aspects) |
| 68U10 | Computing methodologies for image processing |
Keywords:
3D orthogonal cover;3D orthogonal polyhedron;3D orthogonal polyhedron;3D image analysis;DCELCite
Full Text:DOI
