Construction of an Approximate 3D Orthogonal Convex Skull
Orthogonal convex skull of a 3D digital object is a maximal volume orthogonal convex polyhedron lying entirely inside the object. An efficient combinatorial algorithm to construct an approximate 3D orthogonal convex skull of a digital object is presented in this paper. The 3D orthogonal inner cover, an orthogonal polyhedron which tightly inscribes the digital object, is divided into slab polygons and 2D orthogonal skulls of these slab polygons are combined together using combinatorial techniques to obtain an approximate 3D orthogonal convex skull. The algorithm operates in integer domain and requires at most two passes. The current version of the algorithm deals with non-intersecting objects free from holes and cavities. Experimentation on a wide range of digital objects has provided expected results, some of which are presented here to demonstrate the efficacy of the algorithm.
KeywordsApproximate 3D orthogonal convex skull Orthogonal slicing 3D orthogonal inner cover 3D concavity
A part of this research is funded by CSIR, Govt. of India.
- 4.Cabello, S., Cibulka, J., Kynčl, J., Saumell, M., Valtr, P.: Peeling potatoes near-optimally in near-linear time. In: Proc. 13th Annual Symposium on Computational Geometry, SOCG 2014, Kyoto, Japan. pp. 224–231. ACM, New York (2014)Google Scholar
- 5.Chang, J., Yap, C.: A polynomial solution for potato-peeling and other polygon inclusion and enclosure problems. In: Proceedings of the 25th Annual Symposium on Foundations of Computer Science, SFCS 1984, Singer Island, Florida, pp. 408–416. IEEE Computer Society, Washington, DC (1984)Google Scholar
- 12.Woo, T.: The convex skull problem. Technical report, Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, MI (1986)Google Scholar