JOCG
2016
8 years 1 months ago
2016
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 move5 from s in or...
JOCG
2016
8 years 1 months ago
2016
We resolve an open problem due to Tetsuo Asano, showing how to compute the shortest path in a polygon, given in a read only memory, using sublinear space and subquadratic time. Sp...
JOCG
2016
8 years 1 months ago
2016
We show that in the hierarchical tile assembly model, if there is a producible assembly that overlaps a nontrivial translation of itself consistently (i.e., the pattern of tile ty...