The 3D Marching Lines Algorithm

Abstract This paper presents a general purpose tool designed to extract characteristic curves from 3D images. Our algorithm, called the Marching Lines , is inspired by isointensity techniques, such as the Marching Cubes. Marching Lines extracts, with subpixel accuracy, the 3D lines corresponding to the intersection of two isosurfaces in a 3D grid. The algorithm ensures that each reconstructed curve is formed of a connected set of segments, is closed if the curve is entirely contained in the grid, does not intersect itself, and is oriented. The main idea is to define isosurfaces as interfaces ( f ≥ 0, f f = 0). The singularities are solved with an offset technique. Results are presented for synthetic data and for 3D medical image applications.

[1]  Gabor T. Herman,et al.  On topology as applied to image analysis , 1990, Comput. Vis. Graph. Image Process..

[2]  Court B. Cutting,et al.  Applications of computer graphics to the evaluation and treatment of major craniofacial malformations , 1991 .

[3]  Åke Wallin,et al.  Constructing isosurfaces from CT data , 1991, IEEE Computer Graphics and Applications.

[4]  Azriel Rosenfeld,et al.  Digital topology: Introduction and survey , 1989, Comput. Vis. Graph. Image Process..

[5]  Alexis Gourdon,et al.  Computing the Differential Characteristics of Isointensity Surfaces , 1995, Comput. Vis. Image Underst..