Stochastic sampling in computer graphics
ACM Transactions on Graphics (TOG)
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Triangulating topological spaces
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
SIGGRAPH '96 Proceedings of the 23rd 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
Simplifying surfaces with color and texture using quadric error metrics
Proceedings of the conference on Visualization '98
Optimal triangulation and quadric-based surface simplification
Computational Geometry: Theory and Applications - Special issue on multi-resolution modelling and 3D geometry compression
The digital Michelangelo project: 3D scanning of large statues
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Out-of-core simplification of large polygonal models
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Efficient adaptive simplification of massive meshes
Proceedings of the conference on Visualization '01
Efficient simplification of point-sampled surfaces
Proceedings of the conference on Visualization '02
External Memory Management and Simplification of Huge Meshes
IEEE Transactions on Visualization and Computer Graphics
Variational shape approximation
ACM SIGGRAPH 2004 Papers
Statistical geometry representation for efficient transmission and rendering
ACM Transactions on Graphics (TOG)
ACM SIGGRAPH 2005 Papers
Large Mesh Simplification using Processing Sequences
Proceedings of the 14th IEEE Visualization 2003 (VIS'03)
A spatial data structure for fast Poisson-disk sample generation
ACM SIGGRAPH 2006 Papers
Real-time mesh simplification using the GPU
Proceedings of the 2007 symposium on Interactive 3D graphics and games
Stochastic simplification of aggregate detail
ACM SIGGRAPH 2007 papers
Surface sampling and the intrinsic Voronoi diagram
SGP '08 Proceedings of the Symposium on Geometry Processing
Technical Section: Fiedler trees for multiscale surface analysis
Computers and Graphics
Fast and reliable decimation of polygonal models based on volume and normal field
ISVC'10 Proceedings of the 6th international conference on Advances in visual computing - Volume Part I
| Hi-index | 0.00 |
We introduce TopStoc, a fast mesh simplification algorithm. The two main components are stochastic vertex selection and re-indexing of triangles. The probability for vertex selection depends on a local feature estimator, which prefers areas of high curvatures but still ensures sufficient sampling in flat parts. Re-indexing the triangles is done by breadth-first traversal starting from the selected vertices and then identifying triangles incident upon three regions. Both steps are linear in the number of triangles, require minimal data, and are very fast, while still preserving geometrical and topological features. Additional optional processing steps improve sampling properties and/or guarantee homotopy equivalence with the input. These properties provide an alternative to vertex clustering especially for CAD/CAM models in the areas of previewing or network graphics.