๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The 3D Marching Lines Algorithm

โœ Scribed by Jean-Philippe Thirion; Alexis Gourdon


Book ID
102573791
Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
357 KB
Volume
58
Category
Article
ISSN
1077-3169

No coin nor oath required. For personal study only.

โœฆ Synopsis


is closed if the curve is contained within the 3D grid. In its more general application, the input is two 3D functions, f This paper presents a general purpose tool designed to extract characteristic curves from 3D images. Our algorithm, called and g, which give two real values for each point (x, y, z) of the Marching Lines, is inspired by isointensity techniques, such a 3D grid, but it can be also two 3D digital images.

as the Marching Cubes. Marching Lines extracts, with subpixel

The first section briefly presents the extraction of isoconaccuracy, the 3D lines corresponding to the intersection of tours in 2D and of isosurfaces in 3D, care being taken to two isosurfaces in a 3D grid. The algorithm ensures that each ensure that the reconstructed surface is without holes. reconstructed curve is formed of a connected set of segments, Then we describe the Marching Lines algorithm, which is is closed if the curve is entirely contained in the grid, does not purely local, but also ensures that the reconstructed disintersect itself, and is oriented. The main idea is to define crete curve elements are connected. Last, we present exisosurfaces as interfaces ( f ี† 0, f ฯฝ 0) instead of implicit perimental results of the automatic extraction of curves equation solutions ( f โ€ซุโ€ฌ 0). The singularities are solved with for both synthetic and real 3D images, such as the parabolic an offset technique. Results are presented for synthetic data curves (Gaussian curvature equal to zero), the isoand for 3D medical image applications.


๐Ÿ“œ SIMILAR VOLUMES


A survey of the marching cubes algorithm
โœ Timothy S. Newman; Hong Yi ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 527 KB
Fast generation of molecular surfaces fr
โœ 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

On-line algorithm for optimal 3D path pl
โœ Chien-Wan Hun; Hun-Chen Chen; Ming-Fung Hwang ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 927 KB

The issues of automatic car operation aiming at in an unknown complex terrain are the most effective path planning and the obstacles avoiding in this complex terrain. For that, an on-line algorithm for guiding a mobile object in an unexplored terrain filled with convex polygonal obstacles is present

A novel and efficient implementation of
โœ K.S Delibasis; G.K Matsopoulos; N.A Mouravliansky; K.S Nikita ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 895 KB

In this paper, a novel and efยฎcient implementation of the marching cubes (MC) algorithm is presented for the reconstruction of anatomical structures from real three-dimensional medical data. The proposed approach is based on a generic rule, able to triangulate all 15 standard cube conยฎgurations used