Simplification envelopes

@article{Cohen1996SimplificationE,
  title={Simplification envelopes},
  author={Jonathan D. Cohen and A. Varshney and D. Manocha and Greg Turk and Hans Weber and P. Agarwal and F. Brooks and W. Wright},
  journal={Proceedings of the 23rd annual conference on Computer graphics and interactive techniques},
  year={1996}
}
We propose the idea of simplification envelopes for generating a hierarchy of level-of-detail approximations for a given polygonal model. Our approach guarantees that all points of an approximation are within a user-specifiable distance from the original model and that all points of the original model are within a distance from the approximation. Simplificationenvelopes provide a general framework within which a large collection of existing simplification algorithms can run. We demonstrate this… Expand
submitted to Shape Modeling Intersection Free Simplification
Triangle mesh decimation and multi-resolution techniques are widely used in visualization applications for huge scenes. A large collection of different simplification algorithms exists in order toExpand
Intersection Free Simplification
TLDR
This work focuses on the prevention and avoidance of self-intersection during simplication with vertex pair contractions, and examines the geomorph9 of the parametrized vertex pair contraction and detects collisions of the affected simplices. Expand
Appearance-preserving simplification of polygonal models
TLDR
This dissertation focuses on the use of error metrics to provide guaranteed error bounds for the simplifications of polygonal models, and develops the first appearance-preserving simplification algorithm. Expand
Successive Mappings: An Approach to Polygonal Mesh Simplification with Guaranteed Error Bounds
TLDR
This work develops a piece-wise linear mapping function for each simplification operation and uses this function to measure deviation of the new surface from both the previous level of detail and from the original surface. Expand
GAPS: general and automatic polygonal simplification
TLDR
The algorithm, called General and Automatic Polygonal Simplification, or GAPS, uses an adaptive distance threshold and surface area preservation along with a quadric error metr ic to join unconnected regions of an object. Expand
Permission grids: practical, error-bounded simplification
TLDR
The permission grid is introduced, 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, making it more practical and efficient than current methods with similar guarantees. Expand
Locally Toleranced Surface Simplification
  • A. Guéziec
  • Mathematics, Computer Science
  • IEEE Trans. Vis. Comput. Graph.
  • 1999
TLDR
The mechanisms of error and tolerance volumes are extended to preserve during simplification scalar and vector attributes associated with surface vertices to preserve the volume of a solid to within machine accuracy. Expand
Model simplification using image and geometry-based metrics
This thesis describes methods for simplifying complex polygonal surfaces and optimizing their approximations. Such densely sampled surfaces often arise from range scanning, isosurface extraction, andExpand
Shape preserving polyhedral simplification with bounded error
TLDR
A new strategy is developed to produce the simplified polyhedron using front propagations and multiple remeshing schemes which take into account the discrete curvature characteristics of the object. Expand
Fast and memory efficient polygonal simplification
TLDR
It is demonstrated that excellent simplified models can be produced without the need to compare against information from the original geometry while performing local changes to the model. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 26 REFERENCES
Re-tiling polygonal surfaces
TLDR
This paper shows how a new set of vertices can be distributed over the surface of a model and connected to one another to create a re-tiling of a surface that is faithful to both the geometry and the topology of the original surface. Expand
Multi-resolution 3D approximations for rendering complex scenes
TLDR
This work presents a simple, effective, and efficient technique for approximating arbitrary polyhedra based on triangulation and vertex-clustering, and produces a series of 3D approximations that resemble the original object from all viewpoints, but contain an increasingly smaller number of faces and vertices. Expand
Multiresolution analysis of arbitrary meshes
TLDR
A method for overcoming the subdivision connectivity restriction, meaning that completely arbitrary meshes can now be converted to multiresolution form, is presented, based on the approximation of an arbitrary initial mesh M by a mesh MJ that has subdivision connectivity and is guaranteed to be within a specified tolerance. Expand
Geometric optimization
TLDR
This paper shows howCoplanar and nearly coplanar polygons can be merged into larger complex polygons and re-triangulated into fewer simple polygons than originally required. Expand
An adaptive subdivision method for surface-fitting from sampled data
TLDR
A method is developed for surface-fitting from sampled data based on an adaptive subdivision approach, a technique previously used for the design and display of free-form curved surface objects, which is simple in concept, yet realizes efficient data compression. Expand
Surface approximation and geometric partitions
TLDR
The main result of the paper is a polynomial-time approximation algorithm that computes a piecewise- linear surface of size O(Ko logKo), where Ko is the complexity of an optimal surface satisfying the constraints of the problem. Expand
Hierarchical geometric approximations
TLDR
This thesis is that using and extending concepts from computational geometry can help in devising eecient and parallelizable algorithms for automatically constructing useful detail hierarchies for geometric objects, and develops new algorithms for two kinds of geometric approximation problems that have been motivated by a single driving problem. Expand
Decimation of triangle meshes
TLDR
An application independent algorithm that uses local operations on geometry and topology to reduce the number of triangles in a triangle mesh and results from two different geometric modeling applications illustrate the strengths of the algorithm. Expand
Progressive meshes
TLDR
The progressive mesh (PM) representation is introduced, a new scheme for storing and transmitting arbitrary triangle meshes that addresses several practical problems in graphics: smooth geomorphing of level-of-detail approximations, progressive transmission, mesh compression, and selective refinement. Expand
Multiresolution analysis for surfaces of arbitrary topological type
TLDR
Whereas previous two-dimensional methods were restricted to functions difined on R2, the subdivision wavelets developed here may be applied to functions defined on compact surfaces of arbitrary topological type. Expand
...
1
2
3
...