549 search results - page 36 / 110 » The corner arc algorithm |
CCCG
2007
15 years 17 days ago
2007
We study the problem how to draw a planar graph such that every vertex is incident to an angle greater than π. In general a straightline embedding cannot guarantee this property....
NETWORKING
2004
15 years 14 days ago
2004
We consider the problem of non-bifurcated multicommodity flows rerouting in survivable connection-oriented networks. We focus on local restoration, in which the backup route is rer...
APPROX
2000
Springer
15 years 3 months ago
2000
Springer
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
MP
2007
14 years 10 months ago
2007
We analyze a separation procedure for Mixed-Integer Programs related to the work of Gomory and Johnson on interpolated subadditive functions. This approach has its roots in the Go...
ICRA
2010
IEEE
14 years 9 months ago
2010
IEEE
— The detection of features from Light Detection and Ranging (LIDAR) data is a fundamental component of featurebased mapping and SLAM systems. Existing detectors tend to exploit ...