decimation of triangle meshes
DESCRIPTION
Decimation of Triangle Meshes. Paper by W.J.Schroeder et.al Presented by Guangfeng Ji. Goal. Reduce the total number of triangles in a triangle mesh Preserve the original topology and a good approximation of the original geometry. Overview. A multiple-pass algorithm - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Decimation of Triangle Meshes](https://reader030.vdocuments.net/reader030/viewer/2022033021/5681329c550346895d993a95/html5/thumbnails/1.jpg)
Decimation of Triangle Meshes
Paper by W.J.Schroeder et.al
Presented by Guangfeng Ji
![Page 2: Decimation of Triangle Meshes](https://reader030.vdocuments.net/reader030/viewer/2022033021/5681329c550346895d993a95/html5/thumbnails/2.jpg)
Goal Reduce the total number of triangles in
a triangle mesh
Preserve the original topology and a good approximation of the original geometry
![Page 3: Decimation of Triangle Meshes](https://reader030.vdocuments.net/reader030/viewer/2022033021/5681329c550346895d993a95/html5/thumbnails/3.jpg)
Overview 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 4: Decimation of Triangle Meshes](https://reader030.vdocuments.net/reader030/viewer/2022033021/5681329c550346895d993a95/html5/thumbnails/4.jpg)
Three Steps Basically for each vertex, three steps
are involved:– Characterize the local vertex geometry
and topology– Evaluate the decimation criteria– Triangulate the resulting hole.
![Page 5: Decimation of Triangle Meshes](https://reader030.vdocuments.net/reader030/viewer/2022033021/5681329c550346895d993a95/html5/thumbnails/5.jpg)
Feature Edge A feature edge exists if the angle
between the surface normals of two adjacent triangles is greater than a user-specified “feature angle”.
![Page 6: Decimation of Triangle Meshes](https://reader030.vdocuments.net/reader030/viewer/2022033021/5681329c550346895d993a95/html5/thumbnails/6.jpg)
Characterize Local Geometry and Topology
Each vertex is assigned one of five possible classifications:– Simple vertex– Complex vertex– Boundary vertex– Interior edge vertex– Corner vertex
![Page 7: Decimation of Triangle Meshes](https://reader030.vdocuments.net/reader030/viewer/2022033021/5681329c550346895d993a95/html5/thumbnails/7.jpg)
Evaluate the Decimation Criteria
Complex vertices are not deleted from the mesh.
Use the distance to plane criterion for simple vertices.
Use the distance to edge criterion for boundary and interior edge vertices.
Corner vertex?
![Page 8: Decimation of Triangle Meshes](https://reader030.vdocuments.net/reader030/viewer/2022033021/5681329c550346895d993a95/html5/thumbnails/8.jpg)
Criterion for Simple Vertices
Use the distance to plane criterion. If the vertex is within the specified
distance to the average plane, it can be deleted. Otherwise, it is retained.
![Page 9: Decimation of Triangle Meshes](https://reader030.vdocuments.net/reader030/viewer/2022033021/5681329c550346895d993a95/html5/thumbnails/9.jpg)
Criterion for Boundary &Interior Edge Vertices
Use the distance to edge criterion. If the distance to the line defined by
two vertices creating the boundary or feature edges is less than a specified value, the vertex can be deleted.
![Page 10: Decimation of Triangle Meshes](https://reader030.vdocuments.net/reader030/viewer/2022033021/5681329c550346895d993a95/html5/thumbnails/10.jpg)
Criterion for Corner Vertices
Corner vertices are usually not deleted to keep the sharp features.
But it is not always desirable to retain feature edges.– Meshes containing areas of relatively small
triangles with large feature angles– Small triangles which are the result of ‘noise’ in
the original mesh. Use the distance to plane criterion.
![Page 11: Decimation of Triangle Meshes](https://reader030.vdocuments.net/reader030/viewer/2022033021/5681329c550346895d993a95/html5/thumbnails/11.jpg)
Triangulate the Hole Deleting a vertex and its associated
triangles creates one(simple or boundary vertex) or two loops(interior edge vertex).
The resulting hole should be triangulated. From the Euler relation, it follows that
removal of a simple, corner, interior edge vertex reduces the mesh by exactly two triangles. For boundary vertex, exactly one triangles.
![Page 12: Decimation of Triangle Meshes](https://reader030.vdocuments.net/reader030/viewer/2022033021/5681329c550346895d993a95/html5/thumbnails/12.jpg)
Recursive Splitting Method
The author used a recursive loop splitting method.– Divided the loop into two halves along a line defined from
two non-neighboring vertices in the loop.– Each new loop is divided until only three vertices remain in
each loop.
![Page 13: Decimation of Triangle Meshes](https://reader030.vdocuments.net/reader030/viewer/2022033021/5681329c550346895d993a95/html5/thumbnails/13.jpg)
Special Cases Repeated decimation may produce a
simple closed surface, such as tetrahedron. Eliminating a vertex would modify the topology.
![Page 14: Decimation of Triangle Meshes](https://reader030.vdocuments.net/reader030/viewer/2022033021/5681329c550346895d993a95/html5/thumbnails/14.jpg)
Overall Topology
– Topology preserving– Topology tolerant
Mechanism– Decimation
![Page 15: Decimation of Triangle Meshes](https://reader030.vdocuments.net/reader030/viewer/2022033021/5681329c550346895d993a95/html5/thumbnails/15.jpg)
Results
![Page 16: Decimation of Triangle Meshes](https://reader030.vdocuments.net/reader030/viewer/2022033021/5681329c550346895d993a95/html5/thumbnails/16.jpg)
Mars
![Page 17: Decimation of Triangle Meshes](https://reader030.vdocuments.net/reader030/viewer/2022033021/5681329c550346895d993a95/html5/thumbnails/17.jpg)
Honolulu,Hawaii
![Page 18: Decimation of Triangle Meshes](https://reader030.vdocuments.net/reader030/viewer/2022033021/5681329c550346895d993a95/html5/thumbnails/18.jpg)
Head
![Page 19: Decimation of Triangle Meshes](https://reader030.vdocuments.net/reader030/viewer/2022033021/5681329c550346895d993a95/html5/thumbnails/19.jpg)
Thanks!
![Page 20: Decimation of Triangle Meshes](https://reader030.vdocuments.net/reader030/viewer/2022033021/5681329c550346895d993a95/html5/thumbnails/20.jpg)
Simple Vertex A simple vertex is surrounded by a complete
cycle of triangles, and each edge the uses the vertex is used by exactly two triangles.
Back
![Page 21: Decimation of Triangle Meshes](https://reader030.vdocuments.net/reader030/viewer/2022033021/5681329c550346895d993a95/html5/thumbnails/21.jpg)
Complex Vertex If the vertex is used by a triangle not in the
cycle of triangles, or if the edge is not used by two triangles, then the vertex is complex.
Back
![Page 22: Decimation of Triangle Meshes](https://reader030.vdocuments.net/reader030/viewer/2022033021/5681329c550346895d993a95/html5/thumbnails/22.jpg)
Boundary Vertex A vertex within a semi-cycle of triangles is a
boundary vertex.
Back
![Page 23: Decimation of Triangle Meshes](https://reader030.vdocuments.net/reader030/viewer/2022033021/5681329c550346895d993a95/html5/thumbnails/23.jpg)
Interior Edge Vertex If a vertex is used by exactly two feature
edges, the vertex is an interior edge vertex.
Back
![Page 24: Decimation of Triangle Meshes](https://reader030.vdocuments.net/reader030/viewer/2022033021/5681329c550346895d993a95/html5/thumbnails/24.jpg)
Corner Vertex The vertex is a corner vertex if one or three
or more feature edges used the vertex.
Back