141 search results - page 22 / 29 » Self-improving Algorithms for Convex Hulls |
137
click to vote
ICRA
1994
IEEE
15 years 10 months ago
1994
IEEE
We study the problem of computing the set F of accessible and stable placements of a spider robot. The body of this robot is a single point and the legs are line segments attached...
168
click to vote
STACS
2010
Springer
16 years 26 days ago
2010
Springer
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
128
click to vote
IFIP
1998
Springer
15 years 10 months ago
1998
Springer
A conservative implementation of a predicate returns true only if the exact predicate is true. That is, we accept a one sided error for the implementation. For geometric predicate...
138
click to vote
DCG
2010
15 years 6 months ago
2010
Given any > 0 and any planar region bounded by a simple n-gon P we construct a (1 + )-quasiconformal map between and the unit disk in time C()n. One can take C() = C + C log ...
172
click to vote
PODC
2012
ACM
13 years 8 months ago
2012
ACM
This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...