Orthogonal polyhedra as geometric bounds in constructive solid geometry
SMA '97 Proceedings of the fourth ACM symposium on Solid modeling and applications
Analyzing bounding boxes for object intersection
ACM Transactions on Graphics (TOG)
Shape-based volumetric collision detection
VVS '00 Proceedings of the 2000 IEEE symposium on Volume visualization
Simplification of Tetrahedral meshes with accurate error evaluation
Proceedings of the conference on Visualization '00
Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs
IEEE Transactions on Visualization and Computer Graphics
Orthogonal Polygons as Bounding Structures in Filter-Refine Query Processing Strategies
SSD '97 Proceedings of the 5th International Symposium on Advances in Spatial Databases
Efficient representation and extraction of 2-manifold isosurfaces using kd-trees
Graphical Models - Special issue on pacific graphics 2003
Ray tracing deformable scenes using dynamic bounding volume hierarchies
ACM Transactions on Graphics (TOG)
Velocity-Aligned Discrete Oriented Polytopes for Dynamic Collision Detection
IEEE Transactions on Visualization and Computer Graphics
Rendering continuous level-of-detail meshes by Masking Strips
Graphical Models
Carving for topology simplification of polygonal meshes
Computer-Aided Design
Volume and complexity bounded simplification of solid model represented by binary space partition
Proceedings of the 14th ACM Symposium on Solid and Physical Modeling
Technical Section: An approach to B-rep model simplification based on region suppression
Computers and Graphics
Reconstructing orthogonal polyhedra from putative vertex sets
Computational Geometry: Theory and Applications
A linear-time combinatorial algorithm to find the orthogonal hull of an object on the digital plane
Information Sciences: an International Journal
| Hi-index | 0.00 |
A new approach to simplify orthogonal pseudo-polyhedra (OPP) and binary volumes is presented. The method is incremental and produces a level-of-detail (LOD) sequence of OPP. Any object of this sequence contains the previous objects and, therefore, it is a bounding orthogonal approximation of them. The sequence finishes with the minimum axis-aligned bounding box (AABB). OPP are represented by the Extreme Vertices Model, a complete model that stores a subset of their vertices and performs fast Boolean operations. Simplification is achieved using a new approach called merging faces, which relies on the application of 2D Boolean operations. We also present a technique, based on the model continuity, for a better shape preservation. The method has been tested with several datasets and compared with two similar methods.