Fast Edge-based Geodesic Poisson Disk Remeshing
dc.contributor.author | Uhlmann, Tom | en_US |
dc.contributor.author | Váša, Libor | en_US |
dc.contributor.author | Brunnett, Guido | en_US |
dc.contributor.editor | B. Bickel and T. Ritschel | en_US |
dc.date.accessioned | 2015-04-15T08:32:24Z | |
dc.date.available | 2015-04-15T08:32:24Z | |
dc.date.issued | 2015 | en_US |
dc.description.abstract | Triangular meshes of high complexity are common when created by a 3D scanner device and must be reduced for further processing. The geodesic Poisson disk remeshing [FZ08] is a method that generates a simplified mesh with highly regular triangles at the cost of exorbitant computation time. In this paper we will outline a new approach to this technique that makes it applicable for highly complex models. Our approach operates directly on the surface of the mesh, therefore works for meshes of arbitrary topology. Meshes consisting of millions of triangles can be reduced to an arbitrary complexity in just a few minutes while the original approach processes meshes with thousands of triangles in the same time. Our easy to implement remeshing technique also provides several options to preserve features. | en_US |
dc.description.sectionheaders | Geometry | en_US |
dc.description.seriesinformation | EG 2015 - Short Papers | en_US |
dc.identifier.doi | 10.2312/egsh.20151000 | en_US |
dc.identifier.pages | 1-4 | en_US |
dc.identifier.uri | https://doi.org/10.2312/egsh.20151000 | en_US |
dc.publisher | The Eurographics Association | en_US |
dc.subject | I.3.5 [Computer Graphics] | en_US |
dc.subject | Computational Geometry and Object Modeling | en_US |
dc.subject | Geometric algorithms | en_US |
dc.subject | languages | en_US |
dc.subject | and systems | en_US |
dc.title | Fast Edge-based Geodesic Poisson Disk Remeshing | en_US |
Files
Original bundle
1 - 1 of 1