SHORTEST PATH TO A SEGMENT AND QUICKEST VISIBILITY QUERIES
31st International Symposium on Computational Geometry (SoCG 2015) === We 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 resemb...
| Main Authors: | , , , , , , , |
|---|---|
| Other Authors: | |
| Language: | en |
| Published: |
CARLETON UNIV, DEPT MATHEMATICS & STATISTICS
2016
|
| Online Access: | http://hdl.handle.net/10150/614771 http://arizona.openrepository.com/arizona/handle/10150/614771 |