Space-efficient and data-sensitive polygon reconstruction algorithms from visibility angle information

Jinhee Chun, Ricardo Garcia De Gonzalo, Takeshi Tokuyama

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

1 Citation (Scopus)

Abstract

We propose a linear working space algorithm for reconstructing a simple polygon from the visibility angle information at vertices up to similarity. We also modify the algorithm such that its running time is sensitive to the size of visibility graph and also the diameter of a triangulation of the polygon.

Original languageEnglish
Title of host publicationAlgorithms and Computation - 24th International Symposium, ISAAC 2013, Proceedings
Pages22-32
Number of pages11
DOIs
Publication statusPublished - 2013 Dec 1
Event24th International Symposium on Algorithms and Computation, ISAAC 2013 - Hong Kong, China
Duration: 2013 Dec 162013 Dec 18

Publication series

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

Other

Other24th International Symposium on Algorithms and Computation, ISAAC 2013
CountryChina
CityHong Kong
Period13/12/1613/12/18

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Space-efficient and data-sensitive polygon reconstruction algorithms from visibility angle information'. Together they form a unique fingerprint.

Cite this