Results 1  10
of
4,305,349
Point Set Surfaces
, 2001
"... We advocate the use of point sets to represent shapes. We provide a definition of a smooth manifold surface from a set of points close to the original surface. The definition is based on local maps from differential geometry, which are approximated by the method of moving least squares (MLS). We pre ..."
Abstract

Cited by 295 (41 self)
 Add to MetaCart
We advocate the use of point sets to represent shapes. We provide a definition of a smooth manifold surface from a set of points close to the original surface. The definition is based on local maps from differential geometry, which are approximated by the method of moving least squares (MLS). We
Defining PointSet Surfaces
, 2005
"... The MLS surface [Levin 2003], used for modeling and rendering with point clouds, was originally defined algorithmically as the output of a particular meshless construction. We give a new explicit definition in terms of the critical points of an energy function on lines determined by a vector field. ..."
Abstract

Cited by 180 (2 self)
 Add to MetaCart
The MLS surface [Levin 2003], used for modeling and rendering with point clouds, was originally defined algorithmically as the output of a particular meshless construction. We give a new explicit definition in terms of the critical points of an energy function on lines determined by a vector field
Algebraic point set surfaces
 IN PROCEEDINGS SIGGRAPH ’07
, 2007
"... In this paper we present a new Point Set Surface (PSS) definition based on moving least squares (MLS) fitting of algebraic spheres. Our surface representation can be expressed by either a projection procedure or in implicit form. The central advantages of our approach compared to existing planar M ..."
Abstract

Cited by 82 (8 self)
 Add to MetaCart
In this paper we present a new Point Set Surface (PSS) definition based on moving least squares (MLS) fitting of algebraic spheres. Our surface representation can be expressed by either a projection procedure or in implicit form. The central advantages of our approach compared to existing planar
Registration of Multiple Point Sets
 Proc. 13 th Int. Conf. on Pattern Recognition
, 1996
"... Registering 3D point sets subject to rigid body motion is a common problem in computer vision. The optimal transformation is usually specified to be the minimum of a weighted least squares cost. The case of 2 point sets has been solved by several authors using analytic methods such as SVD. In this p ..."
Abstract

Cited by 67 (1 self)
 Add to MetaCart
Registering 3D point sets subject to rigid body motion is a common problem in computer vision. The optimal transformation is usually specified to be the minimum of a weighted least squares cost. The case of 2 point sets has been solved by several authors using analytic methods such as SVD
Wavelets on Irregular Point Sets
 Phil. Trans. R. Soc. Lond. A
, 1999
"... this article we review techniques for building and analyzing wavelets on irregular point sets in one and two dimensions. We discuss current results both on the practical and theoretical side. In particular we focus on subdivision schemes and commutation rules. Several examples are included. ..."
Abstract

Cited by 49 (0 self)
 Add to MetaCart
this article we review techniques for building and analyzing wavelets on irregular point sets in one and two dimensions. We discuss current results both on the practical and theoretical side. In particular we focus on subdivision schemes and commutation rules. Several examples are included.
FixedPoint Sets of Autohomeomorphisms . . .
 PROC. OF THE AMERICAN MATHEMATICAL SOCIETY
, 1995
"... We investigate fixedpoint sets of autohomeomorphisms of compact Fspaces. If the space in question is finite dimensional (in the sense of covering dimension), then the fixedpoint set is a Pset; on the other hand there is an infinitedimensional compact Fspace with an involution whose fixedpo ..."
Abstract
 Add to MetaCart
We investigate fixedpoint sets of autohomeomorphisms of compact Fspaces. If the space in question is finite dimensional (in the sense of covering dimension), then the fixedpoint set is a Pset; on the other hand there is an infinitedimensional compact Fspace with an involution whose fixedpoint
HOMEOMORPHISMS OF TWOPOINT SETS
"... Abstract. Given a cardinal κ ≤ c, a subset of the plane is said to be a κpoint set if and only it it meets every line in precisely κ many points. In response to a question of Cobb, we show that for all 2 ≤ κ, λ < c there exists a κpoint set which is homeomorphic to a λpoint set, and further, w ..."
Abstract
 Add to MetaCart
Abstract. Given a cardinal κ ≤ c, a subset of the plane is said to be a κpoint set if and only it it meets every line in precisely κ many points. In response to a question of Cobb, we show that for all 2 ≤ κ, λ < c there exists a κpoint set which is homeomorphic to a λpoint set, and further
Anisotropic smoothing of point sets
 COMPUTER AIDED GEOMETRIC DESIGN
, 2005
"... The use of point sets instead of meshes became more popular during the last years. We present a new method for anisotropic fairing of a point sampled surface using an anisotropic geometric mean curvature flow. The main advantage of our approach is that the evolution removes noise from a point set ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
The use of point sets instead of meshes became more popular during the last years. We present a new method for anisotropic fairing of a point sampled surface using an anisotropic geometric mean curvature flow. The main advantage of our approach is that the evolution removes noise from a point set
Halving Point Sets
, 1998
"... Given n points in R d , a hyperplane is called halving if it has at most bn=2c points on either side. How many partitions of a point set (into the points on one side, on the hyperplane, and on the other side) by halving hyperplanes can be realized by an npoint set in R d? ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Given n points in R d , a hyperplane is called halving if it has at most bn=2c points on either side. How many partitions of a point set (into the points on one side, on the hyperplane, and on the other side) by halving hyperplanes can be realized by an npoint set in R d?
On the characteristic of integral point sets in
 E m , Australas. J. Combin
"... We generalise the definition of the characteristic of an integral triangle to integral simplices and prove that each simplex in an integral point set has the same characteristic. This theorem is used for an efficient construction algorithm for integral point sets. Using this algorithm we are able to ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
We generalise the definition of the characteristic of an integral triangle to integral simplices and prove that each simplex in an integral point set has the same characteristic. This theorem is used for an efficient construction algorithm for integral point sets. Using this algorithm we are able
Results 1  10
of
4,305,349