Sciweavers

205 search results - page 12 / 41
» On Deletion in Delaunay Triangulations
Sort
View
COMPUTING
2007
126views more  COMPUTING 2007»
13 years 7 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ö...
SODA
2008
ACM
118views Algorithms» more  SODA 2008»
13 years 9 months ago
Geodesic Delaunay triangulation and witness complex in the plane
We introduce a new feature size for bounded domains in the plane endowed with an intrinsic metric. Given a point x in a domain X, the homotopy feature size of X at x measures half...
Jie Gao, Leonidas J. Guibas, Steve Oudot, Yue Wang
WG
2010
Springer
13 years 6 months ago
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse,...
ICCV
2007
IEEE
14 years 9 months ago
Efficient Multi-View Reconstruction of Large-Scale Scenes using Interest Points, Delaunay Triangulation and Graph Cuts
We present a novel method to reconstruct the 3D shape of a scene from several calibrated images. Our motivation is that most existing multi-view stereovision approaches require so...
Patrick Labatut, Jean-Philippe Pons, Renaud Kerive...
W2GIS
2004
Springer
14 years 28 days ago
P2P Spatial Query Processing by Delaunay Triangulation
Abstract. Although a number of methods have been proposed to process exact match or range queries in P2P network, very few attention has been paid on spatial query process. In this...
Hye-Young Kang, Bog-Ja Lim, Ki-Joune Li