Cover Image

Net and Prune: A Linear Time Algorithm for Euclidean Distance Problems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Har-Peled, Sariel, Raichel, Banjamin
Format:	Preprint
Published:	2014
Subjects:	Computational Geometry
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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

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)

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)

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)

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)

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

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)

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)

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)

Fréchet Edit Distance
by: Fox, Emily, et al.
Published: (2024)

Preprocessing Disks for Convex Hulls, Revisited
by: Löffler, Maarten, et al.
Published: (2025)

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

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

Approximating Gromov-Hausdorff Distance in Euclidean Space
by: Majhi, Sushovan, et al.
Published: (2019)

Linear-Time $(1+\varepsilon)$-Approximation Algorithms for Two-Line-Center Problems
by: Chung, Chaeyoon, et al.
Published: (2026)

Algorithms for Euclidean Distance Matrix Completion: Exploiting Proximity to Triviality
by: Fomin, Fedor V., et al.
Published: (2026)

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

The Euclidean $k$-Matching Problem is NP-hard
by: Díaz-Báñez, José-Miguel, et al.
Published: (2025)

Improved Algorithms for Distance Selection and Related Problems
by: Wang, Haitao, et al.
Published: (2023)

Improved Wake-Up Time For Euclidean Freeze-Tag Problem
by: Alipour, Sharareh, et al.
Published: (2025)

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation
by: Greenhut, Daniel, et al.
Published: (2025)