default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrank Staals
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j19]Sarita de Berg, Frank Staals, Marc J. van Kreveld:
The complexity of geodesic spanners. J. Comput. Geom. 15(1): 21-65 (2024)- [c42]Sarita de Berg
, Tillmann Miltzow, Frank Staals:
Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain. SoCG 2024: 17:1-17:16 - [c41]Karl Bringmann, Frank Staals, Karol Wegrzycki, Geert van Wordragen:
Fine-Grained Complexity of Earth Mover's Distance Under Translation. SoCG 2024: 25:1-25:17 - [c40]Ivor van der Hoog, André Nusser, Eva Rotenberg, Frank Staals:
Fully-Adaptive Dynamic Connectivity of Square Intersection Graphs. MFCS 2024: 63:1-63:17 - [i30]Erwin Glazenburg, Thijs van der Horst, Tom Peters, Bettina Speckmann, Frank Staals:
Robust Bichromatic Classification using Two Lines. CoRR abs/2401.02897 (2024) - [i29]Sarita de Berg, Guillermo Esteban, Rodrigo I. Silveira, Frank Staals:
Exact solutions to the Weighted Region Problem. CoRR abs/2402.12028 (2024) - [i28]Sarita de Berg, Tim Ophelders, Irene Parada, Frank Staals, Jules Wulms:
The Complexity of Geodesic Spanners using Steiner Points. CoRR abs/2402.12110 (2024) - [i27]Karl Bringmann, Frank Staals, Karol Wegrzycki, Geert van Wordragen:
Fine-Grained Complexity of Earth Mover's Distance under Translation. CoRR abs/2403.04356 (2024) - [i26]Erwin Glazenburg, Frank Staals, Marc J. van Kreveld:
Robust Classification of Dynamic Bichromatic point Sets in R2. CoRR abs/2406.19161 (2024) - [i25]Ivor van der Hoog, André Nusser, Eva Rotenberg, Frank Staals:
Fully-Adaptive Dynamic Connectivity of Square Intersection Graphs. CoRR abs/2406.20065 (2024) - 2023
- [j18]Sarita de Berg, Frank Staals:
Dynamic data structures for k-nearest neighbor queries. Comput. Geom. 111: 101976 (2023) - [j17]Matias Korman, André van Renssen, Marcel Roeloffzen, Frank Staals:
Kinetic Geodesic Voronoi Diagrams in a Simple Polygon. SIAM J. Discret. Math. 37(4): 2276-2311 (2023) - [c39]Sarita de Berg, Marc J. van Kreveld, Frank Staals:
The Complexity of Geodesic Spanners. SoCG 2023: 16:1-16:16 - [c38]Maarten Löffler, Tim Ophelders, Rodrigo I. Silveira, Frank Staals:
Shortest Paths in Portalgons. SoCG 2023: 48:1-48:16 - [i24]Sarita de Berg, Tillmann Miltzow, Frank Staals:
Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain. CoRR abs/2303.00666 (2023) - [i23]Sarita de Berg, Marc J. van Kreveld, Frank Staals:
The Complexity of Geodesic Spanners. CoRR abs/2303.02997 (2023) - [i22]Maarten Löffler, Tim Ophelders, Frank Staals, Rodrigo I. Silveira:
Shortest Paths in Portalgons. CoRR abs/2303.08937 (2023) - 2022
- [j16]Thom Castermans, Bettina Speckmann, Frank Staals, Kevin Verbeek:
Agglomerative Clustering of Growing Squares. Algorithmica 84(1): 216-233 (2022) - [j15]Joachim Gudmundsson, Mees van de Kerkhof, André van Renssen, Frank Staals, Lionov Wiratma, Sampson Wong:
Covering a set of line segments with a few squares. Theor. Comput. Sci. 923: 74-98 (2022) - [c37]Maike Buchin, Ivor van der Hoog, Tim Ophelders, Lena Schlipf, Rodrigo I. Silveira, Frank Staals:
Efficient Fréchet Distance Queries for Segments. ESA 2022: 29:1-29:14 - [c36]Thijs van der Horst, Maarten Löffler, Frank Staals:
Chromatic k-Nearest Neighbor Queries. ESA 2022: 67:1-67:14 - [c35]Kevin Buchin, Bram Custers, Ivor van der Hoog, Maarten Löffler, Aleksandr Popov, Marcel Roeloffzen, Frank Staals:
Segment Visibility Counting Queries in Polygons. ISAAC 2022: 58:1-58:16 - [i21]Kevin Buchin, Bram Custers, Ivor van der Hoog, Maarten Löffler, Aleksandr Popov, Marcel Roeloffzen, Frank Staals:
Segment Visibility Counting Queries in Polygons. CoRR abs/2201.03490 (2022) - [i20]Maike Buchin, Ivor van der Hoog, Tim Ophelders, Lena Schlipf, Rodrigo I. Silveira, Frank Staals:
Efficient Fréchet distance queries for segments. CoRR abs/2203.01794 (2022) - [i19]Thijs van der Horst, Maarten Löffler, Frank Staals:
Chromatic k-Nearest Neighbor Queries. CoRR abs/2205.00277 (2022) - 2021
- [j14]Bram Custers, Mees van de Kerkhof, Wouter Meulemans, Bettina Speckmann, Frank Staals:
Maximum Physically Consistent Trajectories. ACM Trans. Spatial Algorithms Syst. 7(4): 17:1-17:33 (2021) - [c34]Joachim Gudmundsson, Mees van de Kerkhof, André van Renssen, Frank Staals, Lionov Wiratma, Sampson Wong:
Covering a Set of Line Segments with a Few Squares. CIAC 2021: 286-299 - [c33]Ankush Acharyya, Ramesh K. Jallu, Maarten Löffler, Gert G. T. Meijer, Maria Saumell, Rodrigo I. Silveira, Frank Staals:
Terrain Prickliness: Theoretical Grounds for High Complexity Viewsheds. GIScience (II) 2021: 10:1-10:16 - [c32]Sarita de Berg, Frank Staals:
Dynamic Data Structures for k-Nearest Neighbor Queries. ISAAC 2021: 14:1-14:14 - [c31]Ivor van der Hoog, Mees van de Kerkhof, Marc J. van Kreveld, Maarten Löffler, Frank Staals, Jérôme Urhausen, Jordi L. Vermeulen:
Mapping Multiple Regions to the Grid with Bounded Hausdorff Distance. WADS 2021: 627-640 - [i18]Joachim Gudmundsson, Mees van de Kerkhof, André van Renssen, Frank Staals, Lionov Wiratma, Sampson Wong:
Covering a set of line segments with a few squares. CoRR abs/2101.09913 (2021) - [i17]Ankush Acharyya, Ramesh K. Jallu, Maarten Löffler, Gert G. T. Meijer, Maria Saumell, Rodrigo I. Silveira, Frank Staals, Hans Raj Tiwary:
Terrain prickliness: theoretical grounds for low complexity viewsheds. CoRR abs/2103.06696 (2021) - [i16]Marc J. van Kreveld, Frank Staals, Amir Vaxman, Jordi L. Vermeulen:
Approximating the Earth Mover's Distance between sets of geometric objects. CoRR abs/2104.08136 (2021) - [i15]Sarita de Berg, Frank Staals:
Dynamic Data Structures for k-Nearest Neighbor Queries. CoRR abs/2109.11854 (2021) - 2020
- [c30]Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Jorren Hendriks, Erfan Hosseini Sereshgi, Vera Sacristán, Rodrigo I. Silveira, Jorrick Sleijster, Frank Staals, Carola Wenk:
Improved Map Construction using Subtrajectory Clustering. LocalRec@SIGSPATIAL 2020: 5:1-5:4 - [c29]Matias Korman, André van Renssen, Marcel Roeloffzen, Frank Staals:
Kinetic Geodesic Voronoi Diagrams in a Simple Polygon. ICALP 2020: 75:1-75:17 - [c28]Patrick Eades, Ivor van der Hoog, Maarten Löffler, Frank Staals:
Trajectory Visibility. SWAT 2020: 23:1-23:22 - [i14]Matias Korman, André van Renssen, Marcel Roeloffzen, Frank Staals:
Kinetic Geodesic Voronoi Diagrams in a Simple Polygon. CoRR abs/2002.05910 (2020)
2010 – 2019
- 2019
- [j13]Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash:
Convexity-increasing morphs of planar graphs. Comput. Geom. 84: 69-88 (2019) - [c27]Bram Custers, Mees van de Kerkhof, Wouter Meulemans, Bettina Speckmann, Frank Staals:
Maximum Physically Consistent Trajectories. SIGSPATIAL/GIS 2019: 79-88 - [c26]Lionov Wiratma, Marc J. van Kreveld, Maarten Löffler, Frank Staals:
An Experimental Evaluation of Grouping Definitions for Moving Entities. SIGSPATIAL/GIS 2019: 89-98 - [c25]Irina Kostitsyna, Maarten Löffler, Valentin Polishchuk, Frank Staals:
Most Vital Segment Barriers. WADS 2019: 495-509 - [i13]Irina Kostitsyna, Maarten Löffler, Valentin Polishchuk, Frank Staals:
Most vital segment barriers. CoRR abs/1905.01185 (2019) - 2018
- [j12]Marc J. van Kreveld, Maarten Löffler, Frank Staals, Lionov Wiratma:
A Refined Definition for Groups of Moving Entities and Its Computation. Int. J. Comput. Geom. Appl. 28(2): 181-196 (2018) - [j11]Constantinos Tsirogiannis, Frank Staals, Vincent Pellissier:
Computing the Expected Value and Variance of Geometric Measures. ACM J. Exp. Algorithmics 23 (2018) - [c24]Pankaj K. Agarwal, Lars Arge, Frank Staals:
Improved Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon. SoCG 2018: 4:1-4:14 - [c23]Lionov Wiratma, Maarten Löffler, Frank Staals:
An Experimental Comparison of Two Definitions for Groups of Moving Entities (Short Paper). GIScience 2018: 64:1-64:6 - [c22]Vahideh Keikha, Mees van de Kerkhof, Marc J. van Kreveld, Irina Kostitsyna, Maarten Löffler, Frank Staals, Jérôme Urhausen, Jordi L. Vermeulen, Lionov Wiratma:
Convex Partial Transversals of Planar Regions. ISAAC 2018: 52:1-52:12 - [c21]Thom Castermans, Bettina Speckmann, Frank Staals, Kevin Verbeek:
Agglomerative Clustering of Growing Squares. LATIN 2018: 260-274 - [c20]Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash:
Convexity-Increasing Morphs of Planar Graphs. WG 2018: 318-330 - [i12]Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash:
Convexity-Increasing Morphs of Planar Graphs. CoRR abs/1802.06579 (2018) - [i11]Pankaj K. Agarwal, Lars Arge, Frank Staals:
Improved Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon. CoRR abs/1803.05765 (2018) - [i10]Vahideh Keikha, Mees van de Kerkhof, Marc J. van Kreveld, Irina Kostitsyna, Maarten Löffler, Frank Staals, Jérôme Urhausen, Jordi L. Vermeulen, Lionov Wiratma:
Convex partial transversals of planar regions. CoRR abs/1809.10078 (2018) - 2017
- [j10]Marc J. van Kreveld, Maarten Löffler, Frank Staals:
Central trajectories. J. Comput. Geom. 8(1): 366-386 (2017) - [j9]Irina Kostitsyna, Maarten Löffler, Valentin Polishchuk, Frank Staals:
On the complexity of minimum-link path problems. J. Comput. Geom. 8(2): 80-108 (2017) - [j8]Arthur van Goethem, Frank Staals, Maarten Löffler, Jason Dykes, Bettina Speckmann:
Multi-Granular Trend Detection for Time-Series Analysis. IEEE Trans. Vis. Comput. Graph. 23(1): 661-670 (2017) - [c19]Frank Staals, Constantinos Tsirogiannis:
Computing the Expected Value and Variance of Geometric Measures. ALENEX 2017: 232-246 - [c18]Kevin Buchin, Maike Buchin, David Duran, Brittany Terese Fasy, Roel Jacobs, Vera Sacristán, Rodrigo I. Silveira, Frank Staals, Carola Wenk:
Clustering Trajectories for Map Construction. SIGSPATIAL/GIS 2017: 14:1-14:10 - [i9]Thom Castermans, Bettina Speckmann, Frank Staals, Kevin Verbeek:
Agglomerative Clustering of Growing Squares. CoRR abs/1706.10195 (2017) - [i8]Lars Arge, Frank Staals:
Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon. CoRR abs/1707.02961 (2017) - 2016
- [j7]Maarten Löffler, Martin Nöllenburg, Frank Staals:
Mixed Map Labeling. J. Spatial Inf. Sci. 13(1): 3-32 (2016) - [j6]William S. Evans, David G. Kirkpatrick, Maarten Löffler, Frank Staals:
Minimizing Co-location Potential of Moving Entities. SIAM J. Comput. 45(5): 1870-1893 (2016) - [j5]Boris Aronov, Anne Driemel, Marc J. van Kreveld, Maarten Löffler, Frank Staals:
Segmentation of Trajectories on Nonmonotone Criteria. ACM Trans. Algorithms 12(2): 26:1-26:28 (2016) - [c17]Irina Kostitsyna, Maarten Löffler, Valentin Polishchuk, Frank Staals:
On the Complexity of Minimum-Link Path Problems. SoCG 2016: 49:1-49:16 - [c16]Arthur van Goethem, Marc J. van Kreveld, Maarten Löffler, Bettina Speckmann, Frank Staals:
Grouping Time-Varying Data for Interactive Exploration. SoCG 2016: 61:1-61:16 - [c15]Erin W. Chambers, Irina Kostitsyna, Maarten Löffler, Frank Staals:
Homotopy Measures for Representative Trajectories. ESA 2016: 27:1-27:17 - [c14]Marc J. van Kreveld, Maarten Löffler, Frank Staals, Lionov Wiratma:
A Refined Definition for Groups of Moving Entities and its Computation. ISAAC 2016: 48:1-48:12 - [i7]Arthur van Goethem, Marc J. van Kreveld, Maarten Löffler, Bettina Speckmann, Frank Staals:
Grouping Time-varying Data for Interactive Exploration. CoRR abs/1603.06252 (2016) - [i6]Irina Kostitsyna, Maarten Löffler, Valentin Polishchuk, Frank Staals:
On the complexity of minimum-link path problems. CoRR abs/1603.06972 (2016) - [i5]Frank Staals, Constantinos Tsirogiannis:
Computing the Expected Value and Variance of Geometric Measures. CoRR abs/1610.03788 (2016) - 2015
- [b1]Frank Staals:
Geometric Algorithms for Trajectory Analysis. Utrecht University, Netherlands, 2015 - [j4]David Eppstein, Marc J. van Kreveld, Bettina Speckmann, Frank Staals:
Improved Grid Map Layout by Point Set Matching. Int. J. Comput. Geom. Appl. 25(2): 101-122 (2015) - [j3]Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Bettina Speckmann, Frank Staals:
Trajectory grouping structure. J. Comput. Geom. 6(1): 75-98 (2015) - [c13]Maarten Löffler, Martin Nöllenburg, Frank Staals:
Mixed Map Labeling. CIAC 2015: 339-351 - [c12]Irina Kostitsyna, Marc J. van Kreveld, Maarten Löffler, Bettina Speckmann, Frank Staals:
Trajectory Grouping Structure under Geodesic Distance. SoCG 2015: 674-688 - [i4]Marc J. van Kreveld, Maarten Löffler, Frank Staals:
Central Trajectories. CoRR abs/1501.01822 (2015) - [i3]Maarten Löffler, Martin Nöllenburg, Frank Staals:
Mixed Map Labeling. CoRR abs/1501.06813 (2015) - 2014
- [j2]Ferran Hurtado, Maarten Löffler, Inês Matos, Vera Sacristán, Maria Saumell, Rodrigo I. Silveira, Frank Staals:
Terrain Visibility with Multiple Viewpoints. Int. J. Comput. Geom. Appl. 24(4): 275-306 (2014) - [j1]Maarten Löffler, Mira Kaiser, Tim van Kapel, Gerwin Klappe, Marc J. van Kreveld, Frank Staals:
The Connect-The-Dots family of puzzles: design and automatic generation. ACM Trans. Graph. 33(4): 72:1-72:10 (2014) - [c11]Mira Kaiser, Tim van Kapel, Gerwin Klappe, Marc J. van Kreveld, Maarten Löffler, Frank Staals:
The Connect-The-Dots Family of Puzzles: The Video. SoCG 2014: 85 - [c10]Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Bettina Speckmann, Frank Staals:
Trajectory Grouping Structure: the Video. SoCG 2014: 88 - [c9]Frank Kammer, Maarten Löffler, Paul Mutser, Frank Staals:
Practical Approaches to Partially Guarding a Polyhedral Terrain. GIScience 2014: 318-332 - 2013
- [c8]David Eppstein, Marc J. van Kreveld, Bettina Speckmann, Frank Staals:
Improved grid map layout by point set matching. PacificVis 2013: 25-32 - [c7]William S. Evans, David G. Kirkpatrick, Maarten Löffler, Frank Staals:
Competitive query strategies for minimising the ply of the potential locations of moving points. SoCG 2013: 155-164 - [c6]Joachim Gudmundsson, Marc J. van Kreveld, Frank Staals:
Algorithms for hotspot computation on trajectory data. SIGSPATIAL/GIS 2013: 134-143 - [c5]Ferran Hurtado, Maarten Löffler, Inês Matos, Vera Sacristán, Maria Saumell, Rodrigo I. Silveira, Frank Staals:
Terrain Visibility with Multiple Viewpoints. ISAAC 2013: 317-327 - [c4]Boris Aronov, Anne Driemel, Marc J. van Kreveld, Maarten Löffler, Frank Staals:
Segmentation of Trajectories for Non-Monotone Criteria. SODA 2013: 1897-1911 - [c3]Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Bettina Speckmann, Frank Staals:
Trajectory Grouping Structure. WADS 2013: 219-230 - [i2]Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Bettina Speckmann, Frank Staals:
Trajectory Grouping Structures. CoRR abs/1303.6127 (2013) - [i1]Ferran Hurtado, Maarten Löffler, Inês Matos, Vera Sacristán Adinolfi, Maria Saumell, Rodrigo I. Silveira, Frank Staals:
Terrain visibility with multiple viewpoints. CoRR abs/1309.4323 (2013) - 2012
- [c2]Marijke H. L. Bodlaender, Cor A. J. Hurkens, Vincent J. J. Kusters, Frank Staals, Gerhard J. Woeginger, Hans Zantema:
Cinderella versus the Wicked Stepmother. IFIP TCS 2012: 57-71 - 2011
- [c1]Kevin Buchin, Vincent J. J. Kusters, Bettina Speckmann, Frank Staals, Bogdan Vasilescu:
A splitting line model for directional relations. GIS 2011: 142-151
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-15 19:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
