6437 search results - page 7 / 1288 » Parallel Algorithms for Arrangements |
110
Voted
COMPGEOM
1994
ACM
15 years 4 months ago
1994
ACM
We give simple randomized incremental algorithms for computing the k-level in an arrangement of n lines in the plane or in an arrangement of n planes in R3. The expected running ti...
99
Voted
WADS
2007
Springer
15 years 6 months ago
2007
Springer
We consider the problem of computing the centroid of all the vertices in a non-degenerate arrangement of n lines. The trivial approach requires the enumeration of all `n 2 ´ verti...
115
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
We present a new certified and complete algorithm to compute arrangements of real planar algebraic curves. Our algorithm provides a geometric-topological analysis of the decompos...
124
click to vote
COMPGEOM
1995
ACM
15 years 4 months ago
1995
ACM
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
117
Voted
ATAL
2007
Springer
15 years 6 months ago
2007
Springer
Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Several current algorithms that solve general DCOP instan...