:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Mishra, Naman, Sreeramji, K S
Format:	Preprint
Published:	2025
Subjects:	Computational Geometry
Online Access:	https://arxiv.org/abs/2505.04617
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

On Practical Nearest Sub-Trajectory Queries under the Fréchet Distance
by: Gudmundsson, Joachim, et al.
Published: (2022)

Parallel Graph Drawing Algorithm for Bipartite Planar Graphs
by: Jain, Naman
Published: (2024)

Orthogonal Emptiness Queries for Random Points
by: Dullerud, Jonathan E., et al.
Published: (2025)

Using Ray-shooting Queries for Sublinear Algorithms for Dominating Sets in RDV Graphs
by: Biedl, Therese, et al.
Published: (2026)

Fast Nearest Neighbor Search for $\ell_p$ Metrics
by: Krauthgamer, Robert, 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)

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

Approximate Dynamic Nearest Neighbor Searching in a Polygonal Domain
by: van der Laan, Joost, et al.
Published: (2026)

Dominating Set, Independent Set, Discrete $k$-Center, Dispersion, and Related Problems for Planar Points in Convex Position
by: Tkachenko, Anastasiia, et al.
Published: (2024)

Manifold k-NN: Accelerated k-NN Queries for Manifold Point Clouds
by: Wang, Pengfei, et al.
Published: (2026)

Efficient Nearest Neighbor Search Using Dynamic Programming
by: Wang, Pengfei, 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)

Improved Total Domination and Total Roman Domination in Unit Disk Graphs
by: Rout, Sasmita, et al.
Published: (2024)

Hardness and Approximation Schemes for Discrete Packing and Domination
by: Madireddy, Raghunath Reddy, et al.
Published: (2025)

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

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

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

Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems
by: Agarwal, Pankaj K., et al.
Published: (2022)

Dominance for Containment Problems
by: Akram, Waseem, et al.
Published: (2022)

Memory Optimization for Convex Hull Support Point Queries
by: Greer, Michael
Published: (2025)

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

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

Partial Domination in Some Geometric Intersection Graphs and Some Complexity Results
by: Dutta, Madhura, et al.
Published: (2025)

Approximating Convex Hulls via Range Queries
by: Schibler, T., et al.
Published: (2026)

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

Maximizing Weighted Dominance in the Plane
by: Akram, Waseem, et al.
Published: (2024)

Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs
by: de Berg, Mark, et al.
Published: (2026)

Query-Efficient Fixpoints of $\ell_p$-Contractions
by: Haslebacher, Sebastian, et al.
Published: (2025)

Fast Approximation Algorithms for Piercing Boxes by Points
by: Agarwal, Pankaj K., et al.
Published: (2023)

Dynamic Geometric Connectivity in the Plane with Constant Query Time
by: Chan, Timothy M., et al.
Published: (2024)

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

Equichordal Points of Convex Bodies
by: Jang, Leo, et al.
Published: (2025)

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

Identifiability of Points and Rigidity of Hypergraphs under Algebraic Constraints
by: Cruickshank, James, et al.
Published: (2023)

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

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

Point containment algorithms for constructive solid geometry with unbounded primitives
by: Romano, Paul K., et al.
Published: (2024)

Computing Dominating Sets in Disk Graphs with Centers in Convex Position
by: Tkachenko, Anastasiia, et al.
Published: (2026)

Top-k Stabbing Interval Queries
by: Akram, Waseem, et al.
Published: (2024)