Sciweavers

18 search results - page 2 / 4
» arcs 1999
Sort
View
DAM
2007
129views more  DAM 2007»
13 years 8 months ago
Easy and hard instances of arc ranking in directed graphs
: In this paper we deal with the arc ranking problem of directed graphs. We give some classes of graphs for which the arc ranking problem is polynomially solvable. We prove that de...
Dariusz Dereniowski
GD
1999
Springer
14 years 24 days ago
Drawing Planar Graphs with Circular Arcs
In this paper we address the problem of drawing planar graphs with circular arcs while maintaining good angular resolution and small drawing area. We present a lower bound on the a...
C. C. Cheng, Christian A. Duncan, Michael T. Goodr...
CP
1999
Springer
14 years 24 days ago
Optimal Distributed Arc-Consistency
This paper presents DisAC-9, the first optimal distributed algorithm performing the arc-consistency of a constraint network. Our method is optimal according to the number of messa...
Youssef Hamadi
ICRA
1999
IEEE
136views Robotics» more  ICRA 1999»
14 years 24 days ago
The Arc-Transversal Median Algorithm: An Approach to Increasing Ultrasonic Sensor Accuracy
This paper describes a new method for improving the accuracy of range information using low resolution ultrasonic sensors mounted on a mobile robot. These sensors emit ultra-sound...
Keiji Nagatani, Howie Choset, Nicole A. Lazar
FOCS
1999
IEEE
14 years 25 days ago
Taking a Walk in a Planar Arrangement
We present a randomized algorithm for computing portions of an arrangement of n arcs in the plane, each pair of which intersect in at most t points. We use this algorithm to perfo...
Sariel Har-Peled