Abstract
We present improved subdivision and isosurface reconstruction algorithms for polygonizing implicit surfaces and performing accurate geometric operations. Our improved reconstruction algorithm uses directed distance fields [Kobbelt et al. 2001] to detect multiple intersections along an edge, separates them into components and reconstructs an isosurface locally within each component using the dual contouring algorithm [Ju et al. 2002]. It can reconstruct thin features without creating handles and results in improved surface extraction from volumetric data. Our subdivision algorithm takes into account sharp features that arise from intersecting surfaces or Boolean operations and generates an adaptive grid such that each voxel has at most one sharp feature. The subdivision algorithm is combined with our improved reconstruction algorithm to compute accurate polygonization of Boolean combinations or offsets of complex primitives that faithfully reconstruct the sharp features. We have applied these algorithms to polygonize complex CAD models designed using thousands of Boolean operations on curved primitives.
Original language | English |
---|---|
Pages | 99-106 |
Number of pages | 8 |
DOIs | |
State | Published - 2003 |
Event | VIS 2003 PROCEEDINGS - Seattle, WA, United States Duration: 19 Oct 2003 → 24 Oct 2003 |
Conference
Conference | VIS 2003 PROCEEDINGS |
---|---|
Country/Territory | United States |
City | Seattle, WA |
Period | 19/10/03 → 24/10/03 |
Keywords
- Boolean operations
- Distance fields
- Implicit modeling
- Marching Cubes
- Subdivision