TY - GEN
T1 - Space-efficient and data-sensitive polygon reconstruction algorithms from visibility angle information
AU - Chun, Jinhee
AU - De Gonzalo, Ricardo Garcia
AU - Tokuyama, Takeshi
PY - 2013
Y1 - 2013
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84893369691&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84893369691&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-45030-3_3
DO - 10.1007/978-3-642-45030-3_3
M3 - Conference contribution
AN - SCOPUS:84893369691
SN - 9783642450297
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 22
EP - 32
BT - Algorithms and Computation - 24th International Symposium, ISAAC 2013, Proceedings
T2 - 24th International Symposium on Algorithms and Computation, ISAAC 2013
Y2 - 16 December 2013 through 18 December 2013
ER -