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...
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...
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...
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...
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...