Share Email Print

Proceedings Paper

New findings from the SpiderWeb algorithm: toward a digital morse theory
Author(s): Daniel B. Karron; James Cox; Bhubaneswar Mishra
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Algorithms that tile iso-valued surfaces should produce 'correctly' tiled orientable manifold surfaces. Rigorous evaluation of different algorithms or case tables has been impossible up to now because of the lack of a clear and comprehensive theoretical framework. We propose the extension of Morse theory, as developed in the continuous domain, to apply to discretely sampled continuous domains (sampled Morse functions). We call this the digital domain, and thus formulate a Digital Morse Theory (DMT). We show that a discretely sampled continuous volume in which we are tiling a surface can have various classes of Morse criticalities. When the isosurface comes close (within a voxel length) of a criticality, this is what gives rise to certain apparent ambiguities in tiling surfaces. DMT provides a heuristic to correctly disambiguate tiling decisions. In addition, DMT gives insight to correctly simplifying a volume data set so as to produce an isosurface with a reduced number of tiles, and yet maintain a topology. Additionally, one can establish a hierarchical relationship between each criticality and its associated regions.

Paper Details

Date Published: 9 September 1994
PDF: 15 pages
Proc. SPIE 2359, Visualization in Biomedical Computing 1994, (9 September 1994); doi: 10.1117/12.185226
Show Author Affiliations
Daniel B. Karron, New York Univ. Medical Ctr. (United States)
James Cox, CUNY/Brooklyn College (United States)
Bhubaneswar Mishra, New York Univ. (United States)

Published in SPIE Proceedings Vol. 2359:
Visualization in Biomedical Computing 1994
Richard A. Robb, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?