:: Library Catalog

Cover Image

Saved in:

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

Similar Items

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

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

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)

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)

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

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

Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
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)

Well-Separated Pairs Decomposition Revisited
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)

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

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

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

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)

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

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

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

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

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

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

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

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

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)

A Combinatorial Proof of Universal Optimality for Computing a Planar Convex Hull
by: van der Hoog, Ivor, et al.
Published: (2025)

Another Simple Proof for the Existence of the Small Witt Design
by: Havlicek, Hans, et al.
Published: (2013)

A Simple Partially Embedded Planarity Test Based on Vertex-Addition
by: Fink, Simon D., et al.
Published: (2024)

SPITE: Simple Polyhedral Intersection Techniques for modified Environments
by: Ashur, Stav, et al.
Published: (2024)

VQhull: a Fast Planar Quickhull
by: Koopman, Thomas, 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)

Ranking and Unranking of the Planar Embeddings of a Planar Graph
by: Di Battista, Giuseppe, et al.
Published: (2024)

Computing Planar Convex Hulls with a Promise
by: Aghamolaei, Sepideh, et al.
Published: (2026)