ARTSccelerated ray-tracing system
IEEE Computer Graphics and Applications
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Mesh reduction with error control
Proceedings of the 7th conference on Visualization '96
Dynamic view-dependent simplification for polygonal models
Proceedings of the 7th conference on Visualization '96
Model simplification using vertex-clustering
Proceedings of the 1997 symposium on Interactive 3D graphics
View-dependent refinement of progressive meshes
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
View-dependent simplification of arbitrary polygonal environments
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Surface simplification using quadric error metrics
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
VIS '97 Proceedings of the 8th conference on Visualization '97
Simplifying polygonal models using successive mappings
VIS '97 Proceedings of the 8th conference on Visualization '97
Controlled simplification of genus for polygonal models
VIS '97 Proceedings of the 8th conference on Visualization '97
MAPS: multiresolution adaptive parameterization of surfaces
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
A new Voronoi-based surface reconstruction algorithm
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
An accurate method for voxelizing polygon meshes
VVS '98 Proceedings of the 1998 IEEE symposium on Volume visualization
Fast and memory efficient polygonal simplification
Proceedings of the conference on Visualization '98
3D scan-conversion algorithms for voxel-based graphics
I3D '86 Proceedings of the 1986 workshop on Interactive 3D graphics
Out-of-core simplification of large polygonal models
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Controlled Topology Simplification
IEEE Transactions on Visualization and Computer Graphics
Superfaces: Polygonal Mesh Simplification with Bounded Error
IEEE Computer Graphics and Applications
GRIN'01 No description on Graphics interface 2001
Multiresolution Decimation based on Global Error
Multiresolution Decimation based on Global Error
EGWR'99 Proceedings of the 10th Eurographics conference on Rendering
Proceedings of the 1st international conference on Computer graphics and interactive techniques in Australasia and South East Asia
Topology preserving surface extraction using adaptive subdivision
Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Quadric-based simplification in any dimension
ACM Transactions on Graphics (TOG)
Construction of Simplified Boundary Surfaces from Serial-sectioned Metal Micrographs
IEEE Transactions on Visualization and Computer Graphics
ASM: An adaptive simplification method for 3D point-based models
Computer-Aided Design
Conservative swept volume boundary approximation
Proceedings of the 14th ACM Symposium on Solid and Physical Modeling
Hi-index | 0.00 |
We introduce the permission grid, a spatial occupancy grid which can be used to guide almost any standard polygonal surface simplification algorithm into generating an approximation with a guaranteed geometric error bound. In particular, all points on the approximation are guaranteed to be within some user-specified distance from the original surface. Such bounds are notably absent from many current simplification methods, and are becoming increasingly important for applications in scientific computing and adaptive level of detail control. Conceptually simple, the permission grid defines a volume in which the approximation must lie, and does not permit the underlying simplification algorithm to generate approximations outside the volume.The permission grid makes three important, practical improvements over current error-bounded simplification methods. First, it works on arbitrary triangular models, handling all manners of mesh degeneracies gracefully. Further, the error tolerance may be easily expanded as simplification proceeds, allowing the construction of an error-bounded level of detail hierarchy with vertex correspondences among all levels of detail. And finally, the permission grid has a representation complexity independent of the size of the input model, and a small running time overhead, making it more practical and efficient than current methods with similar guarantees.