ABSTRACT
No abstract available.
Index Terms
- Fast polygonal simplification with vertex-cluster trees
Recommendations
A topology-preserving polygonal simplification using vertex clustering
GRAPHITE '05: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East AsiaProduct developers have used a lot of polygon data, approximated from 3D-CAD data, as a collaboration tool on the Internet. It is difficult to deal with this data for example with respect to transmission, computational cost, or rendering, so ...
Carving for topology simplification of polygonal meshes
The topological complexity of polygonal meshes has a large impact on the performance of various geometric processing algorithms, such as rendering and collision detection algorithms. Several approaches for simplifying topology have been discussed in the ...
Material-Discontinuity Preserving Progressive Mesh Using Vertex-Collapsing Simplification
Level Of Detail (LOD) modelling or mesh reduction has been found useful in interactive walkthrough applications. Progressive meshing techniques based on edge or triangle collapsing have been recognised useful in continuous LOD, progressive refinement, ...
Comments