Saved in:
| Main Authors: | Dullerud, Jonathan E., Har-Peled, Sariel |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2505.06090 |
| 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)
by: Har-Peled, Sariel
Published: (2025)
The Complexity of One or Many Faces in the Overlay of Many Arrangements
by: Har-Peled, Sariel
Published: (2025)
by: Har-Peled, Sariel
Published: (2025)
An Output Sensitive Algorithm for Discrete Convex Hulls
by: Har-Peled, Sariel
Published: (2026)
by: Har-Peled, Sariel
Published: (2026)
Separator for $c$-Packed Segments and Curves
by: Har-Peled, Sariel
Published: (2026)
by: Har-Peled, Sariel
Published: (2026)
A Simple Proof of the Existence of a Planar Separator
by: Har-Peled, Sariel
Published: (2011)
by: Har-Peled, Sariel
Published: (2011)
How to Get Close to the Median Shape
by: Har-Peled, Sariel
Published: (2026)
by: Har-Peled, Sariel
Published: (2026)
The Prophet and the Voronoi Diagram
by: Har-Peled, Sariel
Published: (2026)
by: Har-Peled, Sariel
Published: (2026)
Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
by: Barequet, Gill, et al.
Published: (2025)
by: Barequet, Gill, et al.
Published: (2025)
Bifurcation: How to Explore a Tree
by: Har-Peled, Sariel
Published: (2025)
by: Har-Peled, Sariel
Published: (2025)
Approximately: Independence Implies Vertex Cover
by: Har-Peled, Sariel
Published: (2023)
by: Har-Peled, Sariel
Published: (2023)
Polygon Containment and Translational Min-Hausdorff-Distance between Segment Sets are 3SUM-Hard
by: Barequet, Gill, et al.
Published: (2025)
by: Barequet, Gill, et al.
Published: (2025)
Approximating Densest Subgraph in Geometric Intersection Graphs
by: Har-Peled, Sariel, et al.
Published: (2024)
by: Har-Peled, Sariel, et al.
Published: (2024)
How Packed Is It, Really?
by: Har-Peled, Sariel, et al.
Published: (2021)
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)
by: Har-Peled, Sariel, et al.
Published: (2014)
Near-Optimal Euclidean Locality-Sensitive Orderings
by: Gao, Zhimeng, et al.
Published: (2023)
by: Gao, Zhimeng, et al.
Published: (2023)
In the Search for Good Neck Cuts
by: Ruggerio, Sam, et al.
Published: (2026)
by: Ruggerio, Sam, et al.
Published: (2026)
Proof of Dudley's Convex Approximation
by: Har-Peled, Sariel, et al.
Published: (2019)
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)
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)
by: Har-Peled, Sariel, et al.
Published: (2025)
New Constructions of SSPDs and their Applications
by: Abam, Mohammad A., et al.
Published: (2025)
by: Abam, Mohammad A., et al.
Published: (2025)
No-dimensional Tverberg Partitions Revisited
by: Har-Peled, Sariel, et al.
Published: (2023)
by: Har-Peled, Sariel, et al.
Published: (2023)
Dependable Spanners via Unreliable Edges
by: Har-Peled, Sariel, et al.
Published: (2024)
by: Har-Peled, Sariel, et al.
Published: (2024)
Fast Approximation Algorithms for Piercing Boxes by Points
by: Agarwal, Pankaj K., et al.
Published: (2023)
by: Agarwal, Pankaj K., et al.
Published: (2023)
Well-Separated Pairs Decomposition Revisited
by: Har-Peled, Sariel, et al.
Published: (2025)
by: Har-Peled, Sariel, et al.
Published: (2025)
The Fréchet Distance Unleashed: Approximating a Dog with a Frog
by: Har-Peled, Sariel, et al.
Published: (2024)
by: Har-Peled, Sariel, et al.
Published: (2024)
Graph-Based Nearest-Neighbor Search without the Spread
by: Giliberti, Jeff, et al.
Published: (2026)
by: Giliberti, Jeff, et al.
Published: (2026)
On Small Pair Decompositions for Point Sets
by: Buchin, Kevin, et al.
Published: (2026)
by: Buchin, Kevin, et al.
Published: (2026)
An Easy Proof of a Weak Version of Chernoff inequality
by: Har-Peled, Sariel
Published: (2025)
by: Har-Peled, Sariel
Published: (2025)
Quickly Avoiding a Random Catastrophe
by: Ashur, Stav, et al.
Published: (2025)
by: Ashur, Stav, et al.
Published: (2025)
Oracle-Augmented Prophet Inequalities
by: Har-Peled, Sariel, et al.
Published: (2024)
by: Har-Peled, Sariel, et al.
Published: (2024)
Faster Motion Planning via Restarts
by: Amato, Nancy, et al.
Published: (2025)
by: Amato, Nancy, et al.
Published: (2025)
Edge Nearest Neighbor in Sampling-Based Motion Planning
by: Ashur, Stav, et al.
Published: (2025)
by: Ashur, Stav, et al.
Published: (2025)
Report on Nearest Dominating Point Queries
by: Mishra, Naman, et al.
Published: (2025)
by: Mishra, Naman, et al.
Published: (2025)
Judíos, indios y el mito del crimen ritual. El caso de Chamula, Chiapas, 1868
by: Misgav Har-Peled
Published: (2015)
by: Misgav Har-Peled
Published: (2015)
Manifold k-NN: Accelerated k-NN Queries for Manifold Point Clouds
by: Wang, Pengfei, et al.
Published: (2026)
by: Wang, Pengfei, et al.
Published: (2026)
Undecidability of Translational Tiling of the Plane with Orthogonally Convex Polyominoes
by: Yang, Chao, et al.
Published: (2025)
by: Yang, Chao, et al.
Published: (2025)
Orthogonal dissection into few rectangles
by: Eppstein, David
Published: (2022)
by: Eppstein, David
Published: (2022)
Parameterized Approaches to Orthogonal Compaction
by: Didimo, Walter, et al.
Published: (2022)
by: Didimo, Walter, et al.
Published: (2022)
Online Packing of Orthogonal Polygons
by: Gerlach, Tim, et al.
Published: (2026)
by: Gerlach, Tim, et al.
Published: (2026)
Covering Simple Orthogonal Polygons with Rectangles
by: Roy, Aniket Basu
Published: (2024)
by: Roy, Aniket Basu
Published: (2024)
Similar Items
-
A Practical Approach for Computing the Diameter of a Point Set
by: Har-Peled, Sariel
Published: (2025) -
The Complexity of One or Many Faces in the Overlay of Many Arrangements
by: Har-Peled, Sariel
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) -
A Simple Proof of the Existence of a Planar Separator
by: Har-Peled, Sariel
Published: (2011)