Cover Image

On Small Pair Decompositions for Point Sets

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Buchin, Kevin, Conradi, Jacobus, Har-Peled, Sariel, Kalb, Antonia, Lahiri, Abhiruk, Plätz, Lukas, Rehs, Carolin, Wong, Sampson
Format:	Preprint
Published:	2026
Subjects:	Computational Geometry
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Practical Approach for Computing the Diameter of a Point Set
by: Har-Peled, Sariel
Published: (2025)

Computing Oriented Spanners and their Dilation
by: Buchin, Kevin, et al.
Published: (2024)

Oriented Spanners
by: Buchin, Kevin, et al.
Published: (2023)

Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
by: Barequet, Gill, et al.
Published: (2025)

Well-Separated Pairs Decomposition Revisited
by: Har-Peled, Sariel, et al.
Published: (2025)

An Output Sensitive Algorithm for Discrete Convex Hulls
by: Har-Peled, Sariel
Published: (2026)

Separator for $c$-Packed Segments and Curves
by: Har-Peled, Sariel
Published: (2026)

How to Get Close to the Median Shape
by: Har-Peled, Sariel
Published: (2026)

The Prophet and the Voronoi Diagram
by: Har-Peled, Sariel
Published: (2026)

The Complexity of One or Many Faces in the Overlay of Many Arrangements
by: Har-Peled, Sariel
Published: (2025)

A Simple Proof of the Existence of a Planar Separator
by: Har-Peled, Sariel
Published: (2011)

Geometric spanners of bounded tree-width
by: Buchin, Kevin, et al.
Published: (2024)

Polygon Containment and Translational Min-Hausdorff-Distance between Segment Sets are 3SUM-Hard
by: Barequet, Gill, et al.
Published: (2025)

Approximately: Independence Implies Vertex Cover
by: Har-Peled, Sariel
Published: (2023)

Bifurcation: How to Explore a Tree
by: Har-Peled, Sariel
Published: (2025)

Algorithms and Lower Bounds for the Maximum Overlap of Two Polygons Under Translation
by: Abrahamsen, Mikkel, et al.
Published: (2025)

Orthogonal Emptiness Queries for Random Points
by: Dullerud, Jonathan E., et al.
Published: (2025)

In the Search for Good Neck Cuts
by: Ruggerio, Sam, et al.
Published: (2026)

Approximating Densest Subgraph in Geometric Intersection Graphs
by: Har-Peled, Sariel, et al.
Published: (2024)

How Packed Is It, Really?
by: Har-Peled, Sariel, et al.
Published: (2021)

Net and Prune: A Linear Time Algorithm for Euclidean Distance Problems
by: Har-Peled, Sariel, et al.
Published: (2014)

Near-Optimal Euclidean Locality-Sensitive Orderings
by: Gao, Zhimeng, et al.
Published: (2023)

Proof of Dudley's Convex Approximation
by: Har-Peled, Sariel, et al.
Published: (2019)

The Road to the Closest Point is Paved by Good Neighbors
by: Har-Peled, Sariel, et al.
Published: (2025)

Improving the average dilation of a metric graph by adding edges
by: Har-Peled, Sariel, et al.
Published: (2025)

No-dimensional Tverberg Partitions Revisited
by: Har-Peled, Sariel, et al.
Published: (2023)

New Constructions of SSPDs and their Applications
by: Abam, Mohammad A., et al.
Published: (2025)

Dependable Spanners via Unreliable Edges
by: Har-Peled, Sariel, et al.
Published: (2024)

Bicriteria approximation for minimum dilation graph augmentation
by: Buchin, Kevin, et al.
Published: (2024)

Fast Approximation Algorithms for Piercing Boxes by Points
by: Agarwal, Pankaj K., et al.
Published: (2023)

A Constant-Factor Approximation for Continuous Dynamic Time Warping in 2D
by: Buchin, Kevin, et al.
Published: (2026)

Fundamentals of Computing Continuous Dynamic Time Warping in 2D under Different Norms
by: Buchin, Kevin, et al.
Published: (2025)

The Fréchet Distance Unleashed: Approximating a Dog with a Frog
by: Har-Peled, Sariel, et al.
Published: (2024)

Faster Fréchet Distance under Transformations
by: Buchin, Kevin, et al.
Published: (2025)

Compatible Triangulations of Simple Polygons
by: Afshani, Peyman, et al.
Published: (2026)

Graph-Based Nearest-Neighbor Search without the Spread
by: Giliberti, Jeff, et al.
Published: (2026)

Map-Matching Queries under Fréchet Distance on Low-Density Spanners
by: Buchin, Kevin, et al.
Published: (2024)

Finding Complex Patterns in Trajectory Data via Geometric Set Cover
by: Conradi, Jacobus, et al.
Published: (2023)

Property Testing of Curve Similarity
by: Afshani, Peyman, et al.
Published: (2025)

An Easy Proof of a Weak Version of Chernoff inequality
by: Har-Peled, Sariel
Published: (2025)