4 citations · 5 across the 5 of their papers we have counts for
5 papers · 1 filter
High Dimensional Consistent Digital Segments
Man-Kwun Chiu, Matias Korman
We consider the problem of digitalizing Euclidean line segments from to . Christ {\em et al.} (DCG, 2012) showed how to construct a set of {\em consist…
A linear-time algorithm for the geodesic center of a simple polygon
Hee-Kap Ahn, Luis Barba, Prosenjit Bose +3
Given two points in a simple polygon of vertices, its geodesic distance is the length of the shortest path that connects them among all paths that stay within . The geod…
Coloring and Guarding Arrangements
Prosenjit Bose, Jean Cardinal, Sébastien Collette +4
Given an arrangement of lines in the plane, what is the minimum number of colors required to color the lines so that no cell of the arrangement is monochromatic? In this paper…
The 1-Center and 1-Highway problem
José Miguel Díaz-Báñez, Matias Korman, Pablo Pérez-Lantero +1
We study a variation of the 1-center problem in which, in addition to a single supply facility, we are allowed to locate a highway. This highway increases the transportation speed…
Locating a single facility and a high-speed line
José Miguel Díaz-Báñez, Matias Korman, Pablo 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…