Image de couverture de livre

Enclosing Points with Geometric Objects

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Chan, Timothy M., He, Qizheng, 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

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

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)

Charting the Diameter Computation Landscape of Geometric Intersection Graphs in Three Dimensions and Higher
par: Chan, Timothy M., et autres
Publié: (2026)

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

Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams
par: Buchin, Kevin, et autres
Publié: (2026)

Delaunay Triangulations with Predictions
par: Cabello, Sergio, et autres
Publié: (2026)

On Subexponential Parameterized Algorithms for Steiner Tree on Intersection Graphs of Geometric Objects
par: Bhore, Sujoy, et autres
Publié: (2025)

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

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

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

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

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

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

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

Parameterized Geometric Graph Modification with Disk Scaling
par: Fomin, Fedor V., et autres
Publié: (2024)

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

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

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

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

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

Approximation Schemes for Subset TSP and Steiner Tree on Geometric Intersection Graphs
par: Kisfaludi-Bak, Sándor, et autres
Publié: (2026)

Improved Online Hitting Set Algorithms for Structured and Geometric Set Systems
par: Bhore, Sujoy, et autres
Publié: (2026)

Small Independent Sets versus Small Separator in Geometric Intersection Graphs
par: Marin, Malory, et autres
Publié: (2026)

Better Diameter Algorithms for Bounded VC-dimension Graphs and Geometric Intersection Graphs
par: Duraj, Lech, et autres
Publié: (2023)

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

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

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

On the Exponential Growth of Geometric Shapes
par: Almalki, Nada, et autres
Publié: (2023)

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

Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain
par: de Berg, Sarita, et autres
Publié: (2023)

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

Reconstructing Riemannian Metrics From Random Geometric Graphs
par: Huang, Han, et autres
Publié: (2025)

Computing Diameter +1 in Truly Subquadratic Time for Unit-Disk Graphs
par: Chang, Hsien-Chih, et autres
Publié: (2024)

Improved Hardness of Approximation for Geometric Bin Packing
par: Ray, Arka, et autres
Publié: (2023)

Sequential non-determinism in tile self-assembly: a general framework and an application to efficient temperature-1 self-assembly of squares
par: Furcy, David, et autres
Publié: (2024)

Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces
par: Abbasi, Fateme, et autres
Publié: (2023)

Geometric Thickness of Multigraphs is $\exists \mathbb{R}$-complete
par: Förster, Henry, et autres
Publié: (2023)

Simple and Faster Algorithms for Knapsack
par: He, Qizheng, et autres
Publié: (2023)

Coreset for Robust Geometric Median: Eliminating Size Dependency on Outliers
par: Fang, Ziyi, et autres
Publié: (2025)

A dynamic $(1+\varepsilon)$-spanner for disk intersection graphs
par: de Berg, Sarita, et autres
Publié: (2026)