947 search results - page 108 / 190 » Discrete Geometry |
COMPGEOM
2003
ACM
15 years 3 months ago
2003
ACM
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...
COMPGEOM
2003
ACM
15 years 3 months ago
2003
ACM
In this paper we describe and analyze a method based on local least square fitting for estimating the normals at all sample points of a point cloud data (PCD) set, in the presenc...
131
click to vote
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
The Reeb graph of a scalar function represents the evolution of the topology of its level sets. In this video, we describe a near-optimal output-sensitive algorithm for computing ...
100
click to vote
CGF
2007
14 years 9 months ago
2007
In this paper, a new free-form shape deformation approach is proposed. We combine a skeleton-based mesh deformation technique with discrete differential coordinates in order to cr...
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
Topological persistence has proven to be a key concept for the study of real-valued functions defined over topological spaces. Its validity relies on the fundamental property tha...