359 search results - page 10 / 72 » Online Algorithms for Disk Graphs |
100
click to vote
SODA
1993
ACM
15 years 28 days ago
1993
ACM
The following bounds on the competitive ratios of deterministic and randomized on-line algorithms for traversing width-w layered graphs are obtained.
JGTOOLS
2006
14 years 11 months ago
2006
Poisson Disk sampling patterns are of interest to the graphics community because their blue-noise properties are desirable in sampling patterns for rendering, illumination, and ot...
115
click to vote
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
83
Voted
COMPGEOM
2000
ACM
15 years 4 months ago
2000
ACM
We describe a kinetic data structure (KDS) that maintains the connected components of the union of a set of unit-radius disks moving in the plane. We assume that the motion of eac...
102
click to vote
ALGORITHMICA
2005
14 years 11 months ago
2005
An optimal prefetching and I/O scheduling algorithm L-OPT, for parallel I/O systems, using a read-once model of block references is presented. The algorithm uses knowledge of the n...