Share Email Print

Proceedings Paper

Vertex-based marching algorithms for finding multidimensional geometric intersections
Author(s): Lubomir T. Dechevsky; Arne Lakså; Børre Bang; Joakim Gundersen; Arnt R. Kristoffersen; Peter Zanaty
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 7 September 2010
PDF: 9 pages
Proc. SPIE 7798, Applications of Digital Image Processing XXXIII, 77982E (7 September 2010); doi: 10.1117/12.860220
Show Author Affiliations
Lubomir T. Dechevsky, Narvik Univ. College (Norway)
Arne Lakså, Narvik Univ. College (Norway)
Børre Bang, Narvik Univ. College (Norway)
Joakim Gundersen, Narvik Univ. College (Norway)
Arnt R. Kristoffersen, Narvik Univ. College (Norway)
Peter Zanaty, Narvik Univ. College (Norway)

Published in SPIE Proceedings Vol. 7798:
Applications of Digital Image Processing XXXIII
Andrew G. Tescher, Editor(s)

© SPIE. Terms of Use
Back to Top