:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Christiansen, Aleksander Bjørn Grodt, Kleist, Linda, Parada, Irene, Rotenberg, Eva
Format:	Preprint
Published:	2025
Subjects:	Computational Geometry
Online Access:	https://arxiv.org/abs/2502.10066
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the Connectivity of the Flip Graph of Plane Spanning Paths
by: Kleist, Linda, et al.
Published: (2024)

On $k$-Plane Insertion into Plane Drawings
by: Katheder, Julia, et al.
Published: (2024)

Minimum Plane Bichromatic Spanning Trees
by: Akitaya, Hugo A., et al.
Published: (2024)

The Price of Connectivity Augmentation on Planar Graphs
by: Akitaya, Hugo A., et al.
Published: (2025)

Online Packing of Orthogonal Polygons
by: Gerlach, Tim, et al.
Published: (2026)

On the Discrete Fréchet Distance in a Graph
by: Driemel, Anne, et al.
Published: (2022)

On Planar Straight-Line Dominance Drawings
by: Angelini, Patrizio, et al.
Published: (2025)

Local Density and its Distributed Approximation
by: Christiansen, Aleksander Bjørn, et al.
Published: (2024)

An Improved Bound for Plane Covering Paths
by: Akitaya, Hugo A., et al.
Published: (2025)

Adjacency Graphs of Polyhedral Surfaces
by: Arseneva, Elena, et al.
Published: (2021)

Fully-Adaptive Dynamic Connectivity of Square Intersection Graphs
by: van der Hoog, Ivor, et al.
Published: (2024)

The Complexity of Drawing Graphs on Few Lines and Few Planes
by: Chaplick, Steven, et al.
Published: (2016)

Bowties and Hourglasses: Intersections of Double-Wedges (or Stabbing and Avoiding Line Segments)
by: Bertschinger, Daniel, et al.
Published: (2026)

Fréchet Distance in Unweighted Planar Graphs
by: van der Hoog, Ivor, et al.
Published: (2025)

Online Sorting and Translational Packing of Convex Polygons
by: Aamand, Anders, et al.
Published: (2021)

Flipping Non-Crossing Spanning Trees
by: Bjerkevik, Håvard Bakke, et al.
Published: (2024)

Practical Insertion-Only Convex Hull
by: van der Hoog, Ivor, et al.
Published: (2025)

A Combinatorial Proof of Universal Optimality for Computing a Planar Convex Hull
by: van der Hoog, Ivor, et al.
Published: (2025)

Flip Distance of Non-Crossing Spanning Trees: NP-Hardness and Improved Bounds
by: Bjerkevik, Håvard Bakke, et al.
Published: (2026)

Near-tight Bounds for Computing the Fréchet Distance in d-Dimensional Grid Graphs and the Implications for λ-low Dense Curves
by: Conradi, Jacobus, et al.
Published: (2026)

The Hidden Cost of Straight Lines: Quantifying Misallocation Risk in Voronoi-based Service Area Models
by: Pinero, JA Torrecilla, et al.
Published: (2025)

Tight Universal Bounds for Partially Presorted Pareto Front and Convex Hull
by: van der Hoog, Ivor, et al.
Published: (2025)

On computing the (exact) Fréchet distance with a frog
by: Conradi, Jacobus, et al.
Published: (2025)

Engineering Fully Dynamic Convex Hulls
by: van der Hoog, Ivor, et al.
Published: (2026)

Data Structures for Approximate Discrete Fréchet Distance
by: van der Hoog, Ivor, et al.
Published: (2022)

Computing crossing numbers with topological and geometric restrictions
by: Hamm, Thekla, et al.
Published: (2024)

Reconfiguration of unit squares and disks: PSPACE-hardness in simple settings
by: Abrahamsen, Mikkel, et al.
Published: (2024)

Plane Strong Connectivity Augmentation
by: Bessy, Stéphane, et al.
Published: (2025)

Multilevel Skeletonization Using Local Separators
by: Bærentzen, J. Andreas, et al.
Published: (2023)

Barking dogs: A Fréchet distance variant for detour detection
by: van der Hoog, Ivor, et al.
Published: (2024)

Instance-Optimal Imprecise Convex Hull
by: de Berg, Sarita, et al.
Published: (2025)

Algorithms for Distance Problems in Continuous Graphs
by: Cabello, Sergio, et al.
Published: (2025)

Touring a Sequence of Orthogonal Polygons
by: Casel, Katrin, et al.
Published: (2026)

Surface Reconstruction Using Rotation Systems
by: Cui, Ruiqi, et al.
Published: (2024)

Efficient Greedy Discrete Subtrajectory Clustering
by: van der Hoog, Ivor, et al.
Published: (2025)

Simpler is Faster: Practical Distance Reporting by Sorting Along a Space-Filling Curve
by: de Berg, Sarita, et al.
Published: (2025)

Approximating Klee's Measure Problem and a Lower Bound for Union Volume Estimation
by: Bringmann, Karl, et al.
Published: (2024)

The Contiguous Art Gallery Problem is in Θ(n log n)
by: de Berg, Sarita, et al.
Published: (2025)

Charting the Diameter Computation Landscape on Intersection Graphs in the Plane
by: Chan, Timothy M., et al.
Published: (2026)

Covering and Partitioning Complex Objects with Small Pieces
by: Aamand, Anders, et al.
Published: (2026)