A new Projection Method for Point Set Surfaces
| dc.contributor.author | Kalbe, Thomas | en_US |
| dc.contributor.author | Fuhrmann, Simon | en_US |
| dc.contributor.author | Uhrig, Stefan | en_US |
| dc.contributor.author | Zeilfelder, Frank | en_US |
| dc.contributor.author | Kuijper, Arjan | en_US |
| dc.contributor.editor | P. Alliez and M. Magnor | en_US |
| dc.date.accessioned | 2015-07-09T11:07:40Z | |
| dc.date.available | 2015-07-09T11:07:40Z | |
| dc.date.issued | 2009 | en_US |
| dc.description.abstract | A successful approach in triangulating point set surfaces is to apply operations, like a projection operator for advancing front algorithms, directly to Moving-Least Squares (MLS) surfaces. The MLS method naturally handles noisy input data and is especially useful for point clouds derived from real-world solids. Unfortunately, MLS is computationally extensive and complex. We present a novel projection method that does not require solving a nonlinear optimization problem as MLS does. We create a polynomial approximation of the surface similar to MLS but our method adapts the degree of the polynomial with respect to the points to be approximated. The approximated points are iteratively collected compromising connectivity information. We enhance the orientation of the local coordinate system to further improve the method. The results confirm that our method is more robust and also accelerates triangulation due to a preprocessing step that needs to be done only once per data set. | en_US |
| dc.description.sectionheaders | Geometry and Images | en_US |
| dc.description.seriesinformation | Eurographics 2009 - Short Papers | en_US |
| dc.identifier.doi | 10.2312/egs.20091053 | en_US |
| dc.identifier.pages | 77-80 | en_US |
| dc.identifier.uri | https://doi.org/10.2312/egs.20091053 | en_US |
| dc.publisher | The Eurographics Association | en_US |
| dc.title | A new Projection Method for Point Set Surfaces | en_US |
Files
Original bundle
1 - 1 of 1