𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An improved Marching Cube algorithm for 3D data segmentation

✍ Scribed by Masala, G.L.; Golosio, B.; Oliva, P.

Book ID
125454691
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
777 KB
Volume
184
Category
Article
ISSN
0010-4655

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Fast generation of molecular surfaces fr
Fast generation of molecular surfaces from 3D data fields with an enhanced β€œmarching cube” algorithm
✍ W. Heiden; T. Goetze; J. Brickmann πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 516 KB

An improved version of the "marching cubes" algorithm [W. Lorensen and H. Cline, Comp. Graph. 21, (198711 for the generation of isosurfaces from 3D data fields is presented and applied to molecular surfaces. The new algorithm avoids inconsistent pattern definitions of the original one, which lead to

Performance of an automated segmentation
Performance of an automated segmentation algorithm for 3D MR renography
✍ Henry Rusinek; Yuri Boykov; Manmeen Kaur; Samson Wong; Louisa Bokacheva; Jan B. πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 855 KB

## Abstract The accuracy and precision of an automated graph‐cuts (GC) segmentation technique for dynamic contrast‐enhanced (DCE) 3D MR renography (MRR) was analyzed using 18 simulated and 22 clinical datasets. For clinical data, the error was 7.2 Β± 6.1 cm^3^ for the cortex and 6.5 Β± 4.6 cm^3^ for