Sciweavers

553 search results - page 23 / 111
» On Planar Path Transformation
Sort
View
104
Voted
ICPR
2000
IEEE
16 years 24 days ago
Self-Calibration of a Stereo Rig in a Planar Scene by Data Combination
We present a very simple and effective method for eliminating the degeneracy inherent in a planar scene, and demonstrate its performance in a useful application -- that of binocul...
Joss Knight, Ian D. Reid
STOC
1993
ACM
76views Algorithms» more  STOC 1993»
15 years 3 months ago
Piecewise linear paths among convex obstacles
Let B be a set of n arbitrary possibly intersecting convex obstacles in Rd. It is shown that any two points which can be connected by a path avoiding the obstacles can also be c...
Mark de Berg, Jirí Matousek, Otfried Schwar...
ICCV
2009
IEEE
16 years 3 months ago
Recovering Planar Homographies between 2D Shapes
Images taken from different views of a planar object are related by planar homography. Recovering the parameters of such transformations is a fundamental problem in computer vis...
Jozsef Nemeth, Csaba Domokos, Zoltan Kato
COMGEO
2004
ACM
14 years 11 months ago
How to draw the minimum cuts of a planar graph
We show how to utilize the cactus representation of all minimum cuts of a graph to visualize the minimum cuts of a planar graph in a planar drawing. In a first approach the cactus...
Ulrik Brandes, Sabine Cornelsen, Christian Fie&szl...
CORR
2008
Springer
103views Education» more  CORR 2008»
14 years 11 months ago
Path Loss Exponent Estimation in Large Wireless Networks
In wireless channels, the path loss exponent (PLE) has a strong impact on the quality of the links, and hence, it needs to be accurately estimated for the efficient design and oper...
Sunil Srinivasa, Martin Haenggi