The following pages link to Sariel Har-Peled (Q247175):
Displaying 50 items.
- (Q194322) (redirect page) (← links)
- Space exploration via proximity search (Q312150) (← links)
- From proximity to utility: a Voronoi partition of Pareto optima (Q331376) (← links)
- New constructions of SSPDs and their applications (Q419372) (← links)
- Approximating the Fréchet distance for realistic curves in near linear time (Q443909) (← links)
- Approximation algorithms for maximum independent set of pseudo-disks (Q452004) (← links)
- Union of random Minkowski sums and network vulnerability analysis (Q471144) (← links)
- Approximating the maximum overlap of polygons under translation (Q527417) (← links)
- Relative \((p,\varepsilon )\)-approximations in geometry (Q633202) (← links)
- Near-linear time approximation algorithms for curve simplification (Q818650) (← links)
- Covering many or few points with unit disks (Q839638) (← links)
- Guarding galleries and terrains (Q845875) (← links)
- On the least median square problem (Q854711) (← links)
- Smaller coresets for \(k\)-median and \(k\)-means clustering (Q866968) (← links)
- How to get close to the median shape (Q870425) (← links)
- Approximate shortest paths and geodesic diameter on a convex polytope in three dimensions (Q1283768) (← links)
- Multicolor combination lemma (Q1305889) (← links)
- An output sensitive algorithm for discrete convex hulls (Q1388138) (← links)
- Optimally cutting a surface into a disk (Q1424316) (← links)
- The one-round Voronoi game (Q1424320) (← links)
- Approximation algorithms for minimum-width annuli and shells (Q1591055) (← links)
- Computing approximate shortest paths on convex polytopes (Q1601017) (← links)
- Robust proximity search for balls using sublinear space (Q1702130) (← links)
- High-dimensional shape fitting in linear time (Q1762950) (← links)
- Fast algorithms for computing the smallest \(k\)-enclosing circle (Q1763156) (← links)
- How fast is the \(k\)-means method? (Q1763158) (← links)
- Geographic quorum system approximations (Q1774150) (← links)
- Reporting intersecting pairs of convex polytopes in two and three dimensions (Q1862123) (← links)
- New similarity measures between polylines with applications to morphing and polygon sweeping (Q1864114) (← links)
- Clustering motion (Q1889914) (← links)
- On separating points by lines (Q1985301) (← links)
- Active-learning a convex body in low dimensions (Q2032355) (← links)
- Stabbing pairwise intersecting disks by five points (Q2032723) (← links)
- Smallest \(k\)-enclosing rectangle revisited (Q2046452) (← links)
- The maximum-level vertex in an arrangement of lines (Q2117347) (← links)
- Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location (Q2189742) (← links)
- A spanner for the day after (Q2223618) (← links)
- On the complexity of randomly weighted multiplicative Voronoi diagrams (Q2349856) (← links)
- Finding a guard that sees most and a shop that sells most (Q2369935) (← links)
- Convex hulls under uncertainty (Q2408916) (← links)
- Conflict-free coloring of points and simple regions in the plane (Q2486862) (← links)
- Approximating \(k\)-hop minimum-spanning trees (Q2488210) (← links)
- On the Fermat-Weber center of a convex object (Q2571212) (← links)
- Few cuts meet many point sets (Q2696278) (← links)
- Taking a Walk in a Planar Arrangement (Q2706112) (← links)
- (Q2708236) (← links)
- Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions (Q2709794) (← links)
- (Q2721992) (← links)
- (Q2768272) (← links)
- (Q2768285) (← links)
