Delaunay meshing of isosurfaces |
| |
Authors: | Tamal K Dey Joshua A Levine |
| |
Affiliation: | (1) Department of Computer Science and Engineering, The Ohio State University, Columbus, OH 43201, USA |
| |
Abstract: | We present an isosurface meshing algorithm, DelIso, based on the Delaunay refinement paradigm. This paradigm has been successfully applied to mesh a variety of domains with
guarantees for topology, geometry, mesh gradedness, and triangle shape. A restricted Delaunay triangulation, dual of the intersection
between the surface and the three-dimensional Voronoi diagram, is often the main ingredient in Delaunay refinement. Computing
and storing three-dimensional Voronoi/Delaunay diagrams become bottlenecks for Delaunay refinement techniques since isosurface
computations generally have large input datasets and output meshes. A highlight of our algorithm is that we find a simple
way to recover the restricted Delaunay triangulation of the surface without computing the full 3D structure. We employ techniques
for efficient ray tracing of isosurfaces to generate surface sample points, and demonstrate the effectiveness of our implementation
using a variety of volume datasets. |
| |
Keywords: | Delaunay refinement Isosurfaces Mesh generation |
本文献已被 SpringerLink 等数据库收录! |
|