| No. |
Title |
Author |
Year |
| 1 |
Faster Approximate Covering of Subcurves Under the Fréchet Distance |
Brüning, Frederik et al. |
2022 |
| 2 |
Minimum-Error Triangulations for Sea Surface Reconstruction |
Arutyunova, Anna et al. |
2022 |
| 3 |
On Computing the k-Shortcut Fréchet Distance |
Conradi, Jacobus et al. |
2022 |
| 4 |
On the Discrete Fréchet Distance in a Graph |
Driemel, Anne et al. |
2022 |
| 5 |
Bicriteria Aggregation of Polygons via Graph Cuts |
Rottmann, Peter et al. |
2021 |
| 6 |
Computational Geometry (Dagstuhl Seminar 21181) |
Cheng, Siu-Wing et al. |
2021 |
| 7 |
On the Hardness of Computing an Average Curve |
Buchin, Kevin et al. |
2020 |
| 8 |
Computational Geometry (Dagstuhl Seminar 19181) |
Cheng, Siu-Wing et al. |
2019 |
| 9 |
The VC Dimension of Metric Balls Under Fréchet and Hausdorff Distances |
Driemel, Anne et al. |
2019 |
| 10 |
Computational Geometry (Dagstuhl Seminar 17171) |
Cheong, Orfried et al. |
2017 |
| 11 |
Locality-Sensitive Hashing of Curves |
Driemel, Anne et al. |
2017 |
| 12 |
10491 Results of the break-out group: Aggregation |
de Berg, Mark et al. |
2011 |
