Sciweavers

21 search results - page 3 / 5
» Vietoris-Rips Complexes of Planar Point Sets
Sort
View
SIGACT
2008
103views more  SIGACT 2008»
13 years 5 months ago
Computational geometry column 50
Two long-open problems have been solved: (1) every sufficiently large planar point set in general position contains the vertices of an empty hexagon; (2) every finite collection o...
Joseph O'Rourke
JDA
2010
95views more  JDA 2010»
13 years 3 months ago
Sigma-local graphs
We introduce and analyze σ-local graphs, based on a definition of locality by Erickson [12]. We present two algorithms to construct such graphs, for any real number σ > 1 an...
Prosenjit Bose, Sébastien Collette, Stefan ...
ECCV
1998
Springer
13 years 9 months ago
On Degeneracy of Linear Reconstruction from Three Views: Linear Line Complex and Applications
This paper investigates the linear degeneracies of projective structure estimation from point and line features across three views. We show that the rank of the linear system of e...
Gideon P. Stein, Amnon Shashua
SODA
2008
ACM
118views Algorithms» more  SODA 2008»
13 years 6 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
RT
2001
Springer
13 years 9 months ago
Opacity Shadow Maps
Opacity shadow maps approximate light transmittance inside a complex volume with a set of planar opacity maps. A volume made of standard primitives (points, lines, and polygons) i...
Tae-Yong Kim 0002, Ulrich Neumann