Loading...
Please wait, while we are loading the content...
Similar Documents
Adaptive Polygonal Mesh Simplification With Discrete Centroidal Voronoi Diagrams
| Content Provider | Semantic Scholar |
|---|---|
| Author | Valette, Sébastien Kompatsiaris, Ioannis |
| Copyright Year | 2005 |
| Abstract | In this paper, we propose an adaptive polygonal mesh coarsening algorithm. This approach is based on the clustering of the input mesh triangles, driven by a discreti zed variationnal definition of centroidal tesselations. It is able to simplify meshes with high complexity i.e. meshes with a larg e number of vertices and high genus. We demonstrate the abilit y our scheme to simplify meshes according to local features su ch as curvature measures. We also introduce an initial samplin g strategy which speeds up the algorithm, an on-the-fly checki ng step to guarantee the validity of the clustering, and a postprocessing step to enhance the quality of the approximating mesh. Experimental results show the efficiency of our scheme both i n terms of speed and visual quality. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.creatis.insa-lyon.fr/~valette/pub/VKC05ICMI.pdf |
| Alternate Webpage(s) | https://www.creatis.insa-lyon.fr/~valette/pub/VKC05ICMI.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
