22 September 1992 SpiderWeb algorithm for surface construction in noisy volume data (Proceedings Only)
Author Affiliations +
Proceedings Volume 1808, Visualization in Biomedical Computing '92; (1992) https://doi.org/10.1117/12.131100
Event: Visualization in Biomedical Computing, 1992, Chapel Hill, NC, United States
Abstract
The `SpiderWeb'' is an algorithm that constructs an oriented, manifold, and unbounded triangle mesh isosurface in noisy volume data. The surface normals consistently point outward in the direction of lower density. Each triangle is edge adjacent to precisely one other triangle. Because of this property, there can be no artifactual `holes'' or `tears'' in the surface. The surface is constructed using only local information and has these global properties. SpiderWeb''s main application is surface construction in noisy MRI and ultrasound data. The constructed surface is appropriate for modeling brain anatomy geometry for further functional modeling applications.
© (1992) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Daniel B. Karron, "SpiderWeb algorithm for surface construction in noisy volume data (Proceedings Only)", Proc. SPIE 1808, Visualization in Biomedical Computing '92, (22 September 1992); doi: 10.1117/12.131100; https://doi.org/10.1117/12.131100
PROCEEDINGS
15 PAGES


SHARE
Back to Top