Fast Marching farthest point sampling
| dc.contributor.author | Moenning, Carsten | en_US |
| dc.contributor.author | Dodgson, Neil A. | en_US |
| dc.date.accessioned | 2015-11-12T07:55:17Z | |
| dc.date.available | 2015-11-12T07:55:17Z | |
| dc.date.issued | 2003 | en_US |
| dc.description.abstract | We introduce the Fast Marching farthest point sampling (FastFPS) approach for the progressive sampling of planar domains and curved manifolds in triangulated, point cloud or implicit form. By using Fast Marching methods2, 3, 6 for the incremental computation of distance maps across the sampling domain, we obtain a farthest point sampling technique superior to earlier point sampling principles in two important respects. Firstly, our method performs equally well in both the uniform and the adaptive case. Secondly, the algorithm is applicable to both images and higher dimensional surfaces in triangulated, point cloud or implicit form. This paper presents the methods underlying the algorithm and gives examples for the processing of images and triangulated surfaces. A companion report4 provides details regarding the application of the FastFPS algorithm to point clouds and implicit surfaces. | en_US |
| dc.description.seriesinformation | Eurographics 2003 - Posters | en_US |
| dc.identifier.issn | 1017-4656 | en_US |
| dc.identifier.uri | https://doi.org/10.2312/egp.20031024 | en_US |
| dc.publisher | Eurographics Association | en_US |
| dc.title | Fast Marching farthest point sampling | en_US |
Files
Original bundle
1 - 1 of 1