Results 1  10
of
262
Surface reconstruction from unorganized points
 COMPUTER GRAPHICS (SIGGRAPH ’92 PROCEEDINGS)
, 1992
"... We describe and demonstrate an algorithm that takes as input an unorganized set of points fx1�:::�xng IR 3 on or near an unknown manifold M, and produces as output a simplicial surface that approximates M. Neither the topology, the presence of boundaries, nor the geometry of M are assumed to be know ..."
Abstract

Cited by 815 (8 self)
 Add to MetaCart
We describe and demonstrate an algorithm that takes as input an unorganized set of points fx1�:::�xng IR 3 on or near an unknown manifold M, and produces as output a simplicial surface that approximates M. Neither the topology, the presence of boundaries, nor the geometry of M are assumed
Parameterization of triangulations and unorganized points
 Principles of Multiresolution in Geometric Modelling
, 2001
"... Abstract. A parameterization of a surface is a onetoone mapping from a parameter domainto the surface. This paper studies the constructionof piecewise linear parameterizations of triangulations and of discrete parameterizations of sets of unorganized points. Such parameterizations are useful tools ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
Abstract. A parameterization of a surface is a onetoone mapping from a parameter domainto the surface. This paper studies the constructionof piecewise linear parameterizations of triangulations and of discrete parameterizations of sets of unorganized points. Such parameterizations are useful
Differential Rendering of Unorganized Points
"... Point sets from range scanners are noisy and do not contain additional data such as normals, which makes it difficult to create a mesh for rendering. We use the moving leastsquares (MLS) approximation to get normals and differential information, and approximate the surface near each point by an ML ..."
Abstract
 Add to MetaCart
Point sets from range scanners are noisy and do not contain additional data such as normals, which makes it difficult to create a mesh for rendering. We use the moving leastsquares (MLS) approximation to get normals and differential information, and approximate the surface near each point
Curve reconstruction from unorganized points
 Computer Aided Geometric Design
, 2000
"... We present an algorithm to approximate a set of unorganized points with a simple curve without selfintersections. The moving leastsquares method has a good ability to reduce a point cloud to a thin curvelike shape which is a nearbest approximation of the point set. In this paper, an improved mov ..."
Abstract

Cited by 67 (3 self)
 Add to MetaCart
We present an algorithm to approximate a set of unorganized points with a simple curve without selfintersections. The moving leastsquares method has a good ability to reduce a point cloud to a thin curvelike shape which is a nearbest approximation of the point set. In this paper, an improved
Surface Reconstruction from Unorganized Points
, 1992
"... We describe and demonstrate an algorithm that takes as input an unorganized set of points fx 1 ;:::;x n g # IR on or near an unknown manifold M, and produces as output a simplicial surface that approximates M. Neither the topology, the presence of boundaries, nor the geometry of M are assumed to ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We describe and demonstrate an algorithm that takes as input an unorganized set of points fx 1 ;:::;x n g # IR on or near an unknown manifold M, and produces as output a simplicial surface that approximates M. Neither the topology, the presence of boundaries, nor the geometry of M are assumed
Manifold Reconstruction from Unorganized Points
"... A new algorithm for manifold reconstruction is presented. The goal is to take samples drawn from a finitedimensional manifold, and to reconstruct a manifold, based only on the samples, which is a good approximation to the true manifold; nothing of the true manifold's geometry or topology is kno ..."
Abstract
 Add to MetaCart
A new algorithm for manifold reconstruction is presented. The goal is to take samples drawn from a finitedimensional manifold, and to reconstruct a manifold, based only on the samples, which is a good approximation to the true manifold; nothing of the true manifold's geometry or topology is known a priori. The algorithm constructs a simplicial complex based on approximating tangent hyperplanes to the manifold, and does so efficiently. Successful examples are presented for curve reconstruction in the plane, curve reconstruction in space, and surface reconstruction in space. 1
Consolidation of Unorganized Point Clouds for Surface Reconstruction
"... We consolidate an unorganized point cloud with noise, outliers, nonuniformities, and in particular interference between closeby surface sheets as a preprocess to surface generation, focusing on reliable normal estimation. Our algorithm includes two new developments. First, a weighted locally optim ..."
Abstract

Cited by 47 (10 self)
 Add to MetaCart
We consolidate an unorganized point cloud with noise, outliers, nonuniformities, and in particular interference between closeby surface sheets as a preprocess to surface generation, focusing on reliable normal estimation. Our algorithm includes two new developments. First, a weighted locally
rRegular Shape Reconstruction from Unorganized Points
, 1997
"... In this paper, the problem of reconstructing a surface, given a set of scattered data points is addressed. First, a precise formulation of the reconstruction problem is proposed. The solution is mathematically defined as a particular mesh of the surface called the normalized mesh. This solution has ..."
Abstract

Cited by 88 (3 self)
 Add to MetaCart
and the criterion cannot retrieve every faces. Some heuristics are then proposed in order to complete the surface. 1 Introduction This paper addresses the problem of meshing a surface only known by an unorganized set of points. Such a problem may occur in many domains including pattern recognition, computer vision
Fast and Robust Edge Extraction in Unorganized Point Clouds
"... Abstract—Edges provide important visual information in scene surfaces. The need for fast and robust feature extraction from 3D data is nowadays fostered by the widespread availability of cheap commercial depth sensors and multicamera setups. This article investigates the challenge of detecting edge ..."
Abstract
 Add to MetaCart
edges in surfaces represented by unorganized point clouds. Generally, edge recognition requires the extraction of geometric features such as normal vectors and curvatures. Since the normals alone do not provide enough information about the geometry of the cloud, further analysis of extracted normals
Fitting Subdivision Surfaces to Unorganized Points Submitted by
, 2005
"... In this thesis, we study the problem of fitting a subdivision surface to an unorganized point cloud. We choose to use the subdivision surface because it is a compact representation that is capable of representing shapes with arbitrary topology. On the practical side, we describe a general fitting p ..."
Abstract
 Add to MetaCart
In this thesis, we study the problem of fitting a subdivision surface to an unorganized point cloud. We choose to use the subdivision surface because it is a compact representation that is capable of representing shapes with arbitrary topology. On the practical side, we describe a general fitting
Results 1  10
of
262