Shape Reconstruction from Unorganized Cross-sections
Loading...
Date
2007
Journal Title
Journal ISSN
Volume Title
Publisher
The Eurographics Association
Abstract
In this paper, we consider the problem of reconstructing a shape from unorganized cross-sections. The main motivation for this problem comes from medical imaging applications where cross-sections of human organs are obtained by means of a free hand ultrasound apparatus. The position and orientation of the cutting planes may be freely chosen which makes the problem substantially more difficult than in the case of parallel cross-sections, for which a rich literature exists. The input data consist of the cutting planes and (an approximation of) their intersection with the object. Our approach consists of two main steps. First, we compute the arrangement of the cutting planes. Then, in each cell of the arrangement, we reconstruct an approximation of the object from its intersection with the boundary of the cell. Lastly, we glue the various pieces together. The method makes use of the Delaunay triangulation and generalizes the reconstruction method of Boissonnat and Geiger [BG93] for the case of parallel planes. The analysis provides a neat characterization of the topological properties of the result and, in particular, shows an interesting application of Moebius diagrams to compute the locus of the branching points. We have implemented our algorithm in C++, using the [CGAL] library. Experimental results show that the algorithm performs well and can handle complicated branching configurations.
Description
@inproceedings{:10.2312/SGP/SGP07/089-098,
booktitle = {Geometry Processing},
editor = {Alexander Belyaev and Michael Garland},
title = {{Shape Reconstruction from Unorganized Cross-sections}},
author = {Boissonnat, Jean-Daniel and Memari, Pooran},
year = {2007},
publisher = {The Eurographics Association},
ISSN = {1727-8384},
ISBN = {978-3-905673-46-3},
DOI = {/10.2312/SGP/SGP07/089-098}
}