default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSarita de Berg
Person information
- affiliation: IT University of Copenhage, Denmark
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c9]Sarita de Berg
, Frank Staals:
Nearest Neighbor Searching in a Dynamic Simple Polygon. SoCG 2025: 37:1-37:15- [c8]Sarita de Berg, Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann, Sampson Wong:
Instance-Optimal Imprecise Convex Hull. ESA 2025: 25:1-25:15 - [i12]Sarita de Berg, Frank Staals:
Nearest Neighbor Searching in a Dynamic Simple Polygon. CoRR abs/2503.03435 (2025) - [i11]Sarita de Berg, Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann, Sampson Wong:
Instance-Optimal Imprecise Convex Hull. CoRR abs/2504.02611 (2025) - [i10]Sarita de Berg, Jacobus Conradi, Ivor van der Hoog, Frank Staals:
Simpler and Faster Contiguous Art Gallery. CoRR abs/2508.09734 (2025) - [i9]Sarita de Berg, Emil Toftegaard Gæde, Ivor van der Hoog, Eva Rotenberg:
Simpler is Faster: Practical Distance Reporting by Sorting Along a Space-Filling Curve. CoRR abs/2508.19891 (2025) - [i8]Sarita de Berg, Jacobus Conradi, Ivor van der Hoog, Eva Rotenberg:
The Contiguous Art Gallery Problem is in Θ(n log n). CoRR abs/2511.02960 (2025) - 2024
- [j2]Sarita de Berg, Frank Staals, Marc J. van Kreveld:
The complexity of geodesic spanners. J. Comput. Geom. 15(1): 21-65 (2024) - [c7]Sarita de Berg, Guillermo Esteban, Rodrigo I. Silveira, Frank Staals:
Exact solutions to the Weighted Region Problem. CCCG 2024: 91-102 - [c6]Mikkel Abrahamsen, Sarita de Berg, Lucas Meijer, André Nusser, Leonidas Theocharous:
Clustering with Few Disks to Minimize the Sum of Radii. SoCG 2024: 2:1-2:15 - [c5]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 - [c4]Sarita de Berg, Tim Ophelders, Irene Parada, Frank Staals, Jules Wulms:
The Complexity of Geodesic Spanners Using Steiner Points. ISAAC 2024: 25:1-25:15 - [c3]Sarita de Berg, Nathan van Beusekom, Max van Mulken, Kevin Verbeek, Jules Wulms:
Competitive Searching over Terrains. LATIN (1) 2024: 254-269 - [i7]Sarita de Berg, Nathan van Beusekom, Max van Mulken, Kevin Verbeek, Jules Wulms:
Competitive Searching over Terrains. CoRR abs/2401.01289 (2024) - [i6]Sarita de Berg, Guillermo Esteban, Rodrigo I. Silveira, Frank Staals:
Exact solutions to the Weighted Region Problem. CoRR abs/2402.12028 (2024) - [i5]Sarita de Berg, Tim Ophelders, Irene Parada, Frank Staals, Jules Wulms:
The Complexity of Geodesic Spanners using Steiner Points. CoRR abs/2402.12110 (2024) - 2023
- [j1]Sarita de Berg, Frank Staals:
Dynamic data structures for k-nearest neighbor queries. Comput. Geom. 111: 101976 (2023) - [c2]Sarita de Berg, Marc J. van Kreveld, Frank Staals:
The Complexity of Geodesic Spanners. SoCG 2023: 16:1-16:16 - [i4]Sarita de Berg, Tillmann Miltzow, Frank Staals:
Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain. CoRR abs/2303.00666 (2023) - [i3]Sarita de Berg, Marc J. van Kreveld, Frank Staals:
The Complexity of Geodesic Spanners. CoRR abs/2303.02997 (2023) - [i2]Mikkel Abrahamsen, Sarita de Berg, Lucas Meijer, André Nusser, Leonidas Theocharous:
Clustering with Few Disks to Minimize the Sum of Radii. CoRR abs/2312.08803 (2023) - 2021
- [c1]Sarita de Berg, Frank Staals:
Dynamic Data Structures for k-Nearest Neighbor Queries. ISAAC 2021: 14:1-14:14 - [i1]Sarita de Berg, Frank Staals:
Dynamic Data Structures for k-Nearest Neighbor Queries. CoRR abs/2109.11854 (2021)
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 2025-12-19 01: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:
