Computing the visibility polygon using few variables

Luis Barba, Matias Korman, Stefan Langerman, Rodrigo I. Silveira

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

We present several algorithms for computing the visibility polygon of a simple polygon from a viewpoint inside the polygon, when the polygon resides in read-only memory and only few working variables can be used. The first algorithm uses a constant number of variables, and outputs the vertices of the visibility polygon in time, where denotes the number of reflex vertices of that are part of the output. The next two algorithms use O(logr) variables, and output the visibility polygon in O(nlogr) randomized expected time or O(nlog 2 r) deterministic time, where r is the number of reflex vertices of .

Original languageEnglish
Title of host publicationAlgorithms and Computation - 22nd International Symposium, ISAAC 2011, Proceedings
Pages70-79
Number of pages10
DOIs
Publication statusPublished - 2011 Dec 26
Event22nd International Symposium on Algorithms and Computation, ISAAC 2011 - Yokohama, Japan
Duration: 2011 Dec 52011 Dec 8

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7074 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other22nd International Symposium on Algorithms and Computation, ISAAC 2011
Country/TerritoryJapan
CityYokohama
Period11/12/511/12/8

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Computing the visibility polygon using few variables'. Together they form a unique fingerprint.

Cite this