Image de couverture de livre

Algorithms for Computing Closest Points for Segments

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Wang, Haitao
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

Tight Bounds on the Number of Closest Pairs in Vertical Slabs
par: Biniaz, Ahmad, et autres
Publié: (2025)

Algorithms for Halfplane Coverage and Related Problems
par: Wang, Haitao, et autres
Publié: (2024)

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

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

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)

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)

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)

Hitting Axis-Parallel Segments with Weighted Points
par: Raman, Rajiv, et autres
Publié: (2026)

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

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

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

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

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

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

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

Exact Subquadratic Algorithm for Many-to-Many Matching on Planar Point Sets with Integer Coordinates
par: Park, Seongbin, et autres
Publié: (2026)

An Algorithm for Fast and Correct Computation of Reeb Spaces for PL Bivariate Fields
par: Chattopadhyay, Amit, et autres
Publié: (2024)

An Algorithmic Solution for Computing Circle Intersection Areas and its Applications to Wireless Communications
par: Librino, Federico, et autres
Publié: (2012)

An Improved FPT Algorithm for Computing the Interleaving Distance between Merge Trees via Path-Preserving Maps
par: P V, Althaf, et autres
Publié: (2026)

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

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

Duality between Lines and Points
par: Saxena, Sanjeev
Publié: (2025)

The Complexity of Geodesic Spanners using Steiner Points
par: de Berg, Sarita, et autres
Publié: (2024)

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)

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

Computing Diverse and Nice Triangulations
par: Gálvez, Waldo, et autres
Publié: (2025)

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

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

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms
par: Depian, Thomas, et autres
Publié: (2025)

FPT Constant Approximation Algorithms for Colorful Sum of Radii
par: Liu, Shuilian, et autres
Publié: (2025)

Improved Approximation Algorithms for Three-Dimensional Bin Packing
par: Kar, Debajyoti, et autres
Publié: (2025)

ETH-Tight Algorithm for Cycle Packing on Unit Disk Graphs
par: An, Shinwoo, et autres
Publié: (2024)

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