4 citations · 6 across the 4 of their papers we have counts for
5 papers
Packing d-dimensional balls into a d+1-dimensional container
Helmut Alt, Sergio Cabello, Otfried Cheong +2
In this article, we consider the problems of finding in dimensions a minimum-volume axis-parallel box, a minimum-volume arbitrarily-oriented box and a minimum-volume convex b…
Bundled Crossings Revisited
Steven Chaplick, Thomas C. van Dijk, Myroslav Kryven +3
An effective way to reduce clutter in a graph drawing that has (many) crossings is to group edges that travel in parallel into \emph{bundles}. Each edge can participate in many suc…
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…
Computable Operations on Compact Subsets of Metric Spaces with Applications to Fréchet Distance and Shape Optimization
Chansu Park, Ji-Won Park, Sewon Park +2
We extend the Theory of Computation on real numbers, continuous real functions, and bounded closed Euclidean subsets, to compact metric spaces : thereby generically includin…
Obstructing Visibilities with One Obstacle
Steven Chaplick, Fabian Lipp, Ji-won Park +1
Obstacle representations of graphs have been investigated quite intensely over the last few years. We focus on graphs that can be represented by a single obstacle. Given a (topolog…