New Solutions for Surface Reconstruction from Discrete Point Data by Means of Computational Intelligence
dc.contributor.author | Albersmann, Frank | de |
dc.contributor.author | Drerup, Peter | de |
dc.contributor.author | Mehnen, Jörn | de |
dc.contributor.author | Weinert, Klaus | de |
dc.date.accessioned | 2004-12-07T08:19:40Z | |
dc.date.available | 2004-12-07T08:19:40Z | |
dc.date.created | 1998 | de |
dc.date.issued | 1998-11-08 | de |
dc.description.abstract | Surface reconstruction by means of triangulation of digitized point data leads to computational complex optimization problems. Here, deterministic algorithms often result in insufficient solutions or very long computation times. In this article, alternative methods of computational intelligence are discussed. A comparative analysis of two evolutionary algorithms applied to four different smoothness criteria for the triangulation of sparse point data sets is presented. optimally triangulated surfaces are the basis for many practical applications. The results presented here cover the efficient implementation and the influence of different triangulations for an adequate touch probe radius compensation (TPRC). | en |
dc.format.extent | 1752392 bytes | |
dc.format.extent | 297116 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | application/postscript | |
dc.identifier.uri | http://hdl.handle.net/2003/5350 | |
dc.identifier.uri | http://dx.doi.org/10.17877/DE290R-14969 | |
dc.language.iso | en | de |
dc.publisher | Universität Dortmund | de |
dc.relation.ispartofseries | Reihe Computational Intelligence ; 22 | de |
dc.subject | evolutionary algorithms | en |
dc.subject | touch probe radius compensation | en |
dc.subject | triangulation | en |
dc.subject.ddc | 004 | de |
dc.title | New Solutions for Surface Reconstruction from Discrete Point Data by Means of Computational Intelligence | en |
dc.type | Text | de |
dc.type.publicationtype | report | |
dcterms.accessRights | open access |