Cover Image

Space-Efficient Approximate Spherical Range Counting in High Dimensions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kalavas, Andreas, Psarros, Ioannis
Format:	Preprint
Published:	2026
Subjects:	Computational Geometry
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Query-Driven Approach to Space-Efficient Range Searching
by: Fotakis, Dimitris, et al.
Published: (2025)

Fast Approximations and Coresets for (k, l)-Median under Dynamic Time Warping
by: Conradi, Jacobus, et al.
Published: (2023)

Foam: A Tool for Spherical Approximation of Robot Geometry
by: Coumar, Sai, et al.
Published: (2025)

Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
by: Barequet, Gill, et al.
Published: (2025)

Semialgebraic Range Stabbing, Ray Shooting, and Intersection Counting in the Plane
by: Chan, Timothy M., et al.
Published: (2024)

Efficiently Approximating Spread Dimension with High Confidence
by: Dunne, Kevin
Published: (2024)

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

Approximating Gromov-Hausdorff Distance in Euclidean Space
by: Majhi, Sushovan, et al.
Published: (2019)

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

Stability and Approximations for Decorated Reeb Spaces
by: Curry, Justin, et al.
Published: (2023)

Spherical Geometrical Bases of Spherical Origami
by: Yoshino, Takashi
Published: (2026)

Neural Approximation of Generalized Voronoi Diagrams
by: Rigas, Panagiotis, et al.
Published: (2026)

Cayley Configuration Spaces of a Common Class of Mechanisms in Two Dimensions
by: Sitharam, Meera, et al.
Published: (2011)

Dimension-Free Parameterized Approximation Schemes for Hybrid Clustering
by: Gadekar, Ameet, et al.
Published: (2025)

Efficient Many-To-Many Matching of Points with Demands in One Dimension
by: Rajabi-Alni, Fatemeh, et al.
Published: (2019)

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

Minimal Arrangements of Spherical Geodesics
by: Viglietta, Giovanni
Published: (2023)

On the Reduction of the Spherical Point-in-Polygon Problem for Antipode-Excluding Spherical Polygons
by: Li, Ziqiang, et al.
Published: (2023)

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

Private Approximations of a Convex Hull in Low Dimensions
by: Gao, Yue, et al.
Published: (2020)

Spherical Density-Equalizing Map for Genus-0 Closed Surfaces
by: Lyu, Zhiyuan, et al.
Published: (2024)

Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects
by: Acharya, Pritam, et al.
Published: (2024)

Approximating Robot Configuration Spaces with few Convex Sets using Clique Covers of Visibility Graphs
by: Werner, Peter, et al.
Published: (2023)

Counting Triangulations of Fixed Cardinal Degrees
by: Chambers, Erin, et al.
Published: (2025)

Cellular Learning: Scattered Data Regression in High Dimensions via Voronoi Cells
by: Sastry, Shankar Prasad
Published: (2025)

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

Product Range Search Problem
by: Chubet, Oliver, et al.
Published: (2026)

On Efficient Approximation of the Maximum Distance to A Point Over an Intersection of Balls
by: Costandin, Beniamin, et al.
Published: (2024)

Counting Number of Triangulations of Point Sets: Reinterpreting and Generalizing the Triangulation Polynomials
by: Bui, Hong Duc
Published: (2025)

Approximating the Directed Hausdorff Distance
by: Chubet, Oliver A., et al.
Published: (2025)

Approximation and Hardness of Polychromatic TSP
by: Schibler, Thomas, et al.
Published: (2025)

Proof of Dudley's Convex Approximation
by: Har-Peled, Sariel, et al.
Published: (2019)

$L_1$-distortion of Earth Mover Distances and Transportation Cost Spaces on High Dimensional Grids
by: Gartland, Chris, et al.
Published: (2026)

On the Doubling Dimension and the Perimeter of Geodesically Convex Sets in Fat Polygons
by: de Berg, Mark, et al.
Published: (2026)

Nearly-Tight Bounds for Vertical Decomposition in Three and Four Dimensions
by: Agarwal, Pankaj K., et al.
Published: (2026)

Approximation Schemes and Structural Barriers for the Two-Dimensional Knapsack Problem with Rotations
by: Kar, Debajyoti, et al.
Published: (2026)

Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces
by: Abbasi, Fateme, et al.
Published: (2023)

A Polynomial-Time Algorithm for Computing the Exact Convex Hull in High-Dimensional Spaces
by: Zhuang, Qianwei
Published: (2025)

Approximation Depth of Convex Polytopes
by: Bakaev, Egor, et al.
Published: (2025)

Efficient Neighbourhood Search in 3D Point Clouds Through Space-Filling Curves and Linear Octrees
by: Viñambres, Pablo D., et al.
Published: (2026)