2 code implementations • 13 Apr 2020 • Anil Maheshwari, Wolfgang Mulzer, Michiel Smid
Consider a metric space $(P, dist)$ with $N$ points whose doubling dimension is a constant.
Computational Geometry
no code implementations • 19 Nov 2013 • Pegah Kamousi, Sylvain Lazard, Anil Maheshwari, Stefanie Wuhrer
We show that $\mathcal{F}_{FPS}$ can be bounded in terms of the minimal value $\mathcal{F}^*$ of the stretch factor obtained using an optimal placement of $k$ sources as $\mathcal{F}_{FPS}\leq 2 r_e^2 \mathcal{F}^*+ 2 r_e^2 + 8 r_e + 1$, where $r_e$ is the ratio of the lengths of the longest and the shortest edges of the graph.
no code implementations • 7 Dec 2012 • Jean-Lou De Carufel, Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer
In this modified variant, our objective is to minimize the length of subcurves of two polygonal curves that need to be ignored (MinEx problem), or alternately, maximize the length of subcurves that are preserved (MaxIn problem), to achieve a given Fr\'{e}chet distance.
