100 search results - page 2 / 20 » Approximation Algorithms for Geometric Intersection Graphs |
GECCO
2006
Springer
13 years 9 months ago
2006
Springer
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
COCOON
2006
Springer
13 years 9 months ago
2006
Springer
We consider the problem of placing a set of disks in a region containing obstacles such that no two disks intersect. We are given a bounding polygon P and a set R of possibly inte...
DGCI
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We give an overview of the main ideas and tools that have been employed in uncertain geometry. We show how several recognition problems in computer vision can be translat...
STOC
2003
ACM
14 years 6 months ago
2003
ACM
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
DAM
2006
13 years 5 months ago
2006
Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...