Sciweavers

12 search results - page 1 / 3
» An algorithm for the construction of intrinsic delaunay tria...
Sort
View
COMPUTING
2007
126views more  COMPUTING 2007»
13 years 4 months ago
An algorithm for the construction of intrinsic delaunay triangulations with applications to digital geometry processing
The discrete Laplace-Beltrami operator plays a prominent role in many Digital Geometry Processing applications ranging from denoising to parameterization, editing, and physical si...
Matthew Fisher, Boris Springborn, Peter Schrö...
COMPGEOM
2010
ACM
13 years 8 months ago
Manifold reconstruction using tangential Delaunay complexes
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
Jean-Daniel Boissonnat, Arijit Ghosh
COMPGEOM
1993
ACM
13 years 8 months ago
A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon
For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...
Rolf Klein, Andrzej Lingas
JODL
2006
131views more  JODL 2006»
13 years 4 months ago
Keyframe-based video summarization using Delaunay clustering
Recent advances in technology have made tremendous amount of multimedia information available to the general population. An efficient way of dealing with this new development is t...
Padmavathi Mundur, Yong Rao, Yelena Yesha
COMPGEOM
2009
ACM
13 years 11 months ago
High resolution surface reconstruction from overlapping multiple-views
Extracting a computer model of a real scene from a sequence of views, is one of the most challenging and fundamental problems in computer vision. Stereo vision algorithms allow us...
Nader Salman, Mariette Yvinec