SpiderWeb algorithm for surface construction in noisy volume data (Proceedings Only)

Daniel B. Karron

doi:10.1117/12.131100

22 September 1992 SpiderWeb algorithm for surface construction in noisy volume data (Proceedings Only)

Daniel B. Karron

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.

Citation Download Citation

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); https://doi.org/10.1117/12.131100

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available