ویراساینس.
سند علمی

Fast Marching farthest point sampling for point clouds and implicit surfaces

Carsten Moenning, Neil A. Dodgson, Markus Kuhn

چکیده

In a recent paper [13], 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 [13] 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 Mémoli and Sapiro’s [11, 12] 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.

اسناد مشابه

  • Fast Marching farthest point sampling for implicit surfaces and point clouds

    سند علمی۲۰۰۳Carsten Moenning

    In a recent paper [13], 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 [13] deals with surface domains in triangulated form only. Due to a rest

  • Fast Marching farthest point sampling

    سند علمی۲۰۰۳Carsten Moenning, Neil A. Dodgson

    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 acro

  • Robust and Efficient Implicit Surface Reconstruction for Point Clouds Based on Convexified Image Segmentation

    سند علمی۲۰۱۳J. Sci. Comput.Jian Liang, Frederick Park, Hongkai Zhao

    We present implicit surface reconstruction algorithms for point clouds. We view the implicit surface reconstruction as a three dimensional binary image segmentation problem that segments the entire space R3 or the computational domain into an interior region and an exterior regio

  • Anisotropic Sampling for Differential Point Rendering of Implicit Surfaces

    سند علمی۲۰۰۵WSCGFlorian Levet, Julien Hadim, Patrick Reuter, Christophe Schlick

    In this paper, we propose a solution to adapt the differential point rendering technique developed by Kalaiah and Varshney to implicit surfaces. Differential point rendering was initially designed for parametric surfaces as a twostage sampling process that strongly relies on an a

  • Construction of Implicit Surfaces from Point Clouds Using a Feature-based Approach

    سند علمی۲۰۱۱Scientific Visualization: Interactions, Features, MetaphorsPatric Keller, Oliver Kreylos, Eric S. Cowgill, Louise H. Kellogg

    We present a novel feature-based approach to surface generation from point clouds in three-dimensional space obtained by terrestrial and airborne laser scanning. In a first step, we apply a multiscale clustering and classification of local point set neighborhoods by considering t

  • Fast low-memory streaming MLS reconstruction of point-sampled surfaces

    سند علمی۲۰۰۹Graphics InterfaceGianmauro Cuccuru, Enrico Gobbetti, Fabio Marton, Renato Pajarola

    We present a simple and efficient method for reconstructing triangulated surfaces from massive oriented point sample datasets. The method combines streaming and parallelization, moving leastsquares (MLS) projection, adaptive space subdivision, and regularized isosurface extractio