46 citations · 166 across the 16 of their papers we have counts for
22 papers
On Flipping the Fréchet distance
Omrit Filtser, Mayank Goswami, Joseph S. B. Mitchell +1
The classical and extensively-studied Fréchet distance between two curves is defined as an inf max, where the infimum is over all traversals of the curves, and the maximum is over…
Prediction and Prevention of Pandemics via Graphical Model Inference and Convex Programming
Mikhail Krechetov, Amir Mohammad Esmaieeli Sikaroudi, Alon Efrat +2
Hard-to-predict bursts of COVID-19 pandemic revealed significance of statistical modeling which would resolve spatio-temporal correlations over geographical areas, for example spre…
Cutting Polygons into Small Pieces with Chords: Laser-Based Localization
Esther M. Arkin, Rathish Das, Jie Gao +4
Motivated by indoor localization by tripwire lasers, we study the problem of cutting a polygon into small-size pieces, using the chords of the polygon. Several versions are conside…
Most vital segment barriers
Irina Kostitsyna, Maarten Löffler, Valentin Polishchuk +1
We study continuous analogues of "vitality" for discrete network flows/paths, and consider problems related to placing segment barriers that have highest impact on a flow/path in a…
Euclidean TSP, Motorcycle Graphs, and Other New Applications of Nearest-Neighbor Chains
Nil Mamano, Alon Efrat, David Eppstein +5
We show new applications of the nearest-neighbor chain algorithm, a technique that originated in agglomerative hierarchical clustering. We apply it to a diverse class of geometric…
Geometric secluded paths and planar satisfiability
Kevin Buchin, Valentin Polishchuk, Leonid Sedov +1
We consider paths with low \emph{exposure} to a 2D polygonal domain, i.e., paths which are seen as little as possible; we differentiate between \emph{integral} exposure (when we ca…