Memory-Constrained Algorithms for Simple Polygons

Details Memory-Constrained Algorithms for Simple Polygons Memory-Constrained Algorithms for Simple Polygons

2011-12-27

arxiv.org/abs/1112.5904v1

Computer Science

Computational Geometry

Preprint Submited to SoCG 2012

Scientific paper

A constant-workspace algorithm has read-only access to an input array and may use only O(1) additional words of $O(\log n)$ 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(n^2)$ 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(n^2)$ time, we are able to solve shortest path queries between any two points inside the polygon in $O(n^2/s)$ time.

Affiliated with

Also associated with

No associations

Rating

Memory-Constrained Algorithms for Simple Polygons does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Memory-Constrained Algorithms for Simple Polygons, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Memory-Constrained Algorithms for Simple Polygons will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-36828