## On Reliable Surface Reconstruction from Multiple Range Images (1996)

Citations: | 105 - 11 self |

### BibTeX

@INPROCEEDINGS{Hilton96onreliable,

author = {Adrian Hilton},

title = {On Reliable Surface Reconstruction from Multiple Range Images},

booktitle = {},

year = {1996},

pages = {117--126},

publisher = {Springer-Verlag}

}

### Years of Citing Articles

### OpenURL

### Abstract

This paper addresses the problem of integrating multiple registered 2.5D range images into a single 3D surface model which has topology and geometry consistent with the measurements. Reconstruction of a model of the correct surface topology is the primary goal. Extraction of the correct surface topology is recognised as a fundamental step in building 3D models. Model optimization can then be performed to fit the data to the desired accuracy with an efficient representation. A novel integration algorithm is presented that is based on local reconstruction of surface topology using operations in 3D space. A new continuous implicit surface function is proposed which merges the connectivity information inherent in the individual sampled range images. This enables the construction of a single triangulated model using a standard method. The algorithm is guaranteed to reconstruct the correct topology of surface features larger than the range image sampling resolution. Reconstruction of triangu...

### Citations

2366 |
A method of registration of 3-D shapes
- Besl, McKay
- 1992
(Show Context)
Citation Context ...image capture, multi-view data registration, 3D model building and model optimization. Registration of range images into a common coordinate frame from an initial estimate of the pose is addressed in =-=[3, 9, 12, 30]-=-. The extended iterated closed point algorithm enables accurate registration of overlapping range images. Evaluation of registration algorithms is an ongoing research issue [22, 20]. Calibration of re... |

2261 | Marching Cubes: A High Resolution 3D Surface Construction Algorithm
- Lorensen, Cline
(Show Context)
Citation Context ...ent surfaces. 2.3 Implicit Surface Polygonisation Contour tracing for the extraction of an iso-surface from a scalar function has received considerable interest for visualisation in computer graphics =-=[2, 1, 13, 34, 17, 10, 4]-=-. Algorithm development has been motivated by the need to visualise 3D measurements in medical applications [17, 10] and computer graphics models [4]. Polygonisation of implicit surfaces using a unifo... |

609 |
Object modelling by registration of multiple range images
- Chen, Medioni
- 1992
(Show Context)
Citation Context ...image capture, multi-view data registration, 3D model building and model optimization. Registration of range images into a common coordinate frame from an initial estimate of the pose is addressed in =-=[3, 9, 12, 30]-=-. The extended iterated closed point algorithm enables accurate registration of overlapping range images. Evaluation of registration algorithms is an ongoing research issue [22, 20]. Calibration of re... |

489 |
Zippered Polygon Meshed from Range Images
- Turk, Levoy
- 1994
(Show Context)
Citation Context ...tial application domains which include reverse engineering, medical imagery and computer graphics. Extraction of the correct surface topology is recognised as a fundamental step in building 3D models =-=[14, 22, 26, 30, 27, 31, 32]-=-. Recent research has resulted in the independent publication of several algorithms that reconstruct triangulated 3D surface models of complex objects [15, 24, 30, 22]. These algorithms aim to automat... |

397 | Polygonization of implicit surfaces
- Bloomenthal
- 1988
(Show Context)
Citation Context ...4 [22]) Hoppe et al. presented a general method for constructing an implicit surface representation from unstructured 3D points. Polygonal models were then generated using a `marching cubes' approach =-=[4]-=-. The algorithm is `static' in the sense that all the image data is required prior to the polygonisation process. This method was not developed specifically for range image integration and does not re... |

289 | Data structure for soft objects
- WYVILL, PHEETERS, et al.
- 1986
(Show Context)
Citation Context ... function from a set of sampled points X = f~x 0 ::::~x N \Gamma1 g is to construct a smooth field function, f(~x), such that the zero set approximate the data X as closely as possible. Wyvill et al. =-=[34, 33]-=- used implicit surfaces to define soft objects for computer graphics. Their representation uses a weighted average of the distance to key points to define an unsigned field function. Muraki [18] gener... |

277 | Piecewise smooth surface reconstruction
- Hoppe, DeRose, et al.
- 1994
(Show Context)
Citation Context ...tial application domains which include reverse engineering, medical imagery and computer graphics. Extraction of the correct surface topology is recognised as a fundamental step in building 3D models =-=[14, 22, 26, 30, 27, 31, 32]-=-. Recent research has resulted in the independent publication of several algorithms that reconstruct triangulated 3D surface models of complex objects [15, 24, 30, 22]. These algorithms aim to automat... |

233 | Using particles to sample and control implicit surfaces
- Witkin, Heckbert
- 1994
(Show Context)
Citation Context ...tial application domains which include reverse engineering, medical imagery and computer graphics. Extraction of the correct surface topology is recognised as a fundamental step in building 3D models =-=[14, 22, 26, 30, 27, 31, 32]-=-. Recent research has resulted in the independent publication of several algorithms that reconstruct triangulated 3D surface models of complex objects [15, 24, 30, 22]. These algorithms aim to automat... |

201 | Surface Modeling with Oriented Particle Systems - Szeliski, Tonnesen - 1992 |

174 | Geometric structures for three-dimensional shape representation
- Boissonnat
- 1984
(Show Context)
Citation Context ...ion of sets of range images of approximately constant resolution, \Deltax. V: Mesh Growing Rutishauser et al. [22] use a surface reconstruction approach based on the triangulation scheme of Boissonat =-=[6]-=- to integration overlapping triangulated meshes into a single model. The algorithm consists of the following stages: 1) Step discontinuity constrained 2D triangulation of each range image. 2) Nominate... |

153 | Free-form shape design using triangulated surfaces - Welch, Witkin - 1994 |

135 |
The Asymptotic Decider: Resolving the Ambiguity in Marching Cubes, in
- Nielson, Hamann
(Show Context)
Citation Context ...ubdivision was developed by Wyvill et al. [34] and Lorensen et al. [17]. Extensions of these algorithms to avoid ambiguities in the polygonisation process and ensure correct topology are discussed in =-=[4, 19]-=-. Polygonal reconstruction using adaptive subdivision of the 3D space is discussed in [4]. Implementations of the 'marching cubes' algorithm for polygonisation of implicit surfaces are widely availabl... |

133 |
Volumetric shape description of range data using Blobby model, Computer Graphics
- Muraki
- 1991
(Show Context)
Citation Context .... [34, 33] used implicit surfaces to define soft objects for computer graphics. Their representation uses a weighted average of the distance to key points to define an unsigned field function. Muraki =-=[18]-=- generate implicit function shape descriptions from range images using a `blobby model'. The field function is generated as the weighted average of a number of field generating geometric primitives. A... |

112 |
On three-dimensional surface reconstruction methods
- Bolle, Vemuri
- 1991
(Show Context)
Citation Context ...he data to a prescribed level of accuracy and to provide an efficient representation. Accurate fitting of surface geometry from single range images has previously been the focus of extensive research =-=[7]-=-. However, in general the assumptions made in the fitting process do not enable surfaces of arbitrary topology to be modeled. Having reconstructed a model of the surface topology optimization techniqu... |

98 |
A general surface approach to the integration of a set of range views
- Soucy, Laurendeau
- 1995
(Show Context)
Citation Context |

77 |
Curve and surface smoothing without shrinkage
- Taubin
- 1995
(Show Context)
Citation Context ...not enable surfaces of arbitrary topology to be modeled. Having reconstructed a model of the surface topology optimization techniques exist based on measurement confidence, [22, 26, 30], mesh fitting =-=[14, 31, 28]-=- and arbitrary topology smooth surfaces [16]. Triangulated Surface Models Integration (or fusion) of multiple range images is required to overcome the occlusions inherent in a single 2.5D range image.... |

70 | Merging range images of arbitrarily shaped objects
- Rutishauser, Stricker, et al.
- 1994
(Show Context)
Citation Context |

62 |
The theory, design, implementation and evaluation of a three dimensional surface detection algorithm. Computer graphics and image processing
- Artzy, Frieder, et al.
- 1981
(Show Context)
Citation Context ...ent surfaces. 2.3 Implicit Surface Polygonisation Contour tracing for the extraction of an iso-surface from a scalar function has received considerable interest for visualisation in computer graphics =-=[2, 1, 13, 34, 17, 10, 4]-=-. Algorithm development has been motivated by the need to visualise 3D measurements in medical applications [17, 10] and computer graphics models [4]. Polygonisation of implicit surfaces using a unifo... |

47 |
Registration of multiple range views for automatic 3-D model building
- Gagnon, Soucy, et al.
- 1994
(Show Context)
Citation Context ...image capture, multi-view data registration, 3D model building and model optimization. Registration of range images into a common coordinate frame from an initial estimate of the pose is addressed in =-=[3, 9, 12, 30]-=-. The extended iterated closed point algorithm enables accurate registration of overlapping range images. Evaluation of registration algorithms is an ongoing research issue [22, 20]. Calibration of re... |

47 |
Laser range finder based on synchronized scanners
- Rioux
- 1984
(Show Context)
Citation Context ...rizontal surfaces and occluded regions. This data was previously used to demonstrate the canonic sub-view integration algorithm [26]. The range image sets were captured by the NRCC laser range finder =-=[21]-=- and registered by M.Soucy using ImageMetric registration software [12]. The computation time for the reconstruction of an integrated model of 25000 elements on a Sun spark 10 was approximately 12 min... |

46 |
Multi-resolution surface modeling from multiple range views
- Soucy, Laurendeau
- 1992
(Show Context)
Citation Context ...n building 3D models [14, 22, 26, 30, 27, 31, 32]. Recent research has resulted in the independent publication of several algorithms that reconstruct triangulated 3D surface models of complex objects =-=[15, 24, 30, 22]-=-. These algorithms aim to automatically reconstruct a 3D model which preserves the object surface topology information inherent in the 2.5D sampled measurements. A new integration algorithm is propose... |

44 |
An Implicit Surface Polygonizer, Graphics Gems IV
- Bloomenthal
- 1994
(Show Context)
Citation Context ...Polygonal reconstruction using adaptive subdivision of the 3D space is discussed in [4]. Implementations of the 'marching cubes' algorithm for polygonisation of implicit surfaces are widely available =-=[5]-=-. Marching cubes is an algorithm for the reconstruction of an approximate polygonal surface representation from a signed implicit surface function. The implicit surface function is defined as an iso-s... |

41 | Surface description of complex objects from range images
- Chen, Medioni
- 1994
(Show Context)
Citation Context ...ild a complete 3D model. Recently reconstruction of surface models of complex objects has been demonstrated from multiple range images [24, 30, 22], 3D medical images [11, 29] and unstructured points =-=[15, 8]-=-. Reconstruction of surfaces of complex objects with arbitrary topology has only been demonstrated for algorithms that reconstruct triangular meshes [24, 30, 22, 15]. Polygonal meshes provide a simple... |

36 | A G1 triangular spline surface of arbitrary topological type - Loop - 1994 |

34 | Volumetric segmentation of medical images by three-dimensional bubbles
- Tek, Kimia
- 1997
(Show Context)
Citation Context ... multiple 2.5D range images to build a complete 3D model. Recently reconstruction of surface models of complex objects has been demonstrated from multiple range images [24, 30, 22], 3D medical images =-=[11, 29]-=- and unstructured points [15, 8]. Reconstruction of surfaces of complex objects with arbitrary topology has only been demonstrated for algorithms that reconstruct triangular meshes [24, 30, 22, 15]. P... |

29 |
An algorithm for piecewise-linear approximation of an implicitly defined manifold
- Allgower, Schmidt
- 1985
(Show Context)
Citation Context ...ent surfaces. 2.3 Implicit Surface Polygonisation Contour tracing for the extraction of an iso-surface from a scalar function has received considerable interest for visualisation in computer graphics =-=[2, 1, 13, 34, 17, 10, 4]-=-. Algorithm development has been motivated by the need to visualise 3D measurements in medical applications [17, 10] and computer graphics models [4]. Polygonisation of implicit surfaces using a unifo... |

24 |
Adaptive shape evolution using blending
- DeCarlo, Metaxas
- 1995
(Show Context)
Citation Context ... multiple 2.5D range images to build a complete 3D model. Recently reconstruction of surface models of complex objects has been demonstrated from multiple range images [24, 30, 22], 3D medical images =-=[11, 29]-=- and unstructured points [15, 8]. Reconstruction of surfaces of complex objects with arbitrary topology has only been demonstrated for algorithms that reconstruct triangular meshes [24, 30, 22, 15]. P... |

18 |
Surface Reconstruction from Unorganised Points
- Hoppe
- 1992
(Show Context)
Citation Context ...n building 3D models [14, 22, 26, 30, 27, 31, 32]. Recent research has resulted in the independent publication of several algorithms that reconstruct triangulated 3D surface models of complex objects =-=[15, 24, 30, 22]-=-. These algorithms aim to automatically reconstruct a 3D model which preserves the object surface topology information inherent in the 2.5D sampled measurements. A new integration algorithm is propose... |

13 |
A dynamic integration algorithm to model surfaces from multiple range views
- Soucy, Laurendeau
- 1995
(Show Context)
Citation Context ...ary are explicitly represented. 3) Implicit surface polygonisation based on marching cubes. Polygonisation of the zero-set f(~x) = 0 is constrained at mesh boundaries. III: Canonic Views Soucy et al. =-=[24, 25, 26]-=- proposed an algorithm for range image integration based on the reparameterisation of the canonic subsets of the Venn diagram of a set of range views. The static algorithm for integrating M range imag... |

1 |
Two algrotithms for the three-dimensional reconstruction of tomograms
- Cline, Lorensen, et al.
- 1988
(Show Context)
Citation Context |

1 |
Fast surface traking in three-dimensional binary images
- Gordon, Udupa
- 1989
(Show Context)
Citation Context |

1 |
Validation of 3-d registration mehtods based on points and frames
- Pennec, Thirion
- 1995
(Show Context)
Citation Context ...addressed in [3, 9, 12, 30]. The extended iterated closed point algorithm enables accurate registration of overlapping range images. Evaluation of registration algorithms is an ongoing research issue =-=[22, 20]-=-. Calibration of registration errors is essential for reconstructing an accurate geometric representation. The model building process, which is the focus of this paper, aims to reconstruct an integrat... |

1 |
private email communiation
- Soucy
- 1995
(Show Context)
Citation Context ...single range image may overlap when projected into the 2D subview plane. In practice Soucy states `the case is handled by allowing the generation of several 3-D points for each parametric grid point' =-=[23]-=-. This issue is discussed further in section 3.3. IV: Mesh Zippering `Zippering' of overlapping meshes was proposed by Turk and Levoy [30]. The integration algorithm can be summarised as follows: 1) S... |

1 |
Field funtions for implicit surfaces
- Wyvill, Wyvill
- 1989
(Show Context)
Citation Context ... function from a set of sampled points X = f~x 0 ::::~x N \Gamma1 g is to construct a smooth field function, f(~x), such that the zero set approximate the data X as closely as possible. Wyvill et al. =-=[34, 33]-=- used implicit surfaces to define soft objects for computer graphics. Their representation uses a weighted average of the distance to key points to define an unsigned field function. Muraki [18] gener... |