Department of Computer Science and Technology

Technical reports

Fast Marching farthest point sampling for point clouds and implicit surfaces

Carsten Moenning, Neil A. Dodgson

May 2003, 15 pages

DOI: 10.48456/tr-565


In a recent paper (Moenning and Dodgson, 2003), the Fast Marching farthest point sampling strategy (FastFPS) for planar domains and curved manifolds was introduced. The version of FastFPS for curved manifolds discussed in the paper deals with surface domains in triangulated form only. Due to a restriction of the underlying Fast Marching method, the algorithm further requires the splitting of any obtuse into acute triangles to ensure the consistency of the Fast Marching approximation. In this paper, we overcome these restrictions by using Memoli and Sapiro’s (Memoli and Sapiro, 2001 and 2002) extension of the Fast Marching method to the handling of implicit surfaces and point clouds. We find that the extended FastFPS algorithm can be applied to surfaces in implicit or point cloud form without the loss of the original algorithm’s computational optimality and without the need for any preprocessing.

Full text

PDF (0.5 MB)

BibTeX record

  author =	 {Moenning, Carsten and Dodgson, Neil A.},
  title = 	 {{Fast Marching farthest point sampling for point clouds and
         	   implicit surfaces}},
  year = 	 2003,
  month = 	 may,
  url = 	 {},
  institution =  {University of Cambridge, Computer Laboratory},
  doi = 	 {10.48456/tr-565},
  number = 	 {UCAM-CL-TR-565}