4 citations · 6 across the 4 of their papers we have counts for
5 papers · 1 filter
Realizability of Free Spaces of Curves
Hugo A. Akitaya, Maike Buchin, Majid Mirzanezhad +2
The free space diagram is a popular tool to compute the well-known Fréchet distance. As the Fréchet distance is used in many different fields, many variants have been established t…
Minimum-Complexity Graph Simplification under Fréchet-Like Distances
Omrit Filtser, Majid Mirzanezhad, Carola Wenk
Simplifying graphs is a very applicable problem in numerous domains, especially in computational geometry. Given a geometric graph and a threshold, the minimum-complexity graph sim…
On the Approximate Nearest Neighbor Queries among Curves under the Fréchet Distance
Majid Mirzanezhad
Approximate near-neighbors search (\textsc{ANNS}) is a long-studied problem in computational geometry. %that has received considerable attention by researchers in the community. In…
Global Curve Simplification
Mees van de Kerkhof, Irina Kostitsyna, Maarten Löffler +2
Due to its many applications, \emph{curve simplification} is a long-studied problem in computational geometry and adjacent disciplines, such as graphics, geographical information s…
Fast Frechet Distance Between Curves With Long Edges
Joachim Gudmundsson, Majid Mirzanezhad, Ali Mohades +1
Computing the Fréchet distance between two polygonal curves takes roughly quadratic time. In this paper, we show that for a special class of curves the Fréchet distance computation…