4 papers · 1 filter
The Voronoi Diagram of Weakly Smooth Planar Point Sets in Deterministic Rounds on the Congested Clique
Jesper Jansson, Christos Levcopoulos, Andrzej Lingas
We study the problem of computing the Voronoi diagram of a set of points with -bit coordinates in the Euclidean plane in a substantially sublinear in number of…
Local Routing in Sparse and Lightweight Geometric Graphs
Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos +2
Online routing in a planar embedded graph is central to a number of fields and has been studied extensively in the literature. For most planar graphs no -competitive online r…
A Fire Fighter's Problem
Rolf Klein, Elmar Langetepe, Christos Levcopoulos
Suppose that a circular fire spreads in the plane at unit speed. A single fire fighter can build a barrier at speed . How large must be to ensure that the fire can be cont…
Quickest Path Queries on Transportation Network
Radwa El Shawi, Joachim Gudmundsson, Christos Levcopoulos
This paper considers the problem of finding a quickest path between two points in the Euclidean plane in the presence of a transportation network. A transportation network consists…