We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

Self-organising maps for implicit surface reconstruction.

Yoon, Mincheol and Ivrissimtzis, Ioannis and Lee, Seungyong (2008) 'Self-organising maps for implicit surface reconstruction.', 6th Theory and Practice of Computer Graphics Manchester, UK, 9-11 Jun 2008.


This paper proposes an implicit surface reconstruction algorithm based on Self-Organising Maps (SOMs). The SOM has the connectivity of a regular 3D grid, each node storing its signed distance from the surface. At each iteration of the basic algorithm, a new training set is created by sampling regularly along the normals of the input points. The main training iteration consists of a competitive learning step, followed by several iterations of Laplacian smoothing. After each training iteration, we use extra sample validation to test for overfitting. At the end of the training process, a triangle mesh is extracted as the zero level set of the SOM grid. Validation tests and experiments show that the algorithm can cope with the noise of raw scan data. Timing measurements and comparisons show that the algorithm is fast, because the fixed and regular connectivity of the SOM means that the search of the node nearest to a sample can be done efficiently.

Item Type:Conference item (Paper)
Additional Information:Conference url:
Full text:Full text not available from this repository.
Publisher Web site:
Date accepted:No date available
Date deposited:No date available
Date of first online publication:June 2008
Date first made open access:No date available

Save or Share this output

Look up in GoogleScholar