activity
20172023
most citedOn the Approximate Nearest Neighbor Queries among Curves under the Fréchet Distance

4 citations · 6 across the 4 of their papers we have counts for

collaborators

6 papers

cs.CG2023

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…

stat.ME2022

Estimating Demand for Online Delivery using Limited Historical Observations

Majid Mirzanezhad, Richard Twumasi-Boakye, Andrea Broaddus +1

Driven in part by the COVID-19 pandemic, the pace of online purchases for at-home delivery has accelerated significantly. However, responding to this development has been challengi…

cs.CG2021

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…

cs.CG2020★ 4 cited

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…

cs.CG2018★ 2 cited

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…

cs.CG2017

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…