- Approximate Distance Queries in Sparse Graphs Rachit Agarwal, P. Brighten Godfrey and Sariel Har-Peled
- Approximate Nearest Neighbor Search for Low Dimensional Queries
- New Constructions of SSPDs and their Applications Mohammad A. Abam
- Approximating the Frechet Distance for Realistic Curves in Near Linear Time
- Maximum Margin Coresets for Active and Noise Tolerant Learning
- Introduction Results Bibliography Coresets for Discrete Integration and Clustering
- Approximate Clustering via Core-Sets Mihai Badoiu Sariel Har-Peled Piotr Indyk
- A Practical Approach for Computing the Diameter of a Sariel Har-Peled
- The Euclidean Orienteering Problem Revisited Sariel Har-Peled
- How to Get Close to the Median Shape Sariel Har-Peled
- How to Get Close to the Median Sariel Har-Peled
- Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
- On the Fermat-Weber Center of a Convex Object Sariel Har-Peled
- Sariel Har-Peled, UIUC Shakhar Smorodinsky, Tel-Aviv University
- Generalization Bounds for the Area Under the ROC Shivani Agarwal
- How Fast is the k-means Method? Sariel Har-Peled
- Approximating k-Hop Minimum-Spanning Trees Ernst Althaus
- Fast Algorithms for Computing the Smallest k-Enclosing Circle
- Optimally Cutting a Surface into a Disk Jeff Erickson
- Approximate Shape fitting via Linearization Sariel Har-Peled
- New Similarity Measures between Polylines with Applications to Morphing and Polygon Sweeping
- Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
- Geometric Approximation Algorithms Randomized Algorithms for
- Covering by translated intervals is NP-Hard Chandra Chekuri
- Low Rank Matrix Approximation in Linear Time Sariel Har-Peled
- Online Point Location in Planar Arrangements and Its Applications
- Routing with a Clue Yehuda Afek Anat Bremler-Barr Sariel Har-Peled
- TEL-AVIV UNIVERSITY RAYMOND AND BEVERLY SACKLER
- Taking a Walk in a Planar Arrangement
- Approximating Extent Measures of Points Pankaj K. Agarwal y Sariel Har-Peled z Kasturi R. Varadarajan x
- A Replacement for Voronoi Diagrams of Near Linear Sariel Har-Peled y
- No Visa, No Cry Sariel Har-Peled
- On Conflict-Free Coloring of Points and Simple Regions in the Plane
- How to Get Close to the Median Shape Sariel Har-Peled
- Geometric Approximation via Coresets # Pankaj K. Agarwal + Sariel HarPeled # Kasturi R. Varadarajan
- Range Medians Sariel HarPeled # S. Muthukrishnan +
- Embeddings of Surfaces, Curves, and Moving Points in Euclidean Space #
- Coresets for Discrete Integration and Clustering # Sariel Har-Peled +
- Robust Shape Fitting via Peeling and Grating Coresets Pankaj K. Agarwal
- Approximate Distance Queries in Sparse Graphs Rachit Agarwal, P. Brighten Godfrey and Sariel HarPeled
- Taking a Walk in a Planar Arrangement Sariel Har-Peled
- Coresets for Discrete Integration and Clustering Sariel Har-Peled
- Geometric Shape Approximation via Linearization Sariel Har-Peled Kasturi R. Varadarajan y
- Bibliography [Aga91a] P.K. Agarwal. Geometric partitioning and its applications. In J.E. Goodman,
- Fly Cheaply: On the Minimum FuelConsumption Alon Efrat \Lambda Sariel HarPeled y
- Carnival of Samplings: Nets, Approximations, Relative and Sensitive
- The OneRound Voronoi Game OTFRIED CHEONG
- High-Dimensional Shape Fitting in Linear Time Sariel Har-Peled y
- Geometric Approximation Algorithms Randomized Algorithms for
- On the Least Median Square Problem Je Erickson y Sariel Har-Peled z David M. Mount x
- Near-Linear Time Approximation Algorithms for Curve Simplification
- A TimeOptimal Delaunay Refinement Algorithm in Two Dimensions #
- Jaywalking your Dog --The Frechet Distance with Shortcuts for Realistic Curves with Noise #
- Geographic Quorum System Approximations Paz Carmi # Shlomi Dolev + Sariel HarPeled # Matthew J. Katz
- A Replacement for Voronoi Diagrams of Near Linear Sariel Har-Peled
- An Output Sensitive Algorithm for Discrete Convex Hulls \Lambda Sariel HarPeled y
- Approximate Nearest Neighbor Search for Low Dimensional Queries #
- Penetration Depth of Two Convex Polytopes in 3D Pankaj K. Agarwal y Leonidas J. Guibas z Sariel Har-Peled x
- Hausdorff Distance under Translation for Points, Disks, Pankaj K. Agarwal
- Carnival of Samplings: Nets, Approximations, Relative and Sensitive
- Results on kSets and jFacets via Continuous Motion \Lambda Artur Andrzejak
- Robust Shape Fitting via Peeling and Grating Coresets # Pankaj K. Agarwal + Sariel HarPeled # Hai Yu
- Staying in the Middle: Exact and Approximate Medians for Moving Points
- Approximation Algorithms for Maximum Independent Set of PseudoDisks #
- Optimally Cutting a Surface into a Disk Je Erickson y Sariel Har-Peled z
- Geometric Preliminaries In this chapter, we present several technical results that will be used later in the thesis.
- Taking a Walk in a Planar Arrangement
- Coresets for k-Means and k-Median Clustering and their Applications
- Coresets for k-Means and k-Median Clustering and their Applications
- Efficient Algorithms for Shared Camera Control Sariel HarPeled + Vladlen Koltun # Dezhen Song Ken Goldberg
- Constructing Approximate Shortest Path Maps in Three Dimensions #
- On ConflictFree Coloring of Points and Simple Regions in the Plane #
- Weighted Geometric Set Cover Problems Revisited # Sariel HarPeled + Mira Lee #
- Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions \Lambda
- On Approximating the Depth and Related Problems Boris Aronov
- Clustering Motion Sariel Har-Peled
- Introduction Results Conclusions Embeddings of
- High-Dimensional Shape Fitting in Linear Time Sariel Har-Peled
- How to Get Close to the Median Shape # Sariel HarPeled +
- Introduction Given a finite collection S of geometric surfaces, such as hyperplanes, in IR d , the arrange
- Maintaining Approximate Extent Measures of Moving Pankaj K. Agarwal
- A Comment on Pseudo-Triangulation in Three Sariel Har-Peled
- Jaywalking your Dog The Frechet Distance with Shortcuts for Realistic Curves with Noise
- No Coreset, No Cry Sariel Har-Peled
- Geometric Approximation via Coresets Pankaj K. Agarwal
- Covering by translated intervals is NP-Hard Chandra Chekuri # Sariel Har-Peled +
- Computing Approximate Shortest Paths on Convex Polytopes \Lambda
- Approximating the Frechet Distance for Realistic Curves in Near Linear Time #
- Two randomized incramental algorithms for planar arrangements, with a twist
- Some Variants of Polygon Containment and Minimum Hausdorff Distance under Translation are
- Taking a Walk in a Planar Arrangement Sariel Har-Peled y
- Approximating Shortest Paths on a Convex Polytope in Three Dimensions \Lambda
- Generalization Bounds for the Area Under the ROC Shivani Agarwal + Thore Graepel # Sariel HarPeled Ralf Herbrich
- Low Rank Matrix Approximation in Linear Time Sariel HarPeled #
- On Approximating the Depth and Related Problems # Boris Aronov + Sariel HarPeled #
- Constructing Cuttings in Theory and 8.1 Introduction
- On the Height of Arrangement Sariel HarPeled \Lambda
- A Note of Fractional Independent Segments Sariel Har-Peled
- Computing Approximate Shortest Paths on Convex Polytopes Pankaj K. Agarwal
- Approximating Spanning Trees with Low Crossing Sariel Har-Peled
- Constructing Approximate Shortest Path Maps in Three Sariel Har-Peled
- How to Get Close to the Median Shape Sariel Har-Peled
- On the Expected Complexity of Random Convex Hulls \Lambda Sariel HarPeled y
- Projective Clustering in High Dimensions using Sariel Har-Peled Kasturi R. Varadarajan y
- STARTree: An Efficient SelfAdjusting Index for Moving Cecilia M. Procopiuc y Pankaj K. Agarwal z Sariel HarPeled x
- Online Zone Construction in Arrangements of Lines in the Plane \Lambda
- How Fast is the kmeans Method? # Sariel HarPeled + Bardia Sadri #
- No Visa, No Cry Sariel Har-Peled
- The Euclidean Orienteering Problem Revisited # Ke Chen + Sariel HarPeled #
- Fast Algorithms for Computing the Smallest kEnclosing Circle #
- NSF CAREER Proposal: Approximation Algorithms for Geometric
- Fast Construction of Nets in LowDimensional Metrics and Their Applications
- Staying in the Middle: Exact and Approximate Medians 2 for Moving Points
- Routing with a Clue Yehuda Afek Anat Bremler-Barr Sariel Har-Peled
- On the FermatWeber Center of a Convex Object Paz Carmi # Sariel HarPeled + Matthew J. Katz #
- Approximate ShortestPath and Geodesic Diameter on Convex Polytopes in Three Dimensions \Lambda
- Smaller Coresets for kMedian and kMeans Clustering # Sariel HarPeled + Akash Kushal #
- Online Point Location in Planar Arrangements and Its Applications
- Relative (p, #)Approximations in Geometry # Sariel HarPeled + Micha Sharir #
- Approximating the Frechet Distance for Realistic Curves in Near Linear Time
- Shape Fitting with Outliers Sariel Har-Peled y Yusu Wang z
- Near-Linear Time Approximation Algorithms for Curve Simpli cation
- Occlusion Culling for Fast Walkthrough in Urban Areas Yusu Wang Pankaj K. Agarwal y Sariel HarPeled z
- Approximate Approximate
- Weighted Geometric Set Cover Problems Revisited Sariel Har-Peled
- Approximating Extent Measures of Points Pankaj K. Agarwal
- How to Get Close to the Median Shape Sariel Har-Peled
- Relative -Approximations in Geometry Sariel Har-Peled
- Smaller Coresets for k-Median and k-Means Clustering Sariel Har-Peled
- A Simple Proof of the Existence of a Planar Separator Sariel Har-Peledx
- Constructing Approximate Shortest 4.1 Introduction
- Approximating Spanning Trees with Low Crossing Sariel HarPeled #
- No Coreset, No Cry # Sariel HarPeled +
- Maintaining Approximate Extent Measures of Moving Pankaj K. Agarwal y Sariel Har-Peled z
- A Uniform Convergence Bound for the Area Under the Shivani Agarwal # Sariel HarPeled + Dan Roth #
- Clustering Motion Sariel Har-Peled y
- Embeddings of Surfaces, Curves, and Moving Points in Euclidean Space
- Computing Approximate Minimum Volume Bounding Boxes
- Morphing between Polylines Alon Efrat Sariel HarPeled \Lambda Leonidas J. Guibas T. M. Murali y
- Approximate Clustering via CoreSets Mihai B adoiu Sariel HarPeled + Piotr Indyk #
- On generalization bounds, projection pro le, and margin distribution
- Being Fat and Friendly is Not Enough Sariel Har-Peled
- Relative (p, )-Approximations in Geometry Sariel Har-Peled
- Efficient Algorithms for Shared Camera Control Sariel Har-Peled Vladlen Koltun Dezhen Song Ken Goldberg
- A Time-Optimal Delaunay Refinement Algorithm in Two Dimensions
- On Finding a Guard that Sees Most and a Shop that Sells Most
- Maximum Margin Coresets for Active and Noise Tolerant Learning
- New Similarity Measures between Polylines with Applications to Morphing and Polygon Sweeping #
- A Practical Approach for Computing the Diameter of a Sariel Har-Peled
- New Constructions of SSPDs and their Applications
- Projective Clustering in High Dimensions using Sariel Har-Peled
- A Comment on Pseudo-Triangulation in Three Sariel Har-Peled
- Shape Fitting with Outliers Sariel Har-Peled
- When Crossings Count --Approximating the Minimum Spanning Tree
- The One-Round Voronoi Game OTFRIED CHEONG
- Notes on the NetTree Construction Algorithm Anthony ManCho So
- Geometric Approximation Algorithms Randomized Algorithms for
- A Uniform Convergence Bound for the Area Under the Shivani Agarwal
- Introduction Approximate Counting Middle Spanning trees The last slide On Approximate Halfspace Range Counting and
- Range Medians Sariel Har-Peled
- Two randomized incramental algorithms for planar arrangements, with a twist
- Hausdor Distance under Translation for Points, Disks, and Balls
- Approximate ShortestPath Queries on a Convex Polytope
- Approximation and Exact Algorithms MinimumWidth Annuli and Shells \Lambda
- CONSTRUCTING PLANAR CUTTINGS IN THEORY AND PRACTICE SARIEL HAR-PELED y
- Approximation Algorithms for Maximum Independent Set of Pseudo-Disks
- On generalization bounds, projection profile, and margin distribution
- New Constructions of SSPDs and their Applications # Mohammad A. Abam + Sariel HarPeled #
- The Complexity of One or Many Faces in the Overlay of Many Arrangements
- Constraint Classification: A New Approach to Multiclass Classification and Ranking
- Introduction Computational geometry involves the design, analysis and implementation of efficient al
- When Crossings Count | Approximating the Minimum Spanning Tree
- Sweeping Simple Polygons with a Chain of Guards Alon Efrat \Lambda Leonidas J. Guibas y Sariel HarPeled z David C. Lin x
- The Frechet Distance Revisited and Extended Sariel Har-Peled
- Approximation Algorithms for Maximum Independent Set of Pseudo-Disks
- Approximating kHop MinimumSpanning Trees # Ernst Althaus + Stefan Funke # Sariel HarPeled
- Approximation Algorithms for Two Optimal Location Problems in Sensor Networks
- On the Set MultiCover Problem in Geometric Settings # Chandra Chekuri + Kenneth L. Clarkson # Sariel HarPeled
- Eciently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
- Approximating MinimumWidth Annuli and Shells
- On the Least Median Square Problem Jeff Erickson
- Constraint Classification: A New Approach to Multiclass Classification and Ranking
- NSF CAREER Proposal: Approximation Algorithms for Geometric
- Being Fat and Friendly is Not Enough Sariel HarPeled #
- A Simple Proof of the Existence of a Planar Separator Sariel HarPeled #
- On Finding a Guard that Sees Most and a Shop that Sells Most
- The Frechet Distance Revisited and Extended # Sariel HarPeled + Benjamin Raichel #
- Taking a Walk in a Planar Arrangement \Lambda Sariel HarPeled y
- Morphing between Polylines Alon Efrat Sariel Har-Peled Leonidas J. Guibas T. M. Muraliy
- Approximation and Exact Algorithms Minimum-Width Annuli and Shells
- Approximating Shortest Paths on a Convex Polytope in Three Dimensions
- An Output Sensitive Algorithm for Discrete Convex Sariel Har-Peled
- Sweeping Simple Polygons with a Chain of Guards Alon Efrat Leonidas J. Guibasy Sariel Har-Peledz David C. Linx
- Geometric Packing under Non-uniform Constraints Sariel Har-Peledy
- Some Variants of Polygon Containment and Minimum Hausdor Distance under Translation are
- Approximate Shortest Paths and Geodesic Diameter on a Convex Polytope in Three Dimensions
- On-line Zone Construction in Arrangements of Lines in Y. Aharoni D. Halperin I. Hanniel S. Har-Peled C. Linhart
- The Complexity of One or Many Faces in the Overlay of Many Arrangements
- The Complexity of a Single Face of a Minkowski Sum Sariel Har-Peled Timothy M. Chany Boris Aronovz Dan Halperinx Jack Snoeyink{
- Approximating Shortest Paths on a Convex Polytope in Three Dimensions #
- Geometric Packing under Nonuniform Constraints Alina Ene Sariel HarPeled Benjamin Raichel
- Approximate Shortest Paths and Geodesic Diameter on a Convex Polytope in Three Dimensions #
- The Complexity of One or Many Faces in the Overlay of Many Arrangements
- An Output Sensitive Algorithm for Discrete Convex Sariel HarPeled +
- Down the Rabbit Hole: Robust Proximity Search in Sublinear Space
- On the Expected Complexity of Random Convex Hulls Sariel Har-Peled
- Down the Rabbit Hole: Robust Proximity Search in Sublinear Space
- Down the Rabbit Hole: Robust Proximity Search in Sublinear Space #
- Minimum Convex Partitions and Maximum Empty Polytopes Adrian Dumitrescu # Sariel HarPeled + Csaba D. Toth #
- On the Expected Complexity of Voronoi Diagrams on Terrains
- On the Expected Complexity of Voronoi Diagrams on Terrains
- How to Walk Your Dog in the Mountains with No Magic Leash Sariel Har-Peled
- The Frechet Distance Revisited and Extended # Sariel HarPeled + Benjamin Raichel #
- Jaywalking your Dog --Computing the Frechet Distance with Shortcuts #
- Jaywalking your Dog Computing the Frechet Distance with Shortcuts
- Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality
- The Frechet Distance Revisited and Extended Sariel Har-Peled
