Fast Marching farthest point sampling

Moenning, Carsten; Dodgson, Neil A.

Fast Marching farthest point sampling

Files

moenn.pdf (248.25 KB)

Date

2003

Authors

Moenning, Carsten
Dodgson, Neil A.

Publisher

Eurographics Association

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.

        @inproceedings{:10.2312/egp.20031024
,
booktitle = {Eurographics 2003 - Posters
},
editor = {},
title = {{Fast Marching farthest point sampling
}},
author = {Moenning, Carsten and 
Dodgson, Neil A.
},
year = {2003
},
publisher = {Eurographics Association
},
ISSN = {1017-4656
},
ISBN = {},
DOI = {/10.2312/egp.20031024
}
}