-
Chapter and Conference Paper
Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees
In the limited-workspace model, we assume that the input of size n lies in a random access read-only memory. The output has to be reported sequentially, and it cannot be accessed or modified. In addition, there i...
-
Chapter and Conference Paper
Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon
We study the problem of computing the k-visibility region in the memory-constrained model. In this model, the input resides in a randomly accessible read-only memory of O(n) words, with
-
Chapter and Conference Paper
Obedient Plane Drawings for Disk Intersection Graphs
Let \(\mathcal D\) be a set of disks and G be the intersection graph of