a developer’s survey of polygonal simplification algorithms
TRANSCRIPT
![Page 1: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/1.jpg)
A Developer’s Survey of Polygonal Simplification algorithms
CS 563 Advanced Topics in Computer Graphics
Fan WuMar. 31, 2005
![Page 2: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/2.jpg)
Some questions to ask…
§ Why simplification?
§ What are my models like?
§ What matters to me most?
![Page 3: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/3.jpg)
Why?
§ Eliminate redundant geometry
![Page 4: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/4.jpg)
Why?(Cont.)
§ Download models from the web
![Page 5: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/5.jpg)
Why?(Cont.)
§ Improve rendering speed (generating level of
details) –Produce LODs
![Page 6: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/6.jpg)
What are my models like?
§ Smooth, organic forms§ Machine parts with sharp corners
vDifferent models need different simplification algorithms
![Page 7: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/7.jpg)
What are my models like? (Cont.)
§ Precomputed lighting and textures§ Small number of large
complex object§ Multiple moderately
complex objects –video game§ Large number of small
objects –CAD models
![Page 8: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/8.jpg)
What’s important for you?
§ Geometric accuracy?§ Volume deviation
§ Visual fidelity? (how to measure?)§ Pre-processing time? § Run-time rendering time? § Automatic?
![Page 9: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/9.jpg)
Taxonomy of SA
§ Simplification algorithms can be classified into groups based on different criteria:
§ Topology preservation § Simplification Mechanism§ Static/Dynamic/View-dependent
![Page 10: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/10.jpg)
Topology
§ Refers to the connected polygonal mesh’s structure§ Genus: the number of holes (handles) in the object§ Sphere and Cube: 0
§ Doughnut and Coffee Cup : 1
![Page 11: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/11.jpg)
Topology
§ Refers to the connected polygonal mesh’s structure§ Genus: the number of holes (handles) in the object§ Sphere and Cube: 0
§ Doughnut and Coffee Cup : 1
![Page 12: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/12.jpg)
Topology
§ Refers to the connected polygonal mesh’s structure§ Genus: the number of holes (handles) in the object§ Sphere and Cube: 0
§ Doughnut and Coffee Cup : 1
![Page 13: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/13.jpg)
Topology (Cont.)
§ 2D manifold (local property)§ Exact two triangle share an edge§ Every vertex is shared by a ring of triangles to form
a surface (local topology is a disc)§ Every triangle shares edges with exact three
triangles
![Page 14: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/14.jpg)
Topology (Cont.)
§ Examples of manifold and non-manifold
![Page 15: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/15.jpg)
Topology and SA
§ Topology-preserving algorithms§ Preserve manifold connectivity at every step (don’t
close up or create holes)
Yes Yes No
![Page 16: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/16.jpg)
Topology and SA (Cont.)
§ ☺ Good visual fidelity § L Limited simplification§ L Often require the model to be a manifold
to begin with (less robust)
Topology-preserving algorithms
![Page 17: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/17.jpg)
Topology and SA (Cont.)
Opposite: Topology-modifying algorithms
n ☺ Permit drastic simplificationn L Poor visual quality/Popping effectn L Often insensitive to topological features
üWork best when drastic simplification is needed (visualization or complex scenes)
![Page 18: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/18.jpg)
Topology and SA Summary
§ Topology-preserving or Topology-modifying? § Topology-tolerant or Topology-sensitive?
Questions to ask before using the algorithm:
![Page 19: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/19.jpg)
Mechanism
§ Strategies used to remove polygons§ Sampling § Adaptive Subdivision§ Decimation § Vertex Merging
![Page 20: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/20.jpg)
(1) Sampling
§ Sample the surface: § Embedding a 3D volumetric grid around the
surface
§ Remove high-frequency (fine) features§ Applying image processing to perform low-pass
filter
§ Recover the surface from filtered samples:§ Recover the simplified surface from the low-
passed volume
![Page 21: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/21.jpg)
Sampling (Cont.)
§ ☺ High frequency features are gradually removed§ ☺ high frequency
features are hard to sample
üWork best for smooth objects
![Page 22: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/22.jpg)
(2) Adaptive Subdivision
§ Find a base mesh § Recursively subdivide the base mesh to
approach the initial mesh § Example: Terrain simplification (rectangle as
the base mesh)
![Page 23: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/23.jpg)
Adaptive Subdivision (Cont.)
§ Work best when the base mesh is easily found (can be very hard)§ Preserve topology § Multi-resolution editing (low level feature
naturally propagate to finer level)
![Page 24: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/24.jpg)
(3) Decimation
§ Iteratively remove vertices from the mesh§ Remove the associated triangles§ Retriangulate the resulting holes at each step
![Page 25: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/25.jpg)
Decimation (Cont.)
§ Simple to code and very fast§ Topology preserving § No drastic simplification§ Topology tolerant
![Page 26: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/26.jpg)
Vertex Merging
§ Collapsing two or more vertices into a single vertex § Reconnecting the points with the remaining
adjacent vertices§ Different algorithms have varying
sophistication in which vertices to merge in what order
![Page 27: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/27.jpg)
Vertex Merging (Cont.)
![Page 28: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/28.jpg)
Mechanism Summary
§ Sampling § Adaptive Subdivision§ Decimation§ Vertex Merging
![Page 29: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/29.jpg)
Static/Dynamic/View-dependent
§ Static: Compute a fixed set of simplifications or LODs offline§ Dynamic: Encoding a continuous spectrum of
LODs as opposed to a fixed set§ Better granularity§ Support progressive transmission
![Page 30: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/30.jpg)
Static/Dynamic/View-dependent
§ View-dependent: Extending Dynamic methods – LOD selections are based on view dependent criteria: § Distance to the eye§ Silhouette regions§ ☺ better fidelity for a given polygon count§ L increase the run time CPU load for choosing the
LODs
![Page 31: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/31.jpg)
A Brief catalog of algorithms
§ A Brief catalog of algorithms§ How they treat topology§ Whether they use static, dynamic, or view-
dependent simplification
![Page 32: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/32.jpg)
Triangle mesh decimation
§ A multiple-pass algorithm§ During each pass, perform the following three
basic steps on every vertex:§ Classify the local geometry and topology for this given
vertex§ Use the decimation criterion to decide if the vertex
can be deleted§ If the point is deleted, re-triangulate the resulting
hole.§ This vertex removal process repeats, with
possible adjustment of the decimation criteria, until some termination condition is met.
![Page 33: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/33.jpg)
Triangle mesh decimation
§ Topology § Topology preserving§ Topology tolerant
§ Mechanism§ Decimation
§ Simple and fast§ only limited to manifold surfaces
§Overall
![Page 34: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/34.jpg)
Triangle mesh decimation
§ Topology § Topology modifying
§ Mechanism§ Decimation
§ Decimation code§ http://public.kitware.com/VTK/
§Topology-modifying algorithm
![Page 35: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/35.jpg)
Vertex clustering
§ Uniform rectilinear partitioning of vertices into 3D grid cells
§ Replace all vertices in a grid cell by a single representative vertex
![Page 36: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/36.jpg)
Vertex clustering
§ New algorithm:§ Use error quadrics instead of grading each vertex with
an important value§ Compared to original vertex pair contraction algorithm,
the sequence of contractions is determined by the cluster grid rather than by the mesh geometry§ Floating-Cell clustering. Assign an importance to
vertices and sort the vertices by importance
![Page 37: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/37.jpg)
Vertex clustering
§ Topology § Topology modifying§ Topology insensitive
§ Fast§ Poor quality
§Overall
![Page 38: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/38.jpg)
Multiresolution analysis of arbitrary meshes
§ Main idea§ Uses a compact wavelet representation to guide
a recursive subdivision process§ multiresolution representation of mesh M = base
shape M 0 + sum of local correction terms (wavelet terms)
![Page 39: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/39.jpg)
Multiresolution analysis of arbitrary meshes
• • •
base shape M M 00
mesh Mmesh M
![Page 40: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/40.jpg)
Multiresolution analysis of arbitrary meshes
§ Overall§ Possesses the disadvantages of strict topology-
preserving approachs§ The fidelity of the resulting is high for smooth,
organic forms§ Difficulty in capturing sharp features
![Page 41: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/41.jpg)
Voxel-based object simplification
§ Main idea§ Sampling§ Polygonal§ Range scanned§ Volume§ Mathematical function
§ Controlled Filtering, Use low-pass filtering to create frequency-limited versions of the sampled volume§ Reconstruction§ Volume reconstruction§ Surface reconstruction
![Page 42: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/42.jpg)
Voxel-based object simplification
![Page 43: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/43.jpg)
Multiresolution analysis of arbitrary meshes
§ Overall§ High-frequency details are eliminated§ Not topology tolerant
![Page 44: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/44.jpg)
Simplification Envelopes
§ Main idea§ Bound error by requiring simplified surface to lie
within surfaces offset by ε
![Page 45: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/45.jpg)
Simplification Envelopes
Cohen, Varshney, et al., “Simplification Envelopes,” Proceedings of SIGGRAPH 96
![Page 46: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/46.jpg)
Simplification Envelopes
§ Overall§ Topology preserving§ Excellent choice where fidelity and topology
preservation are crucial§ Can be combined with most other meshes§ The strict of preservation of topology curtails the
capability for drastic simplification§ http://www.cs.unc.edu/~geom/envelope.html
![Page 47: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/47.jpg)
Appearance-preserving Simplification
§ Main idea§ Preserve three appearance attributes:§ Surface Position§ Surface Curvature§ Material Color
§ Colors and normals stored in texture and normal maps
§ Texture deviation computed using parametric correspondence
§ Preserves colors and normals, bounding texture motion in object and screen space
![Page 48: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/48.jpg)
Appearance-preserving Simplification
Cohen, Olano, and Manocha, “Appearance-Preserving Simplification,” Proceedings of SIGGRAPH 98.
![Page 49: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/49.jpg)
Appearance-preserving Simplification
§ Overall§ Useful on models that don’t require dynamic
lighting§ The standard for high-fidelity simplification
![Page 50: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/50.jpg)
Quadric error metrics
§ Main idea§ Iteratively contract vertex pairs ( a generalization of
edge contraction)§ As the algorithm proceeds, a geometric error
approximation is maintained at each vertex of the model which is represented using quadric matrices§ The algorithm proceeds until the simplification goals
are satisfied.
![Page 51: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/51.jpg)
Quadric error metrics
An example sequence of approximations generated by the algorithm. The entire sequence was constructed in about one second.
5,804 faces 994 faces 532 faces 248 faces 64 faces
![Page 52: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/52.jpg)
Quadric error metrics
§ Overall§ Continuous LODs§ The algorithm can provide high efficiency, high
quality and high generality§ Running time approaches O(n2), but Erikson and
Manocha proposed an adaptive threshold selection scheme that addresses this problem§ Qslim.
http://graphics.cs.uiuc.edu/~garland/software/qslim.html
![Page 53: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/53.jpg)
Image-driven Simplification
§ Main idea§ Use edge collapse§ Two decisions§ Where to place new vertex§ How to order edge collapse (Lazy queue algorithm)
§ RMS root-mean-square (dRMS)
![Page 54: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/54.jpg)
Image-driven Simplification
![Page 55: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/55.jpg)
Image-driven Simplification
§ Overall§ Trade-off between simplification and the risk of
missing an important effect§ High-fidelity preservation of regions with drastic
simplification of unseen model geometry§ Slow
![Page 56: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/56.jpg)
Progressive meshes
§ Main idea§ New mesh simplification procedure§ Ecol§ vspl
§ New representation§ Progressive meshes
ecol(vecol(vs s ,,vvtt , , vvss ))
vvll vvrr
vvtt
vvss
vvssvvll vvrr
((optimization)optimization)
’’
’’
vvssvvll vvrr
vsplvspl(v(vs s ,v,vl l ,v,vr r , , vvss ,,vvtt ,,……))
vvll vvrr
vvtt
vvss
’’ ’’’’
’’
attributesattributes
![Page 57: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/57.jpg)
Progressive meshes
13,54613,546 500500 152152 150150
MM00MM11MM175175
ecolecol00ecolecoliiecolecolnn--11
M=MM=Mnn^̂
150150
MM00 MM11
vsplvspl00
152152
MM175175
500500
…… vsplvsplii ……
13,54613,546
vsplvsplnn--11
MMnn=M=M^̂
progressive mesh (PM)progressive mesh (PM) representationrepresentation
vsplvspl00 …… vsplvsplii …… vsplvsplnn--11
MM00 MMnn=M=M^̂
![Page 58: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/58.jpg)
Progressive meshes
§ Overall§ continuous-resolution§ smooth LOD§ space-efficient§ progressive
§ Advantages of MRA§ encodes geometry & color independently§ supports multiresolution editing
§ Advantages of PM§ lossless§ more accurate§ captures discrete attributes§ captures discontinuities
![Page 59: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/59.jpg)
Hierarchical dynamic simplification
§ Main idea§ Construct a view-dependent tree
V1 V2
V5 V4
Va Vb V3V6
Split Merge
V1 V2
V5 V4
V3V6 V
![Page 60: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/60.jpg)
Hierarchical dynamic simplification
§ Overall§ Not topology preserving§ Topology tolerant§ Dynamic§ Simple to code§ Any algorithm based on vertex merging can be
used§ fast, but limited by input geometry§ VDSlib
Http://vdslib.virginia.edu
![Page 61: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/61.jpg)
Issues and Trends
§ Converge on vertex merging as the underlying mechanism§ Hierarchical vertex merging provides general
framework§ Still lack an agree-upon definition of fidelity § Perceptual metric is hard to get
![Page 62: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/62.jpg)
Reference
§ [1] A Developer's Survey of Polygonal Simplification Algorithms, David P.
Lueke IEEE CG&A, May/June, 2001
§ [2] Topology Preserving Edge Contraction, Tamal Dey and Herbert
Edelsbrunner
§ [3] Decimation of Triangle Meshes, W. Schroeder, J. Zarge, and W.
Lorenson, ACM SIGGRAPH'92
§ [4] Simplification Using Quadric Error Metrics, M. Garland and P. Heckbert,
ACM SIGGRAPH'97
§ [5] Voxel-Based Object Simplification, T. He et al, IEEE Visualization '95
§ [6] Simplification Envelopes, J. Cohen et al, ACM SIGGRAPH 96
§[7] Appearance Perserving Simplification,
J. Cohen et al, ACM SIGGRAPH 98
§[8] View-Dependent Simplification of
Arbitrary Polygonal Environment, D.
Luebke and C. Erikson , ACM SIGGRAPH'97
§[9] Out-of-Core Simplification of Large
Polygonal Models, P. Lindstrom, ACM
SIGGRAPH 2000
§[10] Image-Driven Simplification, P.
Lindstrom and G. Turk, ACM Transactions
on Graphics, vol.19, no. 3
§[11] Geometric Compression, M. Deering,
ACM SIGGRAPH 95
![Page 63: A Developer’s Survey of Polygonal Simplification algorithms](https://reader036.vdocuments.us/reader036/viewer/2022081701/62e4b6ea9486d858da08f430/html5/thumbnails/63.jpg)
Reference
§[7] Appearance Perserving Simplification, J. Cohen et al, ACM SIGGRAPH 98
§[8] View-Dependent Simplification of Arbitrary Polygonal Environment, D.
Luebke and C. Erikson , ACM SIGGRAPH'97
§[9] Out-of-Core Simplification of Large Polygonal Models, P. Lindstrom, ACM
SIGGRAPH 2000
§[10] Image-Driven Simplification, P. Lindstrom and G. Turk, ACM
Transactions on Graphics, vol.19, no. 3
§[11] Geometric Compression, M. Deering, ACM SIGGRAPH 95