Image de couverture de livre

Algorithms for Halfplane Coverage and Related Problems

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Wang, Haitao, Xue, Jie
Format:	Preprint
Publié:	2024
Sujets:	Computational Geometry Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On the Line-Separable Unit-Disk Coverage and Related Problems
par: Liu, Gang, et autres
Publié: (2023)

On Line-Separable Weighted Unit-Disk Coverage and Related Problems
par: Liu, Gang, et autres
Publié: (2024)

Improved Algorithms for Distance Selection and Related Problems
par: Wang, Haitao, et autres
Publié: (2023)

Unweighted Geometric Hitting Set for Line-Constrained Disks and Related Problems
par: Liu, Gang, et autres
Publié: (2024)

Algorithms for Computing Closest Points for Segments
par: Wang, Haitao
Publié: (2024)

An Optimal Algorithm for Half-plane Hitting Set
par: Liu, Gang, et autres
Publié: (2025)

Truly Subquadratic Time Algorithms for Diameter and Related Problems in Graphs of Bounded VC-dimension
par: Chan, Timothy M., et autres
Publié: (2025)

An Optimal Algorithm for Shortest Paths in Unweighted Disk Graphs
par: Brewer, Bruce W., et autres
Publié: (2025)

An Improved Algorithm for Shortest Paths in Weighted Unit-Disk Graphs
par: Brewer, Bruce W., et autres
Publié: (2024)

Single-Source Shortest Path Problem in Weighted Disk Graphs
par: An, Shinwoo, et autres
Publié: (2025)

Counting Unit Circular Arc Intersections
par: Wang, Haitao
Publié: (2026)

A Deterministic Partition Tree and Applications
par: Wang, Haitao
Publié: (2025)

Shortest Paths on Convex Polyhedral Surfaces
par: Wang, Haitao
Publié: (2025)

Dynamic Unit-Disk Range Reporting
par: Wang, Haitao, et autres
Publié: (2024)

Maximum Independent Sets in Disk Graphs with Disks in Convex Position
par: Tkachenko, Anastasiia, et autres
Publié: (2026)

Computing Maximum Cliques in Unit Disk Graphs
par: Tkachenko, Anastasiia, et autres
Publié: (2025)

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

Minimum-Weight Half-Plane Hitting Set
par: Liu, Gang, et autres
Publié: (2025)

Faster Algorithms for Reverse Shortest Path in Unit-Disk Graphs and Related Geometric Optimization Problems: Improving the Shrink-and-Bifurcate Technique
par: Chan, Timothy M., et autres
Publié: (2025)

Robust Algorithms for Path and Cycle Problems in Geometric Intersection Graphs
par: Marin, Malory, et autres
Publié: (2025)

An $O(n \log n)$-Time Approximation Scheme for Geometric Many-to-Many Matching
par: Bandyapadhyay, Sayan, et autres
Publié: (2024)

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

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

Sparse Outerstring Graphs Have Logarithmic Treewidth
par: An, Shinwoo, et autres
Publié: (2024)

Enclosing Points with Geometric Objects
par: Chan, Timothy M., et autres
Publié: (2024)

Fast Static and Dynamic Approximation Algorithms for Geometric Optimization Problems: Piercing, Independent Set, Vertex Cover, and Matching
par: Bhore, Sujoy, et autres
Publié: (2024)

Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3
par: Lokshtanov, Daniel, et autres
Publié: (2024)

Dynamic and Streaming Algorithms for Union Volume Estimation
par: Bhore, Sujoy, et autres
Publié: (2026)

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

Algorithms for Distance Problems in Continuous Graphs
par: Cabello, Sergio, et autres
Publié: (2025)

Range Counting Oracles for Geometric Problems
par: Driemel, Anne, et autres
Publié: (2025)

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

Approximation Algorithms for Smallest Intersecting Balls
par: Zheng, Jiaqi, et autres
Publié: (2024)

Online Algorithms for Geometric Independent Set
par: De, Minati, et autres
Publié: (2026)

Even Faster Algorithm for the Chamfer Distance
par: Feng, Ying, et autres
Publié: (2025)

Fast Algorithms for Minimum Homology Basis
par: Dhar, Amritendu, et autres
Publié: (2021)

On Approximating the Weighted Region Problem in Square Tessellations
par: Kakimura, Naonori, et autres
Publié: (2024)

On the Complexity of the Ordered Covering Problem in Distance Geometry
par: Souza, Michael, et autres
Publié: (2025)

Exact Algorithms for Clustered Planarity with Linear Saturators
par: Da Lozzo, Giordano, et autres
Publié: (2024)

New Complexity and Algorithmic Bounds for Minimum Consistent Subsets
par: Banik, Aritra, et autres
Publié: (2024)