Sciweavers

71 search results - page 9 / 15
» Optimal Triangulation with Steiner Points
Sort
View
CVPR
1997
IEEE
15 years 11 months ago
Efficient Approximation of Range Images Through Data-Dependent Adaptive Triangulations
This paper presents an efficient algorithm for generating adaptive triangular meshes from dense range images. The proposed technique consists of two stages. First, a quadrilateral...
Miguel Angel García, Angel Domingo Sappa, L...
COMPGEOM
2006
ACM
15 years 3 months ago
Vines and vineyards by updating persistence in linear time
Persistent homology is the mathematical core of recent work on shape, including reconstruction, recognition, and matching. Its pertinent information is encapsulated by a pairing o...
David Cohen-Steiner, Herbert Edelsbrunner, Dmitriy...
WADS
1995
Springer
107views Algorithms» more  WADS 1995»
15 years 29 days ago
Quadrangulations of Planar Sets
We consider the problem of obtaining “nice” quadrangulations of planar sets of points. For many applications “nice” means that the quadrilaterals obtained are convex if po...
Godfried T. Toussaint
STOC
2003
ACM
153views Algorithms» more  STOC 2003»
15 years 9 months ago
Sublinear geometric algorithms
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
Bernard Chazelle, Ding Liu, Avner Magen
CVPR
2000
IEEE
15 years 11 months ago
Reconstruction from Six-Point Sequences
An algorithm is given for computing projective structure from a set of six points seen in a sequence of many images. The method is based on the notion of duality between cameras a...
Richard I. Hartley, Nicolas Y. Dano