31 citations · 157 across the 51 of their papers we have counts for
5 papers · 2 filters
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…
Computing a visibility polygon using few variables
Luis Barba, Matias Korman, Stefan Langerman +1
We present several algorithms for computing the visibility polygon of a simple polygon from a viewpoint inside the polygon, when the polygon resides in read-only memory and onl…
Locating a service facility and a rapid transit line
J. M. Díaz-Bañez, M. Korman, P. Pérez-Lantero +1
In this paper we study a facility location problem in the plane in which a single point (facility) and a rapid transit line (highway) are simultaneously located in order to minimiz…
Minimizing interference in ad-hoc networks with bounded communication radius
Matias Korman
We consider a topology control problem in which we are given a set of sensors in the plane and we would like to assign a communication radius to each of them. The radii assignm…
Coloring Planar Homothets and Three-Dimensional Hypergraphs
Jean Cardinal, Matias Korman
The inclusion relation between simple objects in the plane may be used to define geometric set systems, or hypergraphs. Properties of various types of colorings of these hypergraph…