TY - JOUR
T1 - A new lossless orthogonal simplification method for 3D objects based on bounding structures
AU - Cruz-Matías, Irving
AU - Ayala, Dolors
N1 - Funding Information:
This work was partially supported by the national Projects TIN2008-02903 and TIN2011-24220 of the Spanish government and a CONACYT grant of the Mexican government for I. Cruz-Matías. The authors thank the anonymous reviewers whose suggestions and questions gave them challenge and opportunity to greatly improve the paper.
Copyright:
Copyright 2014 Elsevier B.V., All rights reserved.
PY - 2014/7
Y1 - 2014/7
N2 - This paper presents a new approach to simplify 3D binary images and general orthogonal pseudo-polyhedra (OPP). The method is incremental and produces a level-of-detail sequence of OPP, where any object of this sequence bounds the previous objects and, therefore, is a bounding orthogonal approximation of them. The sequence finishes with the axis-aligned bounding box. OPP are encoded using the Extreme Vertices Model, a complete model that stores a subset of their vertices and performs fast Boolean operations. Simplification is achieved by using a new strategy, which relies on the application of 2D Boolean operations. We also present a technique, based on model continuity, for better shape preservation. Finally, we present a data structure to encode in a progressive and lossless way the generated sequence. Tests with several datasets show that the proposed method produces smaller storage sizes and good quality approximations compared with other methods that also produce bounding objects.
AB - This paper presents a new approach to simplify 3D binary images and general orthogonal pseudo-polyhedra (OPP). The method is incremental and produces a level-of-detail sequence of OPP, where any object of this sequence bounds the previous objects and, therefore, is a bounding orthogonal approximation of them. The sequence finishes with the axis-aligned bounding box. OPP are encoded using the Extreme Vertices Model, a complete model that stores a subset of their vertices and performs fast Boolean operations. Simplification is achieved by using a new strategy, which relies on the application of 2D Boolean operations. We also present a technique, based on model continuity, for better shape preservation. Finally, we present a data structure to encode in a progressive and lossless way the generated sequence. Tests with several datasets show that the proposed method produces smaller storage sizes and good quality approximations compared with other methods that also produce bounding objects.
UR - http://www.scopus.com/inward/record.url?scp=84896320594&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84896320594&partnerID=8YFLogxK
UR - https://www.mendeley.com/catalogue/892cf2f3-4e81-381f-90dc-abfb82fade65/
U2 - 10.1016/j.gmod.2014.01.002
DO - 10.1016/j.gmod.2014.01.002
M3 - Article
SN - 1524-0703
VL - 76
SP - 181
EP - 201
JO - Graphical Models
JF - Graphical Models
IS - 4
ER -