A constant-workspace algorithm has read-only access to an input array and may
use only O(1) additional words of O(logn) bits, where n is the size of
the input. We assume that a simple n-gon is given by the ordered sequence of
its vertices. We show that we can find a triangulation of a plane straight-line
graph in O(n2) time. We also consider preprocessing a simple polygon for
shortest path queries when the space constraint is relaxed to allow s words
of working space. After a preprocessing of O(n2) time, we are able to solve
shortest path queries between any two points inside the polygon in O(n2/s)
time.Comment: Preprint appeared in EuroCG 201