Mesh sizing with additively weighted Voronoi diagrams
DSpace at IIT Bombay
View Archive InfoField | Value | |
Title |
Mesh sizing with additively weighted Voronoi diagrams
|
|
Creator |
ANTANI, L
DELAGE, C ALLIEZ, P |
|
Subject |
algorithms
|
|
Description |
We address the problem of generating mesh sizing functions from a set of points with specified sizing values. The sizing functions are shown to be maximal and K-Lipschitz, with arbitrary parameter K provided by the user. These properties allow generating low complexity meshes with adjustable gradation. After constructing an additively weighted Voronoi diagram, our algorithm provides fast and accurate answers to arbitrary point queries. We have implemented our mesh sizing technique as a sizing criterion for the 2D triangle meshing component from the CGAL library. We demonstrate the performance advantages of our technique through experimental results on various inputs.
|
|
Publisher |
SPRINGER-VERLAG BERLIN
|
|
Date |
2011-10-24T09:04:04Z
2011-12-15T09:11:33Z 2011-10-24T09:04:04Z 2011-12-15T09:11:33Z 2008 |
|
Type |
Proceedings Paper
|
|
Identifier |
PROCEEDINGS OF THE 16TH INTERNATIONAL MESHING ROUNDTABLE,335-346
978-3-540-75102-1 http://dx.doi.org/10.1007/978-3-540-75103-8_19 http://dspace.library.iitb.ac.in/xmlui/handle/10054/15371 http://hdl.handle.net/100/2138 |
|
Source |
16th International Meshing Roundtable,Seattle, WA,OCT 14-17, 2007
|
|
Language |
English
|
|