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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Amenta, N., Bern, M.: Surface reconstruction by Voronoi filtering. Discrete Comput. Geom. 22, 481–504 (1999)
Bhaniramka, P., Wenger, R., Crawfis, R.: Isosurface construction in any dimension using convex hulls. IEEE Trans. Vis. Comput. Graph. 10, 130–141 (2004)
Boissonnat, J.D., Cohen-Steiner, D., Vegter, G.: Isotopic implicit surface meshing. In: STOC ’04: Proceedings of the 36th ACM Symposium on Theory of Computing, pp. 301–309. ACM Press, New York (2004)
Boissonnat, J.D., Oudot, S.: Provably good surface sampling and approximation. In: SGP ’03: Proceedings of the 2003 Eurographics/ACM SIGGRAPH Symposium on Geometry Processing, pp. 9–18. Academic Press Professional, San Diego (2003)
Cheng, S.W., Dey, T.K., Levine, J.A.: A practical Delaunay meshing algorithm for a large class of domains. In: 16IMR: Proceedings of the 16th International Meshing Roundable, pp. 477–494. Springer, Berlin (2007)
Cheng, S.W., Dey, T.K., Ramos, E.A.: Delaunay refinement for piecewise smooth complexes. In: SODA ’07: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1096–1105. ACM Press, New York (2007)
Cheng, S.W., Dey, T.K., Ramos, E.A., Ray, T.: Quality meshing for polyhedra with small angles. Int. J. Comput. Geom. Appl. 15(4), 421–461 (2005)
Cheng, S.W., Dey, T.K., Ramos, E.A., Ray, T.: Sampling and meshing a surface with guaranteed topology and geometry. SIAM J. Comput. 37(4), 1199–1227 (2007)
Chernyaev, E.V.: Marching cubes 33: Construction of topologically correct isosurfaces. CERN, Geneva (1995)
Chew, L.P.: Guaranteed-quality mesh generation for curved surfaces. In: SCG ’93: Proceedings of the 9th Symposium on Computational Geometry, pp. 274–280. ACM Press, New York (1993)
Dey, T.K.: Curve and Surface Reconstruction: Algorithms with Mathematical Analysis. Cambridge University Press, New York (2007)
Dey, T.K., Li, G., Ray, T.: Polygonal surface remeshing with Delaunay refinement. In: 14IMR: Proceedings of the 14th International Meshing Roundtable, pp. 343–361. Springer, Berlin (2005)
Edelsbrunner, H., Shah, N.R.: Triangulating topological spaces. In: SCG ’94: Proceedings of the 10th Symposium on Computational Geometry, pp. 285–292. ACM Press, New York (1994)
Havran, V.: Heuristic ray shooting algorithms. Ph.D. thesis, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague (2000)
Lorensen, W.E., Cline, H.E.: Marching cubes: A high resolution 3d surface construction algorithm. In: SIGGRAPH ’87: Proceedings of the 14th Conference on Computer Graphics and Interactive Techniques, vol. 21, pp. 163–169. ACM Press, New York (1987)
Oudot, S., Rineau, L., Yvinec, M.: Meshing volumes bounded by smooth surfaces. In: Proceedings of the 14th International Meshing Roundtable, pp. 203–219. Springer, Berlin (2005)
Parker, S., Shirley, P., Livnat, Y., Hansen, C., Sloan, P.P.: Interactive ray tracing for isosurface rendering. In: VIS ’98: Proceedings of the Conference on Visualization, pp. 233–238. IEEE Computer Society Press, Washington D.C. (1998)
Schwarze, J.: Cubic and quartic roots. In: Glassner, A. (ed.) Graphics Gems, pp. 404–407. Academic Press Professional, San Diego (1990)
Shewchuk, J.R.: Tetrahedral mesh generation by Delaunay refinement. In: SCG ’98: Proceedings of the 14th Symposium on Computational Geometry, pp. 86–95. ACM, New York (1998)
Stander, B.T., Hart, J.C.: Guaranteeing the topology of an implicit surface polygonization for interactive modeling. In: SIGGRAPH ’97: Proceedings of the 24th Conference on Computer Graphics and Interactive Techniques, pp. 279–286. ACM Press/Addison-Wesley Publishing Co., New York (1997)
Varadhan, G., Krishnan, S., Sriram, T.V.N., Manocha, D.: Topology preserving surface extraction using adaptive subdivision. In: Eurographics Symposium on Geometry Processing, pp. 241–250. ACM, New York (2004)
Wald, I., Friedrich, H., Marmitt, G., Slusallek, P., Seidel, H.-P.: Faster isosurface ray tracing using implicit kd-trees. IEEE Trans. Vis. Comput. Graph. 11(5), 562–572 (2005)
Wyvill, G., McPheeters, C., Wyvill, B.: Data structure for soft objects. Visual Comput. 2(4), 227–234 (1986)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Dey, T., Levine, J. Delaunay meshing of isosurfaces. Visual Comput 24, 411–422 (2008). https://doi.org/10.1007/s00371-008-0224-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00371-008-0224-1