Sciweavers

1245 search results - page 46 / 249
» Triangulation for Points on Lines
Sort
View
COMGEO
2010
ACM
14 years 9 months ago
The complexity of flow on fat terrains and its i/o-efficient computation
We study the complexity and the I/O-efficient computation of flow on triangulated terrains. We present an acyclic graph, the descent graph, that enables us to trace flow paths in ...
Mark de Berg, Otfried Cheong, Herman J. Haverkort,...
ICCV
1995
IEEE
15 years 1 months ago
Complete Scene Structure from Four Point Correspondences
A new technique is presented for computing 3D scene structure from point and line features in monocular image sequences. Unlike previous methods, the technique guarantees the comp...
Steven M. Seitz, Charles R. Dyer
COMPGEOM
2004
ACM
15 years 3 months ago
Separating point sets in polygonal environments
We consider the separability of two point sets inside a polygon by means of chords or geodesic lines. Specifically, given a set of red points and a set of blue points in the inte...
Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Jo...
IPCO
2007
114views Optimization» more  IPCO 2007»
14 years 11 months ago
Distinct Triangle Areas in a Planar Point Set
Erd˝os, Purdy, and Straus conjectured that the number of distinct (nonzero) areas of the triangles determined by n noncollinear points in the plane is at least n−1 2 , which is...
Adrian Dumitrescu, Csaba D. Tóth
BMVC
2000
14 years 11 months ago
A New Approach for Vanishing Point Detection in Architectural Environments
A man-made environment is characterized by a lot of parallel lines and a lot of orthogonal edges. In this article, a new method for detecting the three mutual orthogonal direction...
Carsten Rother