:: Library Catalog

Saved in:

Bibliographic Details
Main Authors:	Ruggerio, Sam, Har-Peled, Sariel
Format:	Preprint
Published:	2026
Subjects:	Computational Geometry
Online Access:	https://arxiv.org/abs/2601.08566
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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)

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)

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

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

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

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

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)

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

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

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)

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)

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

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

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

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

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

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

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

On Small Pair Decompositions for Point Sets
by: Buchin, Kevin, et al.
Published: (2026)

Oracle-Augmented Prophet Inequalities
by: Har-Peled, Sariel, et al.
Published: (2024)

Quickly Avoiding a Random Catastrophe
by: Ashur, Stav, et al.
Published: (2025)

Faster Motion Planning via Restarts
by: Amato, Nancy, et al.
Published: (2025)

Edge Nearest Neighbor in Sampling-Based Motion Planning
by: Ashur, Stav, 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)

FSM Builder: A Tool for Writing Autograded Finite Automata Questions
by: Robson, Eliot Wong, et al.
Published: (2024)

Minimum Partition of Polygons under Width and Cut Constraints
by: Chung, Jaehoon, et al.
Published: (2025)

An Interface Tracking Method with Triangle Edge Cuts
by: Wang, Mengdi, et al.
Published: (2024)

Square Packing with Asymptotically Smallest Waste Only Needs Good Squares
by: Bui, Hong Duc
Published: (2025)

Variable Min-Cut Max-Flow Bounds and Algorithms in Finite Regime
by: Gitik, Rivka, et al.
Published: (2025)

Skeletal Cut Loci on Convex Polyhedra
by: O'Rourke, Joseph, et al.
Published: (2023)

Product Range Search Problem
by: Chubet, Oliver, et al.
Published: (2026)