Imagen de Portada

Making Quickhull More Like Quicksort: A Simple Randomized Output-Sensitive Convex Hull Algorithm

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Goodrich, Michael T., Kitagawa, Ryuto
Formato:	Preprint
Publicado:	2024
Materias:	Computational Geometry Computational Complexity Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Dynamic Convex Hulls for Simple Paths
por: Brewer, Bruce, et al.
Publicado: (2024)

Approximate Algorithms for Chamfer Distance Under Translation
por: Halevi, Gil, et al.
Publicado: (2026)

Engineering Fully Dynamic Convex Hulls
por: van der Hoog, Ivor, et al.
Publicado: (2026)

A Gap-ETH-Tight Approximation Scheme for Euclidean TSP
por: Kisfaludi-Bak, Sándor, et al.
Publicado: (2020)

A Polynomial Space Lower Bound for Diameter Estimation in Dynamic Streams
por: Khanna, Sanjeev, et al.
Publicado: (2025)

Sensitivity Lower Bounds for Approximaiton Algorithms
por: Fleming, Noah, et al.
Publicado: (2024)

Zip-Tries: Simple Dynamic Data Structures for Strings
por: Eppstein, David, et al.
Publicado: (2025)

Approximating Klee's Measure Problem and a Lower Bound for Union Volume Estimation
por: Bringmann, Karl, et al.
Publicado: (2024)

On connections between k-coloring and Euclidean k-means
por: Aman, Enver, et al.
Publicado: (2024)

Recognizing 2-Layer and Outer $k$-Planar Graphs
por: Kobayashi, Yasuaki, et al.
Publicado: (2024)

Computational Complexities of Folding
por: Eppstein, David
Publicado: (2024)

On Approximating the Dynamic and Discrete Network Flow Problem
por: Manna, Bubai, et al.
Publicado: (2024)

Ideal Membership Problem for Boolean Minority and Dual Discriminator
por: Bharathi, Arpitha P., et al.
Publicado: (2024)

Universal Solvability for Robot Motion Planning on Graphs
por: Dhar, Anubhav, et al.
Publicado: (2025)

Inapproximability of Maximum Diameter Clustering for Few Clusters
por: Fleischmann, Henry, et al.
Publicado: (2023)

Fine-Grained Complexity of Continuous Euclidean k-Center
por: Blank, Lotte, et al.
Publicado: (2026)

Improved Hardness of Approximation for Geometric Bin Packing
por: Ray, Arka, et al.
Publicado: (2023)

Subcoloring of (Unit) Disk Graphs
por: Marin, Malory, et al.
Publicado: (2025)

Beyond Bits: An Introduction to Computation over the Reals
por: Miltzow, Tillmann
Publicado: (2026)

Fast and simple multiplication of bounded twin-width matrices
por: Kozma, László, et al.
Publicado: (2026)

Hardness of Median and Center in the Ulam Metric
por: Fischer, Nick, et al.
Publicado: (2025)

On Approximability of Steiner Tree in $\ell_p$-metrics
por: Fleischmann, Henry, et al.
Publicado: (2023)

Near-Optimal Bounds for Parameterized Euclidean k-means
por: Cohen-Addad, Vincent, et al.
Publicado: (2026)

Almost-Optimal Upper and Lower Bounds for Clustering in Low Dimensional Euclidean Spaces
por: Cohen-Addad, Vincent, et al.
Publicado: (2026)

Tight Universal Bounds for Partially Presorted Pareto Front and Convex Hull
por: van der Hoog, Ivor, et al.
Publicado: (2025)

A Faster Randomized Algorithm for Vertex Cover: An Automated Approach
por: Clinch, Katie, et al.
Publicado: (2025)

Algorithms for Standard-form ILP Problems via Komlós' Discrepancy Setting
por: Gribanov, Dmitry, et al.
Publicado: (2026)

Flip Distance of Triangulations of Convex Polygons / Rotation Distance of Binary Trees is NP-complete
por: Dorfer, Joseph
Publicado: (2026)

The Impossibility of Simultaneous Time and I/O Optimality for The Planar Maxima and Convex Hull Problems
por: Afshani, Peyman, et al.
Publicado: (2026)

Time complexity of the Analyst's Traveling Salesman algorithm
por: Ramirez, Anthony, et al.
Publicado: (2022)

Self-referential instances of the dominating set problem are irreducible
por: Zhou, Guangyan
Publicado: (2026)

Size Minimization For Multi-Output AND-Functions
por: Armbruster, Susanne
Publicado: (2024)

Lower Bounds for Convexity Testing
por: Chen, Xi, et al.
Publicado: (2024)

Certifying Euclidean Sections and Finding Planted Sparse Vectors Beyond the $\sqrt{n}$ Dimension Threshold
por: Guruswami, Venkatesan, et al.
Publicado: (2024)

Parallel Joinable B-Trees in the Fork-Join I/O Model
por: Goodrich, Michael, et al.
Publicado: (2025)

A Simple Proof that Ricochet Robots is PSPACE-Complete
por: Balanza-Martinez, Jose, et al.
Publicado: (2024)

Simple approximation algorithms for Polyamorous Scheduling
por: Biktairov, Yuriy, et al.
Publicado: (2024)

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

More Asymmetry Yields Faster Matrix Multiplication
por: Alman, Josh, et al.
Publicado: (2024)

Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems
por: Ghosh, Mrinalkanti
Publicado: (2025)