no code implementations • 13 Jan 2021 • Sujoy Bhore, Rahul Jain
We show that for every $\epsilon> 0$, there exists a polynomial-time algorithm that can solve Reachability in an $n$ vertex directed penny graph, using $O(n^{1/4+\epsilon})$ space.
Computational Complexity Computational Geometry
no code implementations • 18 Feb 2020 • Sujoy Bhore, Guangping Li, Martin Nöllenburg
Map labeling is a classical problem in cartography and geographic information systems (GIS) that asks to place labels for area, line, and point features, with the goal to select and place the maximum number of independent, i. e., overlap-free, labels.
Computational Geometry Data Structures and Algorithms
