Abstract
Interpolation of field data from unstructured meshes requires the potentially expensive identification of the finite element or volume within which the interpolating point lies. A number of geometric search algorithms have been proposed to reduce this expense at the cost of setting up and storing additional search tables. Using tetrahedral finite element models we show that a structured auxiliary mesh (SAM) algorithm can achieve search speeds well in excess of 100,000 points/sec—at least an order of magnitude better than digital tree or nearest neighbour searches—with only modest setup times and storage requirements. Our novel SAM variant is found to offer the best performance per unit of storage, but at the expense of considerable setup times. We conclude that SAM algorithms can be used to provide a flexible “software-only” approach for real-time interpolation and visualization of unstructured mesh data.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Bercovier, M., Pirroneau, O., Sastri, V.: Finite elements and characteristics for some parabolic-hyperbolic problems. Appl. Math. Model. 7, 89–96 (1983)
Bonet, J., Peraire, J.: An alternating digital tree (ADT) algorithm for 3D geometric searching and intersection problems. Int. J. Numer. Meth. Eng. 31, 1–17 (1991)
Pissanetzky, S., Basombrio, F.G.: Efficient calculation of numerical values of a polyhedral function. Int. J. Numer. Meth. Eng. 17, 231–237 (1981)
Dompierre, J., Labbe, P., Vallet, M., Camarero, R.: How to subdivide pyramids, prisms and hexahedra into tetrahedra. In: 8th International Meshing Round table, Lake Tahoe (1999)
Buscaglia, G.C., Dari, E.A.: Implementation of the Lagrange-Galerkin method for the incompressible Navier-Stokes equations. Int. J. Numer. Meth. Eng. 15, 23–26 (1992)
Minev, P.D., Ethier, C.R.: A characteristic/finite element algorithm for the 3-D Navier-Stokes equations using unstructured grids. Comput. Meth. Appl. Mech. Eng. 178, 3950 (1999)
Coppola, G., Sherwin, S.J., Peiro, J.: Non-linear particle tracking for high-order elements. J. Comput. Phys. 172, 356–380 (2001)
Tambasco, M., Steinman, D.A.: On assessing the quality of particle tracking through computational fluid dynamic models. J. Biomech. Eng. 124, 166–175 (2002)
Kenwright, D.N., Lane, D.A.: Interactive time-dependent particle tracing using tetrahedral decomposition. IEEE Trans. Vis. Comput. Graph. 2, 120–128 (1996)
Mucke, E.P., Saias, I.A., Zhu, B.: Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations. Comput. Geom. 12, 63–83 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Khoshniat, M., Stuhne, G.R., Steinman, D.A. (2003). Relative Performance of Geometric Search Algorithms for Interpolating Unstructured Mesh Data. In: Ellis, R.E., Peters, T.M. (eds) Medical Image Computing and Computer-Assisted Intervention - MICCAI 2003. MICCAI 2003. Lecture Notes in Computer Science, vol 2879. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39903-2_48
Download citation
DOI: https://doi.org/10.1007/978-3-540-39903-2_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20464-0
Online ISBN: 978-3-540-39903-2
eBook Packages: Springer Book Archive