No. |
Title |
Author |
Year |
---|

1 |
Chromatic k-Nearest Neighbor Queries |
van der Horst, Thijs et al. |
2022 |

2 |
Efficient Fréchet Distance Queries for Segments |
Buchin, Maike et al. |
2022 |

3 |
Segment Visibility Counting Queries in Polygons |
Buchin, Kevin et al. |
2022 |

4 |
Dynamic Data Structures for k-Nearest Neighbor Queries |
de Berg, Sarita et al. |
2021 |

5 |
Terrain Prickliness: Theoretical Grounds for High Complexity Viewsheds |
Acharyya, Ankush et al. |
2021 |

6 |
Kinetic Geodesic Voronoi Diagrams in a Simple Polygon |
Korman, Matias et al. |
2020 |

7 |
Trajectory Visibility |
Eades, Patrick et al. |
2020 |

8 |
An Experimental Comparison of Two Definitions for Groups of Moving Entities (Short Paper) |
Wiratma, Lionov et al. |
2018 |

9 |
Convex Partial Transversals of Planar Regions |
Keikha, Vahideh et al. |
2018 |

10 |
Improved Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon |
Agarwal, Pankaj K. et al. |
2018 |

11 |
A Refined Definition for Groups of Moving Entities and its Computation |
van Kreveld, Marc et al. |
2016 |

12 |
Grouping Time-Varying Data for Interactive Exploration |
van Goethem, Arthur et al. |
2016 |

13 |
Homotopy Measures for Representative Trajectories |
Chambers, Erin et al. |
2016 |

14 |
On the Complexity of Minimum-Link Path Problems |
Kostitsyna, Irina et al. |
2016 |

15 |
Trajectory Grouping Structure under Geodesic Distance |
Kostitsyna, Irina et al. |
2015 |