Imagen de Portada

Approximate Dynamic Nearest Neighbor Searching in a Polygonal Domain

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	van der Laan, Joost, Staals, Frank, Theunissen, Lorenzo
Formato:	Preprint
Publicado:	2026
Materias:	Computational Geometry
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

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

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

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

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

Visibility Queries in Simple Polygons
por: Bhore, Sujoy, et al.
Publicado: (2026)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

A Fast Unsupervised Scheme for Polygonal Approximation
por: Ray, Bimal Kumar
Publicado: (2025)

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

Escaping a Polygon
por: Abel, Zachary, et al.
Publicado: (2020)

Adversarially Robust Approximate Furthest Neighbor
por: Banihashem, Kiarash, et al.
Publicado: (2026)

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

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

Software for the Thompson and Funk Polygonal Geometry
por: Banerjee, Hridhaan, et al.
Publicado: (2025)

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