Image de couverture de livre

Approximating Convex Hulls via Range Queries

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Schibler, T., Xue, J., Zhu, J.
Format:	Preprint
Publié:	2026
Sujets:	Computational Geometry
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Approximation and Hardness of Polychromatic TSP
par: Schibler, Thomas, et autres
Publié: (2025)

Embedding Graphs as Euclidean kNN-Graphs
par: Schibler, T., et autres
Publié: (2025)

Private Approximations of a Convex Hull in Low Dimensions
par: Gao, Yue, et autres
Publié: (2020)

Instance-Optimal Imprecise Convex Hull
par: de Berg, Sarita, et autres
Publié: (2025)

Practical Insertion-Only Convex Hull
par: van der Hoog, Ivor, et autres
Publié: (2025)

Preprocessing Disks for Convex Hulls, Revisited
par: Löffler, Maarten, et autres
Publié: (2025)

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

An Output Sensitive Algorithm for Discrete Convex Hulls
par: Har-Peled, Sariel
Publié: (2026)

Computing Planar Convex Hulls with a Promise
par: Aghamolaei, Sepideh, et autres
Publié: (2026)

Mathematical Programming Algorithms for Convex Hull Approximation with a Hyperplane Budget
par: Barbato, Michele, et autres
Publié: (2024)

Dynamic 3D Convex Hulls Revisited and Applications
par: Wang, Haitao
Publié: (2026)

Engineering Fully Dynamic Convex Hulls
par: van der Hoog, Ivor, et autres
Publié: (2026)

Dynamic Convex Hulls for Simple Paths
par: Brewer, Bruce, et autres
Publié: (2024)

Fast Area-Weighted Peeling of Convex Hulls for Outlier Detection
par: Sridhar, Vinesh, et autres
Publié: (2024)

Parameterized Approximation of Rectangle Stabbing
par: Chu, Huairui, et autres
Publié: (2026)

A Combinatorial Proof of Universal Optimality for Computing a Planar Convex Hull
par: van der Hoog, Ivor, et autres
Publié: (2025)

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

Convex Hulls of Dragon Curves
par: Wen, Fan
Publié: (2022)

Tight Universal Bounds for Partially Presorted Pareto Front and Convex Hull
par: van der Hoog, Ivor, et autres
Publié: (2025)

Convex Hull 3D Filtering with GPU Ray Tracing and Tensor Cores
par: Carrasco, Roberto, et autres
Publié: (2026)

Proof of Dudley's Convex Approximation
par: Har-Peled, Sariel, et autres
Publié: (2019)

Estimating the Convex Hull of the Image of a Set with Smooth Boundary: Error Bounds and Applications
par: Lew, Thomas, et autres
Publié: (2023)

Approximation Depth of Convex Polytopes
par: Bakaev, Egor, et autres
Publié: (2025)

Quantum Combine and Conquer and Its Applications to Sublinear Quantum Convex Hull and Maxima Set Construction
par: Fukuzawa, Shion, et autres
Publié: (2025)

The Impossibility of Simultaneous Time and I/O Optimality for The Planar Maxima and Convex Hull Problems
par: Afshani, Peyman, et autres
Publié: (2026)

Computing Largest Subsets of Points Whose Convex Hulls have Bounded Area and Diameter
par: Picarella, Gianmarco, et autres
Publié: (2025)

Optimal Parallel Algorithms for Convex Hulls in 2D and 3D under Noisy Primitive Operations
par: Goodrich, Michael T., et autres
Publié: (2025)

Separating Geometric Data with Minimum Cost: Two Disjoint Convex Hulls
par: Bigham, Bahram Sadeghi
Publié: (2021)

Convex Hull Volumes in Hyperbolic 3-Space
par: MacMahon, Cameron
Publié: (2026)

Making Quickhull More Like Quicksort: A Simple Randomized Output-Sensitive Convex Hull Algorithm
par: Goodrich, Michael T., et autres
Publié: (2024)

Peeling Rotten Potatoes for a Faster Approximation of Convex Cover
par: Filtser, Omrit, et autres
Publié: (2026)

Bi-Halfspace and Convex Hull Theorems for Translating Solitons
par: Chini, Francesco, et autres
Publié: (2018)

Constant Workspace Algorithms for Computing Relative Hulls in the Plane
par: Chhabra, Himanshu, et autres
Publié: (2024)

Computing Convex Hulls of Trajectories
par: Ciripoi, Daniel, et autres
Publié: (2018)

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

VisACD: Visibility-Based GPU-Accelerated Approximate Convex Decomposition
par: Fokin, Egor, et autres
Publié: (2026)

Space-Efficient Approximate Spherical Range Counting in High Dimensions
par: Kalavas, Andreas, et autres
Publié: (2026)

Data Structures for Range Sorted Consecutive Occurrence Queries
par: Akram, Waseem, et autres
Publié: (2024)

Efficient Cover Construction for Ball Mapper via Accelerated Range Queries
par: Bulauan, Jay-Anne, et autres
Publié: (2026)

Approximating Robot Configuration Spaces with few Convex Sets using Clique Covers of Visibility Graphs
par: Werner, Peter, et autres
Publié: (2023)