2255 search results - page 120 / 451 » Computing a Center-Transversal Line |
104
click to vote
COMGEO
2000
ACM
14 years 11 months ago
2000
ACM
Given a set X of points in the plane, two distinguished points s,t X, and a set of obstacles represented by line segments, we wish to compute a simple polygonal path from s to t...
ECCV
1992
Springer
15 years 3 months ago
1992
Springer
This paper describes the geometrical limitations of algorithms for 3D reconstruction which use corresponding line tokens. In addition to announcing a description of the general cri...
COMPGEOM
2004
ACM
15 years 4 months ago
2004
ACM
This paper presents an algorithm for sampling and triangulating a generic C2 -smooth surface Σ ⊂ R3 that is input with an implicit equation. The output triangulation is guarant...
BMVC
2000
15 years 14 days ago
2000
In this paper, we present results of a comparative study on disparity analysis of convergent stereo systems. If the epipolar geometry is known, disparity analysis can be performed...
GC
2007
Springer
14 years 11 months ago
2007
Springer
We develop Gray code enumeration schemes for geometric graphs in the plane. The considered graph classes include plane straight-line graphs, plane spanning trees, and connected pl...