13 citations · 26 across the 20 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
cs.CG2023
Shortest Paths in Portalgons
Maarten Löffler, Tim Ophelders, Frank Staals +1
Any surface that is intrinsically polyhedral can be represented by a collection of simple polygons (fragments), glued along pairs of equally long oriented edges, where each fragmen…
cs.CG2023
The Complexity of Geodesic Spanners
Sarita de Berg, Marc van Kreveld, Frank Staals
A geometric -spanner for a set of point sites is an edge-weighted graph for which the (weighted) distance between any two sites is at most times the orig…
cs.CG2023
Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain
Sarita de Berg, Tillmann Miltzow, Frank Staals
We devise a data structure that can answer shortest path queries for two query points in a polygonal domain on vertices. For any , the space complexity of…