Affiliation:
1. 1 Department of Mathematics and Descriptive Geometry, Faculty of Civil Engineering , Slovak University of Technology in Bratislava , Slovakia
Abstract
Abstract
In this paper, we introduce novel methods for computing middle surfaces between various 3D data sets such as point clouds and/or discrete surfaces. Traditionally the middle surface is obtained by detecting singularities in computed distance function such as ridges, triple junctions, etc. It requires to compute second order differential characteristics, and also some kinds of heuristics must be applied. Opposite to that, we determine the middle surface just from computing the distance function itself which is a fast and simple approach. We present and compare the results of the fast sweeping method, the vector distance transform algorithm, the fast marching method, and the Dijkstra-Pythagoras method in finding the middle surface between 3D data sets.
Subject
General Earth and Planetary Sciences,General Environmental Science
Reference14 articles.
1. CHEN, X.—GOLOVINSKIY, A.—FUNKHOUSER, T.: A benchmark for 3D mesh segmentation, ACM Transactions on Graphics 28 (2009). pp. 1–12. https://doi.org/10.1145/1531326.1531379
2. CORMEN, T. H.—LEISERSON, C. E.—RIVEST, R. L.—STEIN, C.: Introduction to Algorithms Third Edition. MIT Press, Cambridge, MA, 2009.
3. DANIELSSON, P.-E.: Euclidean distance mapping, Computer Graphics and Image Processing 14 (1980), 227–248.
4. EBERLY, D.: Distance between point and triangle in 3D, Geometric Tools, Redmond WA 98052, (1999). https://www.geometrictools.com/Documentation/DistancePoint3Triangle3.pdf
5. JONES, M. W.—BAERENTZEN, J. A.—SRAMEK, M.: 3D distance fields: a survey of techniques and applications, IEEE Transactions on Visualization and Computer Graphics 12 (2006), no. 4, 581–599.