Computational geometry: an introduction
Computational geometry: an introduction
Set operations on polyhedra using binary space partitioning trees
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Linear programming and convex hulls made easy
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
The quickhull algorithm for convex hulls
ACM Transactions on Mathematical Software (TOMS)
Octree-based decimation of marching cubes surfaces
Proceedings of the 7th conference on Visualization '96
Surface simplification using quadric error metrics
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Multiresolution modeling using binary space patitioning trees
Computer Networks and ISDN Systems - Special issue on graphics research and education on the World Wide Web
On visible surface generation by a priori tree structures
SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
Voxel based object simplification
VIS '95 Proceedings of the 6th conference on Visualization '95
Binary space partitioning trees: a multiresolution approach
IV '97 Proceedings of the IEEE Conference on Information Visualisation
Removing excess topology from isosurfaces
ACM Transactions on Graphics (TOG)
Variational shape approximation
ACM SIGGRAPH 2004 Papers
Feature-based multiresolution modeling of solids
ACM Transactions on Graphics (TOG)
SMI '06 Proceedings of the IEEE International Conference on Shape Modeling and Applications 2006
Carving for topology simplification of polygonal meshes
Computer-Aided Design
Merging faces: a new orthogonal simplification of solid models
DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery
| Hi-index | 0.00 |
We present a volume and complexity bounded solid simplification of models represented by Binary Space Partition (BSP). Depending on the compact and robust representation of a solid model in BSP-tree, the boundary surface of a simplified model is guaranteed to be watertight and self-intersection free. Two techniques are investigated in this paper. The volume bounded convex simplification can collapse parts with small volumes on the model into a simple convex volume enclosing the volumetric cells on the input model. The selection of which region to simplify is based on a volume-difference metric, with the help of which the volume difference between the given model and the simplified one is minimized. Another technique is a plane collapse method which reduces the depth of the BSP-tree. These two techniques are integrated into our solid simplification algorithm to give satisfactory results.