## Scanline Surfacing: Building Separating Surfaces from Planar Contours (2000)

### Cached

### Download Links

Citations: | 4 - 1 self |

### BibTeX

@MISC{Weinstein00scanlinesurfacing:,

author = {David Weinstein},

title = {Scanline Surfacing: Building Separating Surfaces from Planar Contours},

year = {2000}

}

### OpenURL

### Abstract

A standard way to segment medical imaging datasets is by tracing contours around regions of interest in parallel planar slices. Unfortunately, the standard methods for reconstructing three dimensional surfaces from those planar contours tend to be either complicated or not very robust. Furthermore, they fail to consistently mesh abutting structures which share portions of contours. In this paper we present a novel, straight-forward algorithm for accurately and automatically reconstructing surfaces from planar contours. Our algorithm is based on scanline rendering and separating surface extraction. By rendering the contours as distinctly colored polygons and reading back each rendered slice into a segmented volume, we reduce the complex problem of building a surface from planar contours to the much simpler problem of extracting separating surfaces from a classified volume. Our scanline surfacing algorithm robustly handles complex surface topologies such as bifurcations, embedded features, and abutting surfaces.

### Citations

3076 | Snakes: Active Contour Models
- Kass, Witkin, et al.
- 1988
(Show Context)
Citation Context ...olumetric segmentation algorithms. These algorithms have worked by growing segmented regions from seeds via level set methods [14], by evolving snakes through planar slices to bound segmented regions =-=[8]-=-, and by various statistical methods [12, 24]. While these methods are of substantial utility on well-behaved datasets, they tend to be of limited use on noisy or artifact-laden datasets, or on Email:... |

2074 | Marching cubes: A high resolution 3d surface construction algorithm
- Lorensen, Cline
- 1987
(Show Context)
Citation Context ...the segmented volume. For volumes consisting of only two levels of classification (background material and non-abutting foreground features), an isosurface extraction algorithm such as Marching Cubes =-=[13]-=- can be used. However, for more complex volumes in which features can be nested or can abut, a surfacing algorithm designed for classified volumes is required. An algorithm specifically designed for s... |

161 |
Optimal surface reconstruction from planar contours
- Fuchs, Kedmen, et al.
- 1977
(Show Context)
Citation Context ...ct result. The traditional method for building triangulated surfaces from planar contours consists of solving three subproblems for each structure in the volume: correspondence, tiling, and branching =-=[4, 6, 15, 21]-=-. However, because these methods process the structuressserially, rather than processing them simultaneously, they do not necessarily produce correct results for volumes in which surfaces abut. Full v... |

105 |
Surfaces from Contours
- Meyers, Skinner, et al.
- 1992
(Show Context)
Citation Context ...ct result. The traditional method for building triangulated surfaces from planar contours consists of solving three subproblems for each structure in the volume: correspondence, tiling, and branching =-=[4, 6, 15, 21]-=-. However, because these methods process the structuressserially, rather than processing them simultaneously, they do not necessarily produce correct results for volumes in which surfaces abut. Full v... |

104 |
Shape reconstruction from planar crosssections
- Boissonnat
- 1988
(Show Context)
Citation Context ...tion to resolve complex cases. The Delaunay method uses Delaunay tetrahderalization to mesh the volume between the contours, after which only those triangles which span the two contours are preserved =-=[1]-=-. 3 Methods The traditional methods described above are useful for reconstructing unconstrained triangulated surfaces, with an independent surface for each structure. However, none of the above algori... |

94 |
Approximating Complex Surfaces By Triangulation Of Contour Lines
- Keppel
(Show Context)
Citation Context ...he optimal triangle strip for joining corresponding contours from consecutive slices? There has been much research targeted at solving this problem efficiently. The problem was reformulated by Keppel =-=[11]-=- as finding a path through a toroidal graph. Formalization of this method and efficiency improvements were subsequently introduced [3, 6, 21]. These methods vary in the heuristics used for optimizing ... |

69 |
Efficient algorithms for 3D scan-conversion of parametric curves, surfaces, and volumes
- KAUFMAN
- 1987
(Show Context)
Citation Context ... reasonable output surface seen in Figures 7(e) and (f). There has been much previous research done on designing fast and accurate voxelization algorithms for converting polygonal models into volumes =-=[5, 7, 9, 10]-=-. Those reports have focused on scan converting polyhedral or parametric models, and on developing methods with proofs of accuracy for those voxelizations. The work presented here is somewhat tangenti... |

50 |
Boundary elements: an introductory course, second edition
- Brebbia, Dominguez
- 1992
(Show Context)
Citation Context ... imagine trying to determine correspondences for tomographic slices of a bowl of spaghetti. Algorithms for resolving correspondence when there is ambiguity resort to heuristics based on shape fitting =-=[2]-=- or graph analysis [20]. In contrast, if an unambiguous correspondence does exist, it can often be found by simply evaluating overlaps of contours in consecutive slices [22, 25]. The second subproblem... |

47 |
A triangulation algorithm from arbitrary shaped multiple planar contours
- Ekoule, Peyrin, et al.
- 1991
(Show Context)
Citation Context ...ct result. The traditional method for building triangulated surfaces from planar contours consists of solving three subproblems for each structure in the volume: correspondence, tiling, and branching =-=[4, 6, 15, 21]-=-. However, because these methods process the structuressserially, rather than processing them simultaneously, they do not necessarily produce correct results for volumes in which surfaces abut. Full v... |

45 |
An algorithm for 3D scan-conversion of polygons
- KAUFMAN
- 1987
(Show Context)
Citation Context ... reasonable output surface seen in Figures 7(e) and (f). There has been much previous research done on designing fast and accurate voxelization algorithms for converting polygonal models into volumes =-=[5, 7, 9, 10]-=-. Those reports have focused on scan converting polyhedral or parametric models, and on developing methods with proofs of accuracy for those voxelizations. The work presented here is somewhat tangenti... |

25 | Level set methods for curvature flow, image enhancement, and shape recovery
- Malladi, Sethian
- 1995
(Show Context)
Citation Context ... all at once. That said, there have been some note-worthy semi-automatic volumetric segmentation algorithms. These algorithms have worked by growing segmented regions from seeds via level set methods =-=[14]-=-, by evolving snakes through planar slices to bound segmented regions [8], and by various statistical methods [12, 24]. While these methods are of substantial utility on well-behaved datasets, they te... |

23 |
R.: Computing the separating surface for segmented data
- Nielson, Franke
- 1997
(Show Context)
Citation Context ...s between structures within the volume. When these surfaces are constructed from a segmented volumetric dataset (such as a tetrahedral mesh or a voxelized volume), they are termed separating surfaces =-=[18]-=-. Separating surfaces can be smoothed and simplified without producing spurious gaps or surface interpenetrations [23]. 2 Background Constructing surfaces from planar contours has traditionally been d... |

20 |
Surface reconstruction and representation of 3-D scenes
- Wang, Aggarwal
- 1986
(Show Context)
Citation Context ...tics based on shape fitting [2] or graph analysis [20]. In contrast, if an unambiguous correspondence does exist, it can often be found by simply evaluating overlaps of contours in consecutive slices =-=[22, 25]-=-. The second subproblem in constructing surfaces from contours is the tiling problem. What is the optimal triangle strip for joining corresponding contours from consecutive slices? There has been much... |

18 |
Surface definition for branching contour defined objects
- SHANTZ
- 1981
(Show Context)
Citation Context ...cutive slice? Branching is typically handled through either a contour compositing scheme, or through Delaunay triangulation. In contour compositing, multiple contours are merged into a single contour =-=[19]-=-. This method requires user intervention to resolve complex cases. The Delaunay method uses Delaunay tetrahderalization to mesh the volume between the contours, after which only those triangles which ... |

12 |
Pessimal guesses may be optimal: A counterintuitive search result
- SLOAN, PAINTER
- 1988
(Show Context)
Citation Context |

9 |
Surface construction from planar contours
- ZYDA, JONES, et al.
- 1987
(Show Context)
Citation Context ...tics based on shape fitting [2] or graph analysis [20]. In contrast, if an unambiguous correspondence does exist, it can often be found by simply evaluating overlaps of contours in consecutive slices =-=[22, 25]-=-. The second subproblem in constructing surfaces from contours is the tiling problem. What is the optimal triangle strip for joining corresponding contours from consecutive slices? There has been much... |

8 |
A Three-Dimensional Display System for Diagonostic Imaging Applications
- COOK, DWYER, et al.
- 1983
(Show Context)
Citation Context ...this problem efficiently. The problem was reformulated by Keppel [11] as finding a path through a toroidal graph. Formalization of this method and efficiency improvements were subsequently introduced =-=[3, 6, 21]-=-. These methods vary in the heuristics used for optimizing the tiling, as well as in the complexity of their search. The simplest method is a greedy algorithm that marches through pairs of contours. F... |

7 | Boundary extraction for rasterized motion planning
- MÃ¼ller
- 1994
(Show Context)
Citation Context ...ly, what we need is an algorithm that will recognize and correctly maintain abutting surfaces, and that will be capable of producing shared surface patches between them. Separating surface algorithms =-=[17, 18, 23]-=- offer just such a solution. 3.1 Algorithm Overview In order to produce separating surfaces, we must first build a classified volume. That is, instead of building surfaces directly from contours, we t... |

7 | Statistical intensity correction and segmentation of MRI data
- Wells, Grimson, et al.
- 1996
(Show Context)
Citation Context ... algorithms have worked by growing segmented regions from seeds via level set methods [14], by evolving snakes through planar slices to bound segmented regions [8], and by various statistical methods =-=[12, 24]-=-. While these methods are of substantial utility on well-behaved datasets, they tend to be of limited use on noisy or artifact-laden datasets, or on Email: dmw@cs.utah.edu WWW: http://www.cs.utah.edu/... |

5 |
Roni Yagel, Vassily Filippov, and Yair Kurzion. An accurate method for voxelizing polygon meshes
- Huang
- 1998
(Show Context)
Citation Context ... reasonable output surface seen in Figures 7(e) and (f). There has been much previous research done on designing fast and accurate voxelization algorithms for converting polygonal models into volumes =-=[5, 7, 9, 10]-=-. Those reports have focused on scan converting polyhedral or parametric models, and on developing methods with proofs of accuracy for those voxelizations. The work presented here is somewhat tangenti... |

3 |
Accurate methods for the voxelization of planar objects
- Filippov, Yagel
- 1997
(Show Context)
Citation Context |

3 |
The correspondence problem: Reconstruction of objects from contours in parallel sections
- Skinner
- 1991
(Show Context)
Citation Context ...ermine correspondences for tomographic slices of a bowl of spaghetti. Algorithms for resolving correspondence when there is ambiguity resort to heuristics based on shape fitting [2] or graph analysis =-=[20]-=-. In contrast, if an unambiguous correspondence does exist, it can often be found by simply evaluating overlaps of contours in consecutive slices [22, 25]. The second subproblem in constructing surfac... |

1 |
Geometric Model Extraction form Magnetic Resonance Volume Data
- Laidlaw
- 1995
(Show Context)
Citation Context ... algorithms have worked by growing segmented regions from seeds via level set methods [14], by evolving snakes through planar slices to bound segmented regions [8], and by various statistical methods =-=[12, 24]-=-. While these methods are of substantial utility on well-behaved datasets, they tend to be of limited use on noisy or artifact-laden datasets, or on Email: dmw@cs.utah.edu WWW: http://www.cs.utah.edu/... |

1 |
Introducing alpha shapes for the analysis of path integral monte carlo results
- Moran, Wagner
- 1994
(Show Context)
Citation Context ...duction there is a bound on how large nx and ny must be. Specifically, the upper-bound on a pixel's dimension is the diameter of the largest alpha-shape that can trace the minimal feature of interest =-=[16]-=-. As we reduce the scan conversion pixel resolution in order to capture smaller features, our algorithm produces ever finer triangulations throughout the entire model. We note that regions which are t... |

1 |
Separating surfaces: Extraction, smoothing and simplification
- Weinstein
- 2000
(Show Context)
Citation Context ...as a tetrahedral mesh or a voxelized volume), they are termed separating surfaces [18]. Separating surfaces can be smoothed and simplified without producing spurious gaps or surface interpenetrations =-=[23]-=-. 2 Background Constructing surfaces from planar contours has traditionally been decomposed into three subproblems: correspondence, tiling, and branching. Excellent reviews of these problems were pres... |