| Publication | Date of Publication | Type |
|---|
Optimal volume-sensitive bounds for polytope approximation
Discrete & Computational Geometry | 2026-01-06 | Paper |
| Delaunay triangulations in the Hilbert metric | 2025-12-02 | Paper |
| Ipelets for the convex polygonal geometry (media exposition) | 2025-11-24 | Paper |
| Smooth distance approximation | 2025-01-06 | Paper |
| Optimal volume-sensitive bounds for polytope approximation | 2024-10-16 | Paper |
| Voronoi diagrams in the Hilbert metric | 2024-10-16 | Paper |
Economical convex coverings and applications
SIAM Journal on Computing | 2024-08-06 | Paper |
| Convex approximation and the Hilbert geometry | 2024-05-29 | Paper |
| Economical convex coverings and applications | 2024-05-14 | Paper |
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes
ACM Transactions on Algorithms | 2023-10-31 | Paper |
| Boundary-Sensitive Approach for Approximate Nearest-Neighbor Classification. | 2023-09-20 | Paper |
Coresets for the Nearest-Neighbor Rule
(available as arXiv preprint) | 2023-02-07 | Paper |
| Online Algorithms for Warehouse Management. | 2023-02-03 | Paper |
Point probe decision trees for geometric concept classes
Lecture Notes in Computer Science | 2023-01-18 | Paper |
| Voronoi Diagrams in the Hilbert Metric | 2021-12-06 | Paper |
Guarantees on nearest-neighbor condensation heuristics
Computational Geometry | 2021-09-16 | Paper |
Approximate convex intersection detection with applications to width and Minkowski sums
(available as arXiv preprint) | 2021-08-04 | Paper |
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
| Economical Delone sets for approximating convex bodies | 2020-08-25 | Paper |
Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
| New directions in approximate nearest-neighbor searching | 2019-10-10 | Paper |
Modular circulation and applications to traffic management
Algorithmica | 2019-09-10 | Paper |
| Polytope approximation and the Mahler volume | 2019-05-10 | Paper |
Bounds on the cost of compatible refinement of simplex decomposition trees in arbitrary dimensions
Computational Geometry | 2019-03-20 | Paper |
A local search approximation algorithm for \(k\)-means clustering
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
A practical approximation algorithm for the LTS estimator
Computational Statistics and Data Analysis | 2018-08-15 | Paper |
Near-optimal \(\varepsilon\)-kernel construction and related problems
(available as arXiv preprint) | 2018-08-13 | Paper |
Optimal approximate polytope membership
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
A fast and simple algorithm for computing approximate Euclidean minimum spanning trees
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| scientific article; zbMATH DE number 6876122 (Why is no real title available?) | 2018-05-29 | Paper |
| On the combinatorial complexity of approximating polytopes | 2018-01-30 | Paper |
Approximate polytope membership queries
SIAM Journal on Computing | 2018-01-12 | Paper |
On the combinatorial complexity of approximating polytopes
Discrete & Computational Geometry | 2018-01-11 | Paper |
| Space exploration via proximity search | 2017-10-10 | Paper |
| Approximate geometric MST range queries | 2017-10-10 | Paper |
A computational framework for incremental motion
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
The analysis of a simple k -means clustering algorithm
Proceedings of the sixteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
On the least median square problem
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
Modular circulation and applications to traffic management
Lecture Notes in Computer Science | 2017-09-22 | Paper |
Space exploration via proximity search
Discrete & Computational Geometry | 2016-09-14 | Paper |
Space exploration via proximity search
Discrete & Computational Geometry | 2016-09-14 | Paper |
On the complexity of an unregulated traffic crossing
Lecture Notes in Computer Science | 2015-10-30 | Paper |
A simple entropy-based algorithm for planar point location
ACM Transactions on Algorithms | 2015-09-02 | Paper |
| scientific article; zbMATH DE number 6472623 (Why is no real title available?) | 2015-08-14 | Paper |
A sensor-based framework for kinetic data compression
Computational Geometry | 2014-12-23 | Paper |
On the importance of idempotence
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
On the least trimmed squares estimator
Algorithmica | 2014-11-19 | Paper |
| Space-time tradeoffs for approximate spherical range counting | 2014-10-13 | Paper |
Optimal area-sensitive bounds for polytope approximation
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
Approximate polytope membership queries
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
A dynamic data structure for approximate range searching
Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
Tight lower bounds for halfspace range searching
Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
A self-adjusting data structure for multidimensional point sets
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Tight lower bounds for halfspace range searching
Discrete & Computational Geometry | 2012-05-22 | Paper |
Spatio-temporal range searching over compressed kinetic sensor data
Algorithms – ESA 2010 | 2010-09-06 | Paper |
A unified approach to approximate proximity searching
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Space-efficient approximate Voronoi diagrams
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Approximation algorithm for the kinetic robust \(k\)-center problem
Computational Geometry | 2010-07-28 | Paper |
Space-time tradeoffs for approximate nearest neighbor searching
Journal of the ACM | 2010-07-14 | Paper |
Approximate range searching: The absolute model
Computational Geometry | 2010-03-16 | Paper |
Maintaining Nets and Net Trees under Incremental Motion
Algorithms and Computation | 2009-12-17 | Paper |
A practical approximation algorithm for the LMS line estimator
Computational Statistics and Data Analysis | 2009-05-29 | Paper |
The effect of corners on the complexity of approximate range searching
Discrete & Computational Geometry | 2009-04-27 | Paper |
Embedding and similarity search for point sets under translation
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
| scientific article; zbMATH DE number 5506186 (Why is no real title available?) | 2009-02-10 | Paper |
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces
Algorithms - ESA 2008 | 2008-11-25 | Paper |
POINTERLESS IMPLEMENTATION OF HIERARCHICAL SIMPLICIAL MESHES AND EFFICIENT NEIGHBOR FINDING IN ARBITRARY DIMENSIONS
International Journal of Computational Geometry & Applications | 2008-05-20 | Paper |
Testing simple polygons.
Computational Geometry | 2008-04-25 | Paper |
Optimal Expected-Case Planar Point Location
SIAM Journal on Computing | 2008-04-22 | Paper |
Improved approximation bounds for planar point pattern matching
Algorithmica | 2008-04-03 | Paper |
A FAST IMPLEMENTATION OF THE ISODATA CLUSTERING ALGORITHM
International Journal of Computational Geometry & Applications | 2007-03-21 | Paper |
On the least median square problem
Discrete & Computational Geometry | 2006-12-06 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
Proximity problems on line segments spanned by points
Computational Geometry | 2006-04-28 | Paper |
| Analyzing the number of samples required for an approximate Monte-Carlo LMS line estimator | 2006-04-28 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
APPROXIMATION ALGORITHM FOR MULTIPLE-TOOL MILLING
International Journal of Computational Geometry & Applications | 2005-06-10 | Paper |
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Journal of the ACM | 2005-01-25 | Paper |
A local search approximation algorithm for \(k\)-means clustering
Computational Geometry | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2065610 (Why is no real title available?) | 2004-05-18 | Paper |
Approximating large convolutions in digital images
IEEE Transactions on Image Processing | 2003-10-15 | Paper |
| scientific article; zbMATH DE number 1893569 (Why is no real title available?) | 2003-04-07 | Paper |
| scientific article; zbMATH DE number 1830741 (Why is no real title available?) | 2002-11-18 | Paper |
| A simple entropy-based algorithm for planar point location | 2002-06-18 | Paper |
| scientific article; zbMATH DE number 1728331 (Why is no real title available?) | 2002-04-15 | Paper |
| Algorithms for facility location problems with outliers. (Extended abstract) | 2002-01-30 | Paper |
| Entropy-preserving cuttings and space-efficient planar point location | 2002-01-30 | Paper |
Approximate range searching
Computational Geometry | 2001-09-13 | Paper |
VISIBILITY STABS AND DEPTH-FIRST SPIRALLING ON LINE SEGMENTS IN OUTPUT SENSITIVE TIME
International Journal of Computational Geometry & Applications | 2001-09-13 | Paper |
Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses
Computational Geometry | 2001-09-09 | Paper |
| scientific article; zbMATH DE number 1263225 (Why is no real title available?) | 2001-08-28 | Paper |
| scientific article; zbMATH DE number 1617272 (Why is no real title available?) | 2001-07-11 | Paper |
Quantile approximation for robust statistical estimation and \(k\)-enclosing problems
International Journal of Computational Geometry & Applications | 2001-07-05 | Paper |
Chromatic nearest neighbor searching: A query sensitive approach
Computational Geometry | 2001-06-21 | Paper |
Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
Computational Geometry | 2000-03-07 | Paper |
| scientific article; zbMATH DE number 1241788 (Why is no real title available?) | 1999-01-18 | Paper |
| scientific article; zbMATH DE number 1305524 (Why is no real title available?) | 1999-01-01 | Paper |
| scientific article; zbMATH DE number 1182926 (Why is no real title available?) | 1998-08-02 | Paper |
Efficient randomized algorithms for the repeated median line estimator
Algorithmica | 1998-05-24 | Paper |
Parallelizing an Algorithm for Visibility on Polyhedral Terrain
International Journal of Computational Geometry & Applications | 1997-07-27 | Paper |
| scientific article; zbMATH DE number 1003290 (Why is no real title available?) | 1997-04-23 | Paper |
| scientific article; zbMATH DE number 775120 (Why is no real title available?) | 1995-08-30 | Paper |
| scientific article; zbMATH DE number 619545 (Why is no real title available?) | 1994-09-13 | Paper |
Pyramid computation of neighbor distance statistics in dot patterns
CVGIP: Graphical Models and Image Processing | 1994-08-29 | Paper |
| scientific article; zbMATH DE number 437552 (Why is no real title available?) | 1993-12-21 | Paper |
| scientific article; zbMATH DE number 437531 (Why is no real title available?) | 1993-12-21 | Paper |
A RANDOMIZED ALGORITHM FOR SLOPE SELECTION
International Journal of Computational Geometry & Applications | 1993-01-16 | Paper |
A PARALLEL ALGORITHM FOR ENCLOSED AND ENCLOSING TRIANGLES
International Journal of Computational Geometry & Applications | 1993-01-16 | Paper |
| scientific article; zbMATH DE number 66687 (Why is no real title available?) | 1992-09-27 | Paper |
Parallel computational geometry of rectangles
Algorithmica | 1992-06-28 | Paper |
An Output-Sensitive Algorithm for Computing Visibility Graphs
SIAM Journal on Computing | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 4211551 (Why is no real title available?) | 1991-01-01 | Paper |
The Number of Shortest Paths on the Surface of a Polyhedron
SIAM Journal on Computing | 1990-01-01 | Paper |
Packing and covering the plane with translates of a convex polygon
Journal of Algorithms | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4105024 (Why is no real title available?) | 1989-01-01 | Paper |
The Decomposition of a Rectangle into Rectangles of Minimal Perimeter
SIAM Journal on Computing | 1988-01-01 | Paper |
The Discrete Geodesic Problem
SIAM Journal on Computing | 1987-01-01 | Paper |
Storing the subdivision of a polyhedral surface
Discrete & Computational Geometry | 1987-01-01 | Paper |
The decomposition of a square into rectangles of minimal perimeter
Discrete Applied Mathematics | 1987-01-01 | Paper |
