@InProceedings{oh_et_al:LIPIcs.ISAAC.2017.61,
author = {Oh, Eunjin and Ahn, Hee-Kap},
title = {{A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms}},
booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)},
pages = {61:1--61:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-054-5},
ISSN = {1868-8969},
year = {2017},
volume = {92},
editor = {Okamoto, Yoshio and Tokuyama, Takeshi},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.61},
URN = {urn:nbn:de:0030-drops-82401},
doi = {10.4230/LIPIcs.ISAAC.2017.61},
annote = {Keywords: Time-space trade-off, simple polygon, shortest path, shortest path tree}
}