31 citations · 54 across the 2 of their papers we have counts for
2 papers
cs.CG2011★ 31 cited
Memory-Constrained Algorithms for Simple Polygons
Tetsuo Asano, Kevin Buchin, Maike Buchin +4
A constant-workspace algorithm has read-only access to an input array and may use only O(1) additional words of bits, where is the size of the input. We assume that…
cs.CG2007★ 23 cited
Constructing Optimal Highways
Hee-Kap Ahn, Helmut Alt, Tetsuo Asano +7
For two points and in the plane, a straight line , called a highway, and a real , we define the \emph{travel time} (also known as the \emph{city distance}) from …