:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	van der Laan, Joost, Staals, Frank, Theunissen, Lorenzo
Format:	Preprint
Published:	2026
Subjects:	Computational Geometry
Online Access:	https://arxiv.org/abs/2603.11775
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Nearest Neighbor Searching in a Dynamic Simple Polygon
by: de Berg, Sarita, et al.
Published: (2025)

Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain
by: de Berg, Sarita, et al.
Published: (2023)

Efficient Nearest Neighbor Search Using Dynamic Programming
by: Wang, Pengfei, et al.
Published: (2024)

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

Convexity Helps Iterated Search in 3D
by: Afshani, Peyman, et al.
Published: (2025)

Fast Nearest Neighbor Search for $\ell_p$ Metrics
by: Krauthgamer, Robert, et al.
Published: (2026)

A Coreset for Approximate Furthest-Neighbor Queries in a Simple Polygon
by: de Berg, Mark, et al.
Published: (2024)

Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search
by: Spalding-Jamieson, Jack, et al.
Published: (2025)

Visibility Queries in Simple Polygons
by: Bhore, Sujoy, et al.
Published: (2026)

Dynamic Nearest-Neighbor Searching Under General Metrics in ${\mathbb R}^3$ and Its Applications
by: Agarwal, Pankaj K., et al.
Published: (2026)

Simpler and Faster Contiguous Art Gallery
by: de Berg, Sarita, et al.
Published: (2025)

Graph-Based Nearest-Neighbor Search without the Spread
by: Giliberti, Jeff, et al.
Published: (2026)

Robust Classification of Dynamic Bichromatic point Sets in R2
by: Glazenburg, Erwin, et al.
Published: (2024)

On strictly output sensitive color frequency reporting
by: Glazenburg, Erwin, et al.
Published: (2026)

Fine-Grained Complexity of Earth Mover's Distance under Translation
by: Bringmann, Karl, et al.
Published: (2024)

Near-Linear and Parameterized Approximations for Maximum Cliques in Disk Graphs
by: Gao, Jie, et al.
Published: (2025)

The Complexity of Geodesic Spanners
by: de Berg, Sarita, et al.
Published: (2023)

Navigable Graphs for High-Dimensional Nearest Neighbor Search: Constructions and Limits
by: Diwan, Haya, et al.
Published: (2024)

A Quadtree, a Steiner Spanner, and Approximate Nearest Neighbours in Hyperbolic Space
by: Kisfaludi-Bak, Sándor, et al.
Published: (2023)

Robust Bichromatic Classification using Two Lines
by: Glazenburg, Erwin, et al.
Published: (2024)

Optimizing Visibility-based Search in Polygonal Domains
by: Huynh, Kien C., et al.
Published: (2024)

On Approximation Schemes for Stabbing Rectilinear Polygons
by: Khan, Arindam, et al.
Published: (2024)

Maximizing the Maximum Degree in Ordered Nearest Neighbor Graphs
by: Ágoston, Péter, et al.
Published: (2024)

Computing Largest Subsets of Points Whose Convex Hulls have Bounded Area and Diameter
by: Picarella, Gianmarco, et al.
Published: (2025)

Realizing Planar Linkages in Polygonal Domains
by: Depian, Thomas, et al.
Published: (2026)

Incremental Planar Nearest Neighbor Queries with Optimal Query Time
by: Iacono, John, et al.
Published: (2025)

Sublinear Data Structures for Nearest Neighbor in Ultra High Dimensions
by: Herold, Martin G., et al.
Published: (2025)

Exact solutions to the Weighted Region Problem
by: de Berg, Sarita, et al.
Published: (2024)

Approximation Algorithms for the Freeze Tag Problem inside Polygons
by: Rajabi-Alni, Fatemeh, et al.
Published: (2024)

The Geodesic Fréchet Distance Between Two Curves Bounding a Simple Polygon
by: van der Horst, Thijs, et al.
Published: (2025)

Approximating the Smallest $k$-Enclosing Geodesic Disc in a Simple Polygon
by: Bose, Prosenjit, et al.
Published: (2024)

Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams
by: Buchin, Kevin, et al.
Published: (2026)

Escaping a Polygon
by: Abel, Zachary, et al.
Published: (2020)

A Fast Unsupervised Scheme for Polygonal Approximation
by: Ray, Bimal Kumar
Published: (2025)

Witness Set in Monotone Polygons: Exact and Approximate
by: Das, Udvas, et al.
Published: (2025)

Maximal Distortion of Geodesic Diameters in Polygonal Domains
by: Dumitrescu, Adrian, et al.
Published: (2023)

Adversarially Robust Approximate Furthest Neighbor
by: Banihashem, Kiarash, et al.
Published: (2026)

Tiling with Three Polygons is Undecidable
by: Demaine, Erik D., et al.
Published: (2024)

Range Counting Oracles for Geometric Problems
by: Driemel, Anne, et al.
Published: (2025)

The Complexity of Geodesic Spanners using Steiner Points
by: de Berg, Sarita, et al.
Published: (2024)