Please note that eDoc will be permanently shut down in the first quarter of 2021!      Home News About Us Contact Contributors Disclaimer Privacy Policy Help FAQ

Quick Search
My eDoc
Session History
Support Wiki
Direct access to
document ID:

          Institute: MPI für Informatik     Collection: Computer Graphics Group     Display Documents

ID: 201843.0, MPI für Informatik / Computer Graphics Group
Dynamic Remeshing and Applications
Authors:Vorsatz, Jens; Rössl, Christian; Seidel, Hans-Peter
Editors:Elber, Gershon; Shapiro, Vadim
Place of Publication:New York, USA
Date of Publication (YYYY-MM-DD):2003
Title of Proceedings:Proceedings: 8th ACM Symposium on Solid Modeling and Applications (SM-03)
Start Page:167
End Page:175
Place of Conference/Meeting:Seattle, USA
(Start) Date of Conference/Meeting
Audience:Experts Only
Intended Educational Use:No
Abstract / Description:Triangle meshes are a flexible and generally accepted boundary
representation for complex geometric shapes. In addition to their
geometric qualities and topological simplicity, \emph{intrinsic}
qualities such as the shape of the triangles, their distribution on
the surface and the connectivity are essential for many algorithms
working on them. In this paper we present a flexible and efficient
remeshing framework that improves these intrinsic properties while
keeping the mesh geometrically close to the original surface. We
use a particle system approach and combine it with an incremental
connectivity optimization process to trim the mesh towards the
requirements imposed by the user. The particle system uniformly
distributes the vertices on the mesh, whereas the connectivity
optimization is done by means of \emph{Dynamic Connectivity Meshes},
a combination of local topological operators that lead to a fairly
regular connectivity. A dynamic skeleton ensures that our approach
is able to preserve surface features, which are particularly
important for the visual quality of the mesh. None of the
algorithms requires a global parameterization or patch layouting in
a preprocessing step but uses local parameterizations only. We also
show how this general framework can be put into practice and sketch
several application scenarios. In particular we will show how the
users can adapt the involved algorithms in a way that the resulting
remesh meets their personal requirements.
Last Change of the Resource (YYYY-MM-DD):2004-06-30
External Publication Status:published
Document Type:Conference-Paper
Communicated by:Hans-Peter Seidel
Affiliations:MPI für Informatik/Computer Graphics Group
Full Text:
You have privileges to view the following file(s):
sm03.pdf  [2,00 Mb] [Comment:file from upload service]  
vorsatz.pdf  [2,00 Mb] [Comment:file from upload service]  
The scope and number of records on eDoc is subject to the collection policies defined by each institute - see "info" button in the collection browse view.