Name
Abstract | ||
|---|---|---|
We present a Delaunay based algorithm for simplifying vector field datasets. Our aim is to reduce the size of the mesh on which the vector field is defined while preserving topological features of the original vector field. We leverage a simple paradigm, vertex deletion in Delaunay triangulations, to achieve this goal. This technique is effective for two reasons. First, we guide deletions by a local error metric that bounds the change of the vectors at the affected simplices and maintains regions near critical points to prevent topological changes. Second, piecewise-linear interpolation over Delaunay triangulations is known to give good approximations of scalar fields. Since a vector field can be regarded as a collection of component scalar fields, a Delaunay triangulation can preserve each component and thus the structure of the vector field as a whole. We provide experimental evidence showing the effectiveness of our technique and its ability to preserve features of both two and three dimensional vector fields. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/PG.2007.6 | Pacific Conference on Computer Graphics and Applications |
Keywords | Field | DocType |
vector field,mesh generation,approximation theory,delaunay triangulation,critical point,scalar field,interpolation,computational geometry,piecewise linear,three dimensional | Mathematical optimization,Chew's second algorithm,Bowyer–Watson algorithm,Vector field,Computer science,Interpolation,Scalar (physics),Algorithm,Constrained Delaunay triangulation,Ruppert's algorithm,Delaunay triangulation | Conference |
ISBN | Citations | PageRank |
0-7695-3009-5 | 5 | 0.43 |
References | Authors | |
22 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tamal K. Dey | 1 | 2349 | 169.82 |
| Joshua A. Levine | 2 | 369 | 19.64 |
| Rephael Wenger | 3 | 441 | 43.54 |