JOCG 2016 | Sciweavers

31

JOCG
2016

58views more JOCG 2016»

Shortest path to a segment and quickest visibility queries

10 years 15 days ago

We show how to preprocess a polygonal domain with a ﬁxed starting point s in order to answer eﬃciently the following queries: Given a point q, how should one move5 from s in or...

Valentin Polishchuk, Esther M. Arkin, Alon Efrat, ...

claim paper

Read More »

24

click to vote

JOCG
2016

72views more JOCG 2016»

Shortest path in a polygon using sublinear space

10 years 15 days ago

Download drops.dagstuhl.de

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...

Sariel Har-Peled

claim paper

Read More »

22

click to vote

JOCG
2016

58views more JOCG 2016»

Pattern overlap implies runaway growth in hierarchical tile systems

10 years 15 days ago

Download drops.dagstuhl.de

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...

David Doty, Ho-Lin Chen, Ján Manuch, Arash ...

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Sciweavers