7 September 2010 Vertex-based marching algorithms for finding multidimensional geometric intersections
Author Affiliations +
Abstract
This article is a survey of the current state of the art in vertex-based marching algorithms for solving systems of nonlinear equations and solving multidimensional intersection problems. It addresses also ongoing research and future work on the topic. Among the new topics discussed here for the first time is the problem of characterizing the type of singularities of piecewise affine manifolds, which are the numerical approximations to the solution manifolds, as generated by the most advanced of the considered vertex-based algorithms: the Marching-Simplex algorithm. Several approaches are proposed for solving this problem, all of which are related to modifications, extensions and generalizations of the Morse lemma in differential topology.
© (2010) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Lubomir T. Dechevsky, Lubomir T. Dechevsky, Arne Lakså, Arne Lakså, Børre Bang, Børre Bang, Joakim Gundersen, Joakim Gundersen, Arnt R. Kristoffersen, Arnt R. Kristoffersen, Peter Zanaty, Peter Zanaty, } "Vertex-based marching algorithms for finding multidimensional geometric intersections", Proc. SPIE 7798, Applications of Digital Image Processing XXXIII, 77982E (7 September 2010); doi: 10.1117/12.860220; https://doi.org/10.1117/12.860220
PROCEEDINGS
9 PAGES


SHARE
RELATED CONTENT

A RANSAC-ST method for image matching
Proceedings of SPIE (March 02 2016)
Gabor wavelet pyramid for depth recovery
Proceedings of SPIE (March 15 1994)

Back to Top