Department of Computer Science and Technology

Technical reports

Fast Marching farthest point sampling

Carsten Moenning, Neil A. Dodgson

April 2003, 16 pages


Using Fast Marching for the incremental computation of distance maps across the sampling domain, we obtain an efficient farthest point sampling technique (FastFPS). The method is based on that of Eldar et al. (1992, 1997) but extends more naturally to the case of non-uniform sampling and is more widely applicable. Furthermore, it can be applied to both planar domains and curved manifolds and allows for weighted domains in which different cost is associated with different points on the surface. We conclude with considering the extension of FastFPS to the sampling of point clouds without the need for prior surface reconstruction.

Full text

PDF (0.5 MB)

BibTeX record

  author =	 {Moenning, Carsten and Dodgson, Neil A.},
  title = 	 {{Fast Marching farthest point sampling}},
  year = 	 2003,
  month = 	 apr,
  url = 	 {},
  institution =  {University of Cambridge, Computer Laboratory},
  number = 	 {UCAM-CL-TR-562}