327 search results - page 1 / 66 » A fully dynamic algorithm for planar |
COMPGEOM
2001
ACM
14 years 2 months ago
2001
ACM
We show how to maintain the width of a set of n planar points subject to insertions and deletions of points in O( n log3 n) amortized time per update. Previously, no fully dynami...
ALGORITHMICA
1998
13 years 10 months ago
1998
In this paper we give a fully dynamic approximation scheme for maintaining all-pairs shortest paths in planar networks. Given an error parameter ε such that 0 < ε, our algorit...
ESA
2004
Springer
14 years 4 months ago
2004
Springer
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
ISPD
1998
ACM
14 years 3 months ago
1998
ACM
—High-frequency circuits are notoriously difficult to lay out because of the tight coupling between device-level placement and wiring. Given that successful electrical performan...
STOC
1994
ACM
14 years 2 months ago
1994
ACM
