:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Mishra, Naman, Sreeramji, K S
Format:	Preprint
Publié:	2025
Sujets:	Computational Geometry
Accès en ligne:	https://arxiv.org/abs/2505.04617
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Incremental Planar Nearest Neighbor Queries with Optimal Query Time
par: Iacono, John, et autres
Publié: (2025)

On Practical Nearest Sub-Trajectory Queries under the Fréchet Distance
par: Gudmundsson, Joachim, et autres
Publié: (2022)

Parallel Graph Drawing Algorithm for Bipartite Planar Graphs
par: Jain, Naman
Publié: (2024)

Orthogonal Emptiness Queries for Random Points
par: Dullerud, Jonathan E., et autres
Publié: (2025)

Using Ray-shooting Queries for Sublinear Algorithms for Dominating Sets in RDV Graphs
par: Biedl, Therese, et autres
Publié: (2026)

Fast Nearest Neighbor Search for $\ell_p$ Metrics
par: Krauthgamer, Robert, et autres
Publié: (2026)

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

Nearest Neighbor Searching in a Dynamic Simple Polygon
par: de Berg, Sarita, et autres
Publié: (2025)

Approximate Dynamic Nearest Neighbor Searching in a Polygonal Domain
par: van der Laan, Joost, et autres
Publié: (2026)

Dominating Set, Independent Set, Discrete $k$-Center, Dispersion, and Related Problems for Planar Points in Convex Position
par: Tkachenko, Anastasiia, et autres
Publié: (2024)

Manifold k-NN: Accelerated k-NN Queries for Manifold Point Clouds
par: Wang, Pengfei, et autres
Publié: (2026)

Efficient Nearest Neighbor Search Using Dynamic Programming
par: Wang, Pengfei, et autres
Publié: (2024)

A Quadtree, a Steiner Spanner, and Approximate Nearest Neighbours in Hyperbolic Space
par: Kisfaludi-Bak, Sándor, et autres
Publié: (2023)

Improved Total Domination and Total Roman Domination in Unit Disk Graphs
par: Rout, Sasmita, et autres
Publié: (2024)

Hardness and Approximation Schemes for Discrete Packing and Domination
par: Madireddy, Raghunath Reddy, et autres
Publié: (2025)

Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain
par: de Berg, Sarita, et autres
Publié: (2023)

Maximizing the Maximum Degree in Ordered Nearest Neighbor Graphs
par: Ágoston, Péter, et autres
Publié: (2024)

Sublinear Data Structures for Nearest Neighbor in Ultra High Dimensions
par: Herold, Martin G., et autres
Publié: (2025)

Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems
par: Agarwal, Pankaj K., et autres
Publié: (2022)

Dominance for Containment Problems
par: Akram, Waseem, et autres
Publié: (2022)

Memory Optimization for Convex Hull Support Point Queries
par: Greer, Michael
Publié: (2025)

Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams
par: Buchin, Kevin, et autres
Publié: (2026)

Graph-Based Nearest-Neighbor Search without the Spread
par: Giliberti, Jeff, et autres
Publié: (2026)

Partial Domination in Some Geometric Intersection Graphs and Some Complexity Results
par: Dutta, Madhura, et autres
Publié: (2025)

Approximating Convex Hulls via Range Queries
par: Schibler, T., et autres
Publié: (2026)

Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search
par: Spalding-Jamieson, Jack, et autres
Publié: (2025)

Maximizing Weighted Dominance in the Plane
par: Akram, Waseem, et autres
Publié: (2024)

Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs
par: de Berg, Mark, et autres
Publié: (2026)

Query-Efficient Fixpoints of $\ell_p$-Contractions
par: Haslebacher, Sebastian, et autres
Publié: (2025)

Fast Approximation Algorithms for Piercing Boxes by Points
par: Agarwal, Pankaj K., et autres
Publié: (2023)

Dynamic Geometric Connectivity in the Plane with Constant Query Time
par: Chan, Timothy M., et autres
Publié: (2024)

On Planar Straight-Line Dominance Drawings
par: Angelini, Patrizio, et autres
Publié: (2025)

Equichordal Points of Convex Bodies
par: Jang, Leo, et autres
Publié: (2025)

A Coreset for Approximate Furthest-Neighbor Queries in a Simple Polygon
par: de Berg, Mark, et autres
Publié: (2024)

Identifiability of Points and Rigidity of Hypergraphs under Algebraic Constraints
par: Cruickshank, James, et autres
Publié: (2023)

Visibility Queries in Simple Polygons
par: Bhore, Sujoy, et autres
Publié: (2026)

Navigable Graphs for High-Dimensional Nearest Neighbor Search: Constructions and Limits
par: Diwan, Haya, et autres
Publié: (2024)

Point containment algorithms for constructive solid geometry with unbounded primitives
par: Romano, Paul K., et autres
Publié: (2024)

Computing Dominating Sets in Disk Graphs with Centers in Convex Position
par: Tkachenko, Anastasiia, et autres
Publié: (2026)

Top-k Stabbing Interval Queries
par: Akram, Waseem, et autres
Publié: (2024)