Show simple item record

dc.contributor.authorArkin, Esther M.
dc.contributor.authorEfrat, Alon
dc.contributor.authorKnauer, Christian
dc.contributor.authorMitchell, Joseph S. B.
dc.contributor.authorPolishchuk, Valentin
dc.contributor.authorRote, Guenter
dc.contributor.authorSchlipf, Lena
dc.contributor.authorTalvitie, Topi
dc.date.accessioned2016-06-25T01:23:27Z
dc.date.available2016-06-25T01:23:27Z
dc.date.issued2016
dc.identifier.urihttp://hdl.handle.net/10150/614771
dc.description31st International Symposium on Computational Geometry (SoCG 2015)en
dc.description.abstractWe show how to preprocess a polygonal domain with a fixed starting point s in order to answer efficiently the following queries: Given a point q, how should one move from s in order to see q as soon as possible? This query resembles the well-known shortest-path-to-a-point query, except that the latter asks for the fastest way to reach q, instead of seeing it. Our solution methods include a data structure for a different generalization of shortest-path-to-a-point queries, which may be of independent interest: to report efficiently a shortest path from s to a query segment in the domain.
dc.language.isoenen
dc.publisherCARLETON UNIV, DEPT MATHEMATICS & STATISTICSen
dc.relation.urlhttp://drops.dagstuhl.de/opus/volltexte/2015/5147/pdf/64.pdfen
dc.rights© Esther M. Arkin, Alon Efrat, Christian Knauer, Joseph S. B. Mitchell, Valentin Polishchuk, Günter Rote, Lena Schlipf, Topi Talvitie; licensed under Creative Commons License CC-BYen
dc.titleSHORTEST PATH TO A SEGMENT AND QUICKEST VISIBILITY QUERIESen
dc.typeArticleen
dc.contributor.departmentUniv Arizona, Comp Scien
dc.identifier.journalJOURNAL OF COMPUTATIONAL GEOMETRYen
dc.description.collectioninformationThis item from the UA Faculty Publications collection is made available by the University of Arizona with support from the University of Arizona Libraries. If you have questions, please contact us at repository@u.library.arizona.edu.en
dc.eprint.versionFinal published versionen
refterms.dateFOA2018-09-11T14:00:26Z
html.description.abstractWe show how to preprocess a polygonal domain with a fixed starting point s in order to answer efficiently the following queries: Given a point q, how should one move from s in order to see q as soon as possible? This query resembles the well-known shortest-path-to-a-point query, except that the latter asks for the fastest way to reach q, instead of seeing it. Our solution methods include a data structure for a different generalization of shortest-path-to-a-point queries, which may be of independent interest: to report efficiently a shortest path from s to a query segment in the domain.


Files in this item

Thumbnail
Name:
64.pdf
Size:
673.1Kb
Format:
PDF
Description:
Final Published Version

This item appears in the following Collection(s)

Show simple item record