Summary
In this paper, we present a Delaunay refinement algorithm for 4- dimensional (3D+t) segmented images. The output mesh is proved to consist of sliver-free simplices. Assuming that the hyper-surface is a closed smooth manifold, we also guarantee faithful geometric and topological approximation. We implement and demonstrate the effectiveness of our method on publicly available segmented cardiac images.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
CGAL, Computational Geometry Algorithms Library. v4.0, http://www.cgal.org
ITK, Insight Segmentation and Registration Toolkit. v4.1.0, http://www.itk.org
Amenta, N., Bern, M.: Surface reconstruction by Voronoi filtering. In: SCG 1998: Proceedings of the Fourteenth Annual Symposium on Computational Geometry, pp. 39–48. ACM, New York (1998)
Amenta, N., Choi, S., Dey, T.K., Leekha, N.: A Simple Algorithm for Homeomorphic Surface Reconstruction. International Journal of Computational Geometry and Applications 12(1-2), 125–141 (2002)
Amenta, N., Choi, S., Kolluri, R.K.: The power crust. In: Proceedings of the Sixth ACM Symposium on Solid Modeling and Applications, SMA 2001, pp. 249–266. ACM, New York (2001)
Attali, D., Edelsbrunner, H., Mileyko, Y.: Weak witnesses for delaunay triangulations of submanifolds. In: Proceedings of the 2007 ACM Symposium on Solid and Physical Modeling, SPM 2007, pp. 143–150. ACM, New York (2007)
Behr, M.: Simplex space-time meshes in finite element simulations. International Journal for Numerical Methods in Fluids 57, 1421–1434 (2008)
Boissonnat, J.-D., Guibas, L.J., Oudot, S.Y.: Manifold reconstruction in arbitrary dimensions using witness complexes. Discrete Comput. Geom. 42, 37–70 (2009)
Boissonnat, J.-D., Oudot, S.: Provably good sampling and meshing of surfaces. Graphical Models 67(5), 405–451 (2005)
Boltcheva, D., Yvinec, M., Boissonnat, J.-D.: Mesh Generation from 3D Multi-material Images. In: Yang, G.-Z., Hawkes, D., Rueckert, D., Noble, A., Taylor, C. (eds.) MICCAI 2009, Part II. LNCS, vol. 5762, pp. 283–290. Springer, Heidelberg (2009)
Bowyer, A.: Computing Dirichlet tesselations. Computer Journal 24, 162–166 (1981)
Cazals, F., Giesen, J.: Delaunay triangulation based surface reconstruction: Ideas and algorithms. In: Effective Computational Geometry for Curves and Surfaces, pp. 231–273. Springer (2006)
Cheng, S.-W., Dey, T.K., Edelsbrunner, H., Facello, M.A., Teng, S.-H.: Sliver exudation. Journal of the ACM 47(5), 883–904 (2000)
Cheng, S.-W., Dey, T.K., Ramos, E.A.: Manifold reconstruction from point samples. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Philadelphia, PA, USA, pp. 1018–1027. Society for Industrial and Applied Mathematics (2005)
Cheng, S.-W., Dey, T.K., Ramos, E.A.: Delaunay refinement for piecewise smooth complexes. In: Proc. 18th Annu. ACM-SIAM Sympos. Discrete Algorithms, pp. 1096–1105. ACM Press (2007)
Chernikov, A., Chrisochoides, N.: Multitissue tetrahedral image-to-mesh conversion with guaranteed quality and fidelity. SIAM Journal on Scientific Computing 33, 3491–3508 (2011)
Chernikov, A.N., Chrisochoides, N.P.: Generalized insertion region guides for Delaunay mesh refinement. SIAM Journal on Scientific Computing, SISC (2011) (under revision)
Cockburn, B., Karniadakis, G.E., Shu, C.-W.: Discontinuous galerkin methods: theory, computation and applications. Lecture notes in Computational Science and Engineering, vol. 11 (2000)
Coeurjolly, D., Montanvert, A.: Optimal separable algorithms to compute the reverse euclidean distance transformation and discrete medial axis in arbitrary dimension. IEEE Trans. Pattern Anal. Mach. Intell. 29, 437–448 (2007)
Danielsson, P.E.: Euclidean Distance Mapping. Computer Graphics and Image Processing 14, 227–248 (1980)
Devillers, O., Teillaud, M.: Perturbations and vertex removal in a 3D Delaunay triangulation. In: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms, SODA 2003, pp. 313–319 (2003)
Dey, T.K., Zhao, W.: Approximate medial axis as a voronoi subcomplex. Computer-Aided Design 36(2), 195–202 (2004)
Edelsbrunner, H., Shah, N.R.: Triangulating topological spaces. In: SCG 1994: Proceedings of the Tenth Annual Symposium on Computational Geometry, pp. 285–292. ACM, New York (1994)
Erickson, J., Guoy, D., Sullivan, J.M., Üngör, A.: Building spacetime meshes over arbitrary spatial domains. Eng. with Comput. 20(4), 342–353 (2005)
Foteinos, P., Chrisochoides, N.: Dynamic parallel 3D Delaunay triangulation. In: International Meshing Roundtable, Paris, France, pp. 9–26 (October 2011)
Foteinos, P., Chrisochoides, N.: High quality real-time image-to-mesh conversion for finite element simulations. In: 27th ACM International Conference on Supercomputing (ICS 2013) (June 2013)
Giblin, P., Kimia, B.B.: A formal classification of 3D medial axis points and their local geometry. IEEE Transactions on Pattern Analysis and Machine Intelligence 26, 238–251 (2004)
Jiao, X., Colombi, A., Ni, X., Hart, J.: Anisotropic mesh adaptation for evolving triangulated surfaces. Eng. with Comput. 26(4), 363–376 (2010)
Labelle, F., Shewchuk, J.R.: Isosurface stuffing: fast tetrahedral meshes with good dihedral angles. ACM Transactions on Graphics 26(3), 57 (2007)
Li, X.-Y.: Generating Well-Shaped d-dimensional Delaunay Meshes. In: Wang, J. (ed.) COCOON 2001. LNCS, vol. 2108, pp. 91–100. Springer, Heidelberg (2001)
Lorensen, W.E., Cline, H.E.: Marching cubes: A high resolution 3D surface construction algorithm. SIGGRAPH Computer Graphics 21(4), 163–169 (1987)
Maurer, C.R., Rensheng, Q., Raghavan, V.: A linear time algorithm for computing exact euclidean distance transforms of binary images in arbitrary dimensions. IEEE Transactions on Pattern Analysis and Machine Intelligence 25(2), 265–270 (2003)
Miller, G.L., Talmor, D., Teng, S.-H., Walkington, N.: A Delaunay based numerical method for three dimensions: generation, formulation, and partition. In: Proceedings of the 27th Annu. ACM Sympos. Theory Comput, pp. 683–692. ACM (1995)
Mitchell, S.A., Vavasis, S.A.: Quality mesh generation in higher dimensions. SIAM J. Comput. 29(4), 1334–1370 (2000)
Najman, L., Cousty, J., Couprie, M., Talbot, H., Clément-Guinaudeau, S., Goissen, T., Garot, J.: An open, clinically-validated database of 3D+t cine-mr images of the left ventricle with associated manual and automated segmentation, http://www.laurentnajman.org/heart/index.html
Neumüller, M., Steinbach, O.: Refinement of flexible spacetime finite element meshes and discontinuous Galerkin methods. Computing and Visualization in Science 14, 189–205 (2011)
Oudot, S., Rineau, L., Yvinec, M., Oudot, S., Rineau, L., Yvinec, M.: Meshing volumes bounded by smooth surfaces. In: Proceedings of the International Meshing Roundtable, pp. 203–219. Springer (September 2005)
Pons, J.-P., Ségonne, F., Boissonnat, J.-D., Rineau, L., Yvinec, M., Keriven, R.: High-Quality Consistent Meshing of Multi-label Datasets. In: Karssemeijer, N., Lelieveldt, B. (eds.) IPMI 2007. LNCS, vol. 4584, pp. 198–210. Springer, Heidelberg (2007)
Rineau, L., Yvinec, M.: Meshing 3D domains bounded by piecewise smooth surfaces. In: Proceedings of the International Meshing Roundtable, pp. 443–460 (2007)
Shewchuk, J.R.: Tetrahedral mesh generation by Delaunay refinement. In: Proceedings of the 14th ACM Symposium on Computational Geometry, Minneapolis, MN, pp. 86–95 (1998)
Shewchuk, J.R.: Delaunay refinement algorithms for triangular mesh generation. Computational Geometry: Theory and Applications 22(1-3), 21–74 (2002)
Si, H.: Constrained Delaunay tetrahedral mesh generation and refinement. Finite Elements in Analysis and Design 46, 33–46 (2010)
Si, H.: TetGen, A Quality Tetrahedral Mesh Generator and a 3D Delaunay Triangulator. v1.4.3, http://tetgen.berlios.de/
Thite, S.: Efficient spacetime meshing with nonlocal cone constraints. In: 13th International Meshing Roundtable, pp. 47–58 (2004)
Tsin, Y., Kirchberg, K.J., Lauritsch, G., Xu, C.: A deformation tracking approach to 4D coronary artery tree reconstruction. In: Yang, G.-Z., Hawkes, D., Rueckert, D., Noble, A., Taylor, C. (eds.) MICCAI 2009, Part II. LNCS, vol. 5762, pp. 68–75. Springer, Heidelberg (2009)
von Siebenthal, M., Székely, G., Gamper, U., Boesiger, P., Lomax, A., Cattin, P.: 4D MR imaging of respiratory organ motion and its variability. Physics in Medicine and Biology 52(6), 1547–1564 (2007)
Watson, D.F.: Computing the n-dimensional Delaunay tesselation with application to Voronoi polytopes. Computer Journal 24, 167–172 (1981)
Weigang, E., Kari, F.A., Beyersdorf, F., Luehr, M., Etz, C.D., Frydrychowicz, A., Harloff, A., Markl, M.: Flow-sensitive four-dimensional magnetic resonance imaging: flow patterns in ascending aortic aneurysms. European Journal of Cardio-Thoracic Surgery 34(1), 11–16 (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Foteinos, P., Chrisochoides, N. (2014). 4D Space-Time Delaunay Meshing for Medical Images. In: Sarrate, J., Staten, M. (eds) Proceedings of the 22nd International Meshing Roundtable. Springer, Cham. https://doi.org/10.1007/978-3-319-02335-9_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-02335-9_13
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-02334-2
Online ISBN: 978-3-319-02335-9
eBook Packages: EngineeringEngineering (R0)