Reprint of: Memory-constrained algorithms for simple polygons

Tetsuo Asano, Kevin Buchin, Maike Buchin, Matias Korman, Wolfgang Mulzer, Günter Rote, André Schulz

Research output: Contribution to journalArticlepeer-review

12 Citations (Scopus)

Abstract

A constant-work-space 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 input size. We show how to triangulate a plane straight-line graph with n vertices in O(n2) time and constant work-space. We also consider the problem of preprocessing a simple polygon P for shortest path queries, where P is given by the ordered sequence of its n vertices. For this, we relax the space constraint to allow s words of work-space. After quadratic preprocessing, the shortest path between any two points inside P can be found in O(n2/s) time.

Original languageEnglish
Pages (from-to)469-479
Number of pages11
JournalComputational Geometry: Theory and Applications
Volume47
Issue number3 PART B
DOIs
Publication statusPublished - 2014 Apr
Externally publishedYes

Keywords

  • Constant workspace
  • Shortest path
  • Simple polygon
  • Space-time trade-off
  • Triangulation

ASJC Scopus subject areas

  • Computer Science Applications
  • Geometry and Topology
  • Control and Optimization
  • Computational Theory and Mathematics
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Reprint of: Memory-constrained algorithms for simple polygons'. Together they form a unique fingerprint.

Cite this