3 papers
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
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
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…