COCOON
2001
Springer
13 years 12 months ago
2001
Springer
COCOON
2001
Springer
13 years 12 months ago
2001
Springer
COCOON
2001
Springer
13 years 12 months ago
2001
Springer
A data structure called PC-tree is introduced as a generalization of PQ-trees. PC-trees were originally introduced in a planarity test of Shih and Hsu [7] where they represent par...
COCOON
2001
Springer
13 years 12 months ago
2001
Springer
COCOON
2001
Springer
13 years 12 months ago
2001
Springer
: We consider the following problem. Given a polygon P, possibly with holes, and having n vertices, compute a pair of equal radius disks that do not intersect each other, are conta...
COCOON
2001
Springer
13 years 12 months ago
2001
Springer
d by an application in thinwire visualization, we study an abstract on-line scheduling problem where the size of each requested service can be scaled down by the scheduler. Thus o...