Frank Staals

According to our database1, Frank Staals authored at least 58 papers between 2011 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Robust Classification of Dynamic Bichromatic point Sets in R2.
CoRR, 2024

The Complexity of Geodesic Spanners using Steiner Points.
CoRR, 2024

Exact solutions to the Weighted Region Problem.
CoRR, 2024

Robust Bichromatic Classification using Two Lines.
CoRR, 2024

Fully-Adaptive Dynamic Connectivity of Square Intersection Graphs.
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

Fine-Grained Complexity of Earth Mover's Distance Under Translation.
Proceedings of the 40th International Symposium on Computational Geometry, 2024

Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain.
Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023
Kinetic Geodesic Voronoi Diagrams in a Simple Polygon.
SIAM J. Discret. Math., December, 2023

Dynamic data structures for <i>k</i>-nearest neighbor queries.
Comput. Geom., April, 2023

Shortest Paths in Portalgons.
Proceedings of the 39th International Symposium on Computational Geometry, 2023

The Complexity of Geodesic Spanners.
Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022
Covering a set of line segments with a few squares.
Theor. Comput. Sci., 2022

Agglomerative Clustering of Growing Squares.
Algorithmica, 2022

Segment Visibility Counting Queries in Polygons.
Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

Chromatic k-Nearest Neighbor Queries.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Efficient Fréchet Distance Queries for Segments.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021
Maximum Physically Consistent Trajectories.
ACM Trans. Spatial Algorithms Syst., 2021

Approximating the Earth Mover's Distance between sets of geometric objects.
CoRR, 2021

Terrain prickliness: theoretical grounds for low complexity viewsheds.
CoRR, 2021

Mapping Multiple Regions to the Grid with Bounded Hausdorff Distance.
Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Dynamic Data Structures for k-Nearest Neighbor Queries.
Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

Terrain Prickliness: Theoretical Grounds for High Complexity Viewsheds.
Proceedings of the 11th International Conference on Geographic Information Science, 2021

2020
Trajectory Visibility.
Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

Improved Map Construction using Subtrajectory Clustering.
Proceedings of the LocalRec'20: Proceedings of the 4th ACM SIGSPATIAL Workshop on Location-Based Recommendations, 2020

2019
Convexity-increasing morphs of planar graphs.
Comput. Geom., 2019

Most Vital Segment Barriers.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

An Experimental Evaluation of Grouping Definitions for Moving Entities.
Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2019

2018
Computing the Expected Value and Variance of Geometric Measures.
ACM J. Exp. Algorithmics, 2018

A Refined Definition for Groups of Moving Entities and Its Computation.
Int. J. Comput. Geom. Appl., 2018

Convex Partial Transversals of Planar Regions.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

An Experimental Comparison of Two Definitions for Groups of Moving Entities (Short Paper).
Proceedings of the 10th International Conference on Geographic Information Science, 2018

Improved Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017
Multi-Granular Trend Detection for Time-Series Analysis.
IEEE Trans. Vis. Comput. Graph., 2017

Central trajectories.
J. Comput. Geom., 2017

On the complexity of minimum-link path problems.
J. Comput. Geom., 2017

Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon.
CoRR, 2017

Clustering Trajectories for Map Construction.
Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2017

Computing the Expected Value and Variance of Geometric Measures.
Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, 2017

2016
Segmentation of Trajectories on Nonmonotone Criteria.
ACM Trans. Algorithms, 2016

Minimizing Co-location Potential of Moving Entities.
SIAM J. Comput., 2016

Mixed Map Labeling.
J. Spatial Inf. Sci., 2016

Homotopy Measures for Representative Trajectories.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

Grouping Time-Varying Data for Interactive Exploration.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015
Geometric Algorithms for Trajectory Analysis.
PhD thesis, 2015

Trajectory grouping structure.
J. Comput. Geom., 2015

Improved Grid Map Layout by Point Set Matching.
Int. J. Comput. Geom. Appl., 2015

Trajectory Grouping Structure under Geodesic Distance.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014
The Connect-The-Dots family of puzzles: design and automatic generation.
ACM Trans. Graph., 2014

Terrain Visibility with Multiple Viewpoints.
Int. J. Comput. Geom. Appl., 2014

Practical Approaches to Partially Guarding a Polyhedral Terrain.
Proceedings of the Geographic Information Science - 8th International Conference, 2014

The Connect-The-Dots Family of Puzzles: The Video.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Trajectory Grouping Structure: the Video.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013
Trajectory Grouping Structures
CoRR, 2013

Segmentation of Trajectories for Non-Monotone Criteria.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Algorithms for hotspot computation on trajectory data.
Proceedings of the 21st SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2013

Competitive query strategies for minimising the ply of the potential locations of moving points.
Proceedings of the Symposium on Computational Geometry 2013, 2013

2012
Cinderella versus the Wicked Stepmother.
Proceedings of the Theoretical Computer Science, 2012

2011
A splitting line model for directional relations.
Proceedings of the 19th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2011


  Loading...