A Coreset for Approximate Furthest-Neighbor Queries in a Simple Polygon
Fuente:
arXiv
Saved in:
| Main Authors: | de Berg, Mark, Theocharous, Leonidas |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
On the Doubling Dimension and the Perimeter of Geodesically Convex Sets in Fat Polygons
by: de Berg, Mark, et al.
Published: (2026)
by: de Berg, Mark, et al.
Published: (2026)
A Polynomial Coreset for Furthest Neighbor in Planar Metrics
by: Kluk, Kacper, et al.
Published: (2026)
by: Kluk, Kacper, et al.
Published: (2026)
Adversarially Robust Approximate Furthest Neighbor
by: Banihashem, Kiarash, et al.
Published: (2026)
by: Banihashem, Kiarash, et al.
Published: (2026)
Nearest Neighbor Searching in a Dynamic Simple Polygon
by: de Berg, Sarita, et al.
Published: (2025)
by: de Berg, Sarita, et al.
Published: (2025)
A Clique-Based Separator for Intersection Graphs of Geodesic Disks in $\mathbb{R}^2$
by: Aronov, Boris, et al.
Published: (2024)
by: Aronov, Boris, et al.
Published: (2024)
Realizing Metric Spaces with Convex Obstacles
by: Kisfaludi-Bak, Sándor, et al.
Published: (2025)
by: Kisfaludi-Bak, Sándor, et al.
Published: (2025)
Approximate Dynamic Nearest Neighbor Searching in a Polygonal Domain
by: van der Laan, Joost, et al.
Published: (2026)
by: van der Laan, Joost, et al.
Published: (2026)
Visibility Queries in Simple Polygons
by: Bhore, Sujoy, et al.
Published: (2026)
by: Bhore, Sujoy, et al.
Published: (2026)
Clustering with Few Disks to Minimize the Sum of Radii
by: Abrahamsen, Mikkel, et al.
Published: (2023)
by: Abrahamsen, Mikkel, et al.
Published: (2023)
Approximating the Smallest $k$-Enclosing Geodesic Disc in a Simple Polygon
by: Bose, Prosenjit, et al.
Published: (2024)
by: Bose, Prosenjit, et al.
Published: (2024)
Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain
by: de Berg, Sarita, et al.
Published: (2023)
by: de Berg, Sarita, et al.
Published: (2023)
Compatible Triangulations of Simple Polygons
by: Afshani, Peyman, et al.
Published: (2026)
by: Afshani, Peyman, et al.
Published: (2026)
Multirobot Watchman Routes in a Simple Polygon
by: Mitchell, Joseph S. B., et al.
Published: (2024)
by: Mitchell, Joseph S. B., et al.
Published: (2024)
Covering Simple Orthogonal Polygons with Rectangles
by: Roy, Aniket Basu
Published: (2024)
by: Roy, Aniket Basu
Published: (2024)
On Stable Approximation Algorithms for Geometric Coverage Problems
by: de Berg, Mark, et al.
Published: (2024)
by: de Berg, Mark, et al.
Published: (2024)
On Approximation Schemes for Stabbing Rectilinear Polygons
by: Khan, Arindam, et al.
Published: (2024)
by: Khan, Arindam, et al.
Published: (2024)
Minimum Star Partitions of Simple Polygons in Polynomial Time
by: Abrahamsen, Mikkel, et al.
Published: (2023)
by: Abrahamsen, Mikkel, et al.
Published: (2023)
Dispersive Vertex Guarding for Simple and Non-Simple Polygons
by: Fekete, Sándor P., et al.
Published: (2024)
by: Fekete, Sándor P., et al.
Published: (2024)
Fast Approximations and Coresets for (k, l)-Median under Dynamic Time Warping
by: Conradi, Jacobus, et al.
Published: (2023)
by: Conradi, Jacobus, et al.
Published: (2023)
Hardness of Packing, Covering and Partitioning Simple Polygons with Unit Squares
by: Abrahamsen, Mikkel, et al.
Published: (2024)
by: Abrahamsen, Mikkel, et al.
Published: (2024)
Approximation Algorithms for the Freeze Tag Problem inside Polygons
by: Rajabi-Alni, Fatemeh, et al.
Published: (2024)
by: Rajabi-Alni, Fatemeh, et al.
Published: (2024)
Simple Grid Polygon Online Exploration Revisited
by: Brock, Maximilian, et al.
Published: (2024)
by: Brock, Maximilian, et al.
Published: (2024)
A Fast Unsupervised Scheme for Polygonal Approximation
by: Ray, Bimal Kumar
Published: (2025)
by: Ray, Bimal Kumar
Published: (2025)
Incremental Planar Nearest Neighbor Queries with Optimal Query Time
by: Iacono, John, et al.
Published: (2025)
by: Iacono, John, et al.
Published: (2025)
Witness Set in Monotone Polygons: Exact and Approximate
by: Das, Udvas, et al.
Published: (2025)
by: Das, Udvas, et al.
Published: (2025)
Escaping a Polygon
by: Abel, Zachary, et al.
Published: (2020)
by: Abel, Zachary, et al.
Published: (2020)
Coresets for Farthest Point Problems in Hyperbolic Space
by: Park, Eunku, et al.
Published: (2025)
by: Park, Eunku, et al.
Published: (2025)
Tiling with Three Polygons is Undecidable
by: Demaine, Erik D., et al.
Published: (2024)
by: Demaine, Erik D., 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)
by: van der Horst, Thijs, et al.
Published: (2025)
No Dimensional Sampling Coresets for Classification
by: Alishahi, Meysam, et al.
Published: (2024)
by: Alishahi, Meysam, et al.
Published: (2024)
Software for the Thompson and Funk Polygonal Geometry
by: Banerjee, Hridhaan, et al.
Published: (2025)
by: Banerjee, Hridhaan, et al.
Published: (2025)
Approximating Convex Hulls via Range Queries
by: Schibler, T., et al.
Published: (2026)
by: Schibler, T., et al.
Published: (2026)
Coordinated Motion Planning is FPT on Discretized Simple Polygons
by: Deligkas, Argyrios, et al.
Published: (2026)
by: Deligkas, Argyrios, et al.
Published: (2026)
An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs
by: de Berg, Mark, et al.
Published: (2025)
by: de Berg, Mark, et al.
Published: (2025)
Robustly Guarding Polygons
by: Das, Rathish, et al.
Published: (2024)
by: Das, Rathish, et al.
Published: (2024)
Partitioning a Polygon Into Small Pieces
by: Abrahamsen, Mikkel, et al.
Published: (2022)
by: Abrahamsen, Mikkel, et al.
Published: (2022)
An Improved Bound for Plane Covering Paths
by: Akitaya, Hugo A., et al.
Published: (2025)
by: Akitaya, Hugo A., et al.
Published: (2025)
Recognizing Visibility Graphs of Polygons with Holes and Internal-External Visibility Graphs of Polygons
by: Boomari, Hossein, et al.
Published: (2018)
by: Boomari, Hossein, et al.
Published: (2018)
Ipelets for the Convex Polygonal Geometry
by: Parepally, Nithin, et al.
Published: (2024)
by: Parepally, Nithin, et al.
Published: (2024)
Online Packing of Orthogonal Polygons
by: Gerlach, Tim, et al.
Published: (2026)
by: Gerlach, Tim, et al.
Published: (2026)
Similar Items
-
On the Doubling Dimension and the Perimeter of Geodesically Convex Sets in Fat Polygons
by: de Berg, Mark, et al.
Published: (2026) -
A Polynomial Coreset for Furthest Neighbor in Planar Metrics
by: Kluk, Kacper, et al.
Published: (2026) -
Adversarially Robust Approximate Furthest Neighbor
by: Banihashem, Kiarash, et al.
Published: (2026) -
Nearest Neighbor Searching in a Dynamic Simple Polygon
by: de Berg, Sarita, et al.
Published: (2025) -
A Clique-Based Separator for Intersection Graphs of Geodesic Disks in $\mathbb{R}^2$
by: Aronov, Boris, et al.
Published: (2024)