Cover Image

Dynamic Convex Hulls for Simple Paths

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Brewer, Bruce, Brodal, Gerth Stølting, Wang, Haitao
Format:	Preprint
Published:	2024
Subjects:	Computational Geometry Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Deterministic Cache-Oblivious Funnelselect
by: Brodal, Gerth Stølting, et al.
Published: (2024)

Bottom-up Rebalancing Binary Search Trees by Flipping a Coin
by: Brodal, Gerth Stølting
Published: (2024)

An Optimal Algorithm for Shortest Paths in Unweighted Disk Graphs
by: Brewer, Bruce W., et al.
Published: (2025)

An Improved Algorithm for Shortest Paths in Weighted Unit-Disk Graphs
by: Brewer, Bruce W., et al.
Published: (2024)

Partition-based Simple Heaps
by: Brodal, Gerth Stølting, et al.
Published: (2026)

Shortest Paths on Convex Polyhedral Surfaces
by: Wang, Haitao
Published: (2025)

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

Buffered Partially-Persistent External-Memory Search Trees
by: Brodal, Gerth Stølting, et al.
Published: (2025)

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

Making Quickhull More Like Quicksort: A Simple Randomized Output-Sensitive Convex Hull Algorithm
by: Goodrich, Michael T., et al.
Published: (2024)

Maximum Independent Sets in Disk Graphs with Disks in Convex Position
by: Tkachenko, Anastasiia, et al.
Published: (2026)

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

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

Dynamic Unit-Disk Range Reporting
by: Wang, Haitao, et al.
Published: (2024)

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

Algorithms for Computing Closest Points for Segments
by: Wang, Haitao
Published: (2024)

Counting Unit Circular Arc Intersections
by: Wang, Haitao
Published: (2026)

A Deterministic Partition Tree and Applications
by: Wang, Haitao
Published: (2025)

Uncrossed Multiflows and Applications to Disjoint Paths
by: Chekuri, Chandra, et al.
Published: (2025)

Unweighted Geometric Hitting Set for Line-Constrained Disks and Related Problems
by: Liu, Gang, et al.
Published: (2024)

On Line-Separable Weighted Unit-Disk Coverage and Related Problems
by: Liu, Gang, et al.
Published: (2024)

Algorithms for Halfplane Coverage and Related Problems
by: Wang, Haitao, et al.
Published: (2024)

An Optimal Algorithm for Half-plane Hitting Set
by: Liu, Gang, et al.
Published: (2025)

Computing Maximum Cliques in Unit Disk Graphs
by: Tkachenko, Anastasiia, et al.
Published: (2025)

Improved Algorithms for Distance Selection and Related Problems
by: Wang, Haitao, et al.
Published: (2023)

On the Line-Separable Unit-Disk Coverage and Related Problems
by: Liu, Gang, et al.
Published: (2023)

Minimum-Weight Half-Plane Hitting Set
by: Liu, Gang, et al.
Published: (2025)

Online Sorting and Translational Packing of Convex Polygons
by: Aamand, Anders, et al.
Published: (2021)

Simple Grid Polygon Online Exploration Revisited
by: Brock, Maximilian, et al.
Published: (2024)

Simple Construction of Greedy Trees and Greedy Permutations
by: Chubet, Oliver, et al.
Published: (2024)

Shortest Path Separators in Unit Disk Graphs
by: Harb, Elfarouk, et al.
Published: (2024)

Single-Source Shortest Path Problem in Weighted Disk Graphs
by: An, Shinwoo, et al.
Published: (2025)

Continuous Map Matching to Paths under Travel Time Constraints
by: Bosch, Yannick, et al.
Published: (2025)

Robust Algorithms for Path and Cycle Problems in Geometric Intersection Graphs
by: Marin, Malory, et al.
Published: (2025)

Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time
by: Eppstein, David
Published: (2023)

Faster Goal-Oriented Shortest Path Search for Bulk and Incremental Detailed Routing
by: Ahrens, Markus, et al.
Published: (2021)

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

An Improved FPT Algorithm for Computing the Interleaving Distance between Merge Trees via Path-Preserving Maps
by: P V, Althaf, et al.
Published: (2026)

Dynamic and Streaming Algorithms for Union Volume Estimation
by: Bhore, Sujoy, et al.
Published: (2026)