182 citations · 515 across the 59 of their papers we have counts for
6 papers · 1 filter
Recognizing Generalized Transmission Graphs of Line Segments and Circular Sectors
Katharina Klost, Wolfgang Mulzer
Suppose we have an arrangement of geometric objects in the plane, with a distinguished point in each object .…
Combinatorics of Beacon-based Routing in Three Dimensions
Jonas Cleve, Wolfgang Mulzer
A beacon is a point-like object which can be enabled to exert a magnetic pull on other point-like objects in space. Those objects then move towards the beacon in a greedy fashion u…
Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees
Bahareh Banyassady, Luis Barba, Wolfgang Mulzer
We present time-space trade-offs for computing the Euclidean minimum spanning tree of a set of point-sites in the plane. More precisely, we assume that resides in a ran…
Improved Time-Space Trade-offs for Computing Voronoi Diagrams
Bahareh Banyassady, Matias Korman, Wolfgang Mulzer +4
Let be a planar set of sites in general position. For , the Voronoi diagram of order for is obtained by subdividing the plane into cells such t…
Faster Algorithms for Growing Prioritized Disks and Rectangles
Hee-Kap Ahn, Sang Won Bae, Jongmin Choi +6
Motivated by map labeling, Funke, Krumpe, and Storandt [IWOCA 2016] introduced the following problem: we are given a sequence of disks in the plane. Initially, all disks have r…
Routing in Polygonal Domains
Bahareh Banyassady, Man-Kwun Chiu, Matias Korman +7
We consider the problem of routing a data packet through the visibility graph of a polygonal domain with vertices and holes. We may preprocess to obtain a label and…