Andreas Van Ressen - Academia.edu (original) (raw)
Uploads
Papers by Andreas Van Ressen
An s-workspace algorithm is an algorithm that has read-only access to the values of the input, wr... more An s-workspace algorithm is an algorithm that has read-only access to the values of the input, write-only access to the output, and only uses O(s) additional words of space. We give a random-ized s-workspace algorithm for triangulating a simple polygon P of n vertices, for any s ∈ O(n). The algorithm runs in O(n 2 /s + n(log s) log 5 (n/s)) expected time using O(s) variables, for any s ∈ O(n). In particular, when s ∈ O(n log n log 5 log n) the algorithm runs in O(n 2 /s) expected time. 1998 ACM Subject Classification I.3.5 Computational Geometry and Object Modeling
An s-workspace algorithm is an algorithm that has read-only access to the values of the input, wr... more An s-workspace algorithm is an algorithm that has read-only access to the values of the input, write-only access to the output, and only uses O(s) additional words of space. We give a random-ized s-workspace algorithm for triangulating a simple polygon P of n vertices, for any s ∈ O(n). The algorithm runs in O(n 2 /s + n(log s) log 5 (n/s)) expected time using O(s) variables, for any s ∈ O(n). In particular, when s ∈ O(n log n log 5 log n) the algorithm runs in O(n 2 /s) expected time. 1998 ACM Subject Classification I.3.5 Computational Geometry and Object Modeling