| Publication | Date of Publication | Type |
|---|
Embeddings and near-neighbor searching with constant additive error for hyperbolic spaces
Computational Geometry | 2025-02-05 | Paper |
Coordinated Path Planning through Local Search and Simulated Annealing
ACM Journal of Experimental Algorithmics | 2023-06-26 | Paper |
Pattern matching in doubling spaces
(available as arXiv preprint) | 2022-03-25 | Paper |
Matching sets of line segments
Theoretical Computer Science | 2021-04-14 | Paper |
scientific article; zbMATH DE number 7278008 (Why is no real title available?)
(available as arXiv preprint) | 2020-11-25 | Paper |
Faster algorithms for growing prioritized disks and rectangles
Computational Geometry | 2019-10-18 | Paper |
Tight bounds for beacon-based coverage in simple rectilinear polygons
Computational Geometry | 2019-10-18 | Paper |
Matching sets of line segments
WALCOM: Algorithms and Computation | 2019-10-15 | Paper |
Approximating a planar convex set using a sparse grid
Information Processing Letters | 2019-09-20 | Paper |
A faster algorithm for computing straight skeletons
ACM Transactions on Algorithms | 2018-11-05 | Paper |
| Reachability in a planar subdivision with direction constraints | 2018-08-13 | Paper |
Finding Largest Common Point Sets
International Journal of Computational Geometry & Applications | 2018-01-31 | Paper |
Navigating weighted regions with scattered skinny tetrahedra
International Journal of Computational Geometry & Applications | 2017-10-20 | Paper |
Maximizing the overlap of two planar convex sets under rigid motions
Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
Triangulation refinement and approximate shortest paths in weighted regions
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Reachability by paths of bounded curvature in convex polygons
Proceedings of the sixteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Navigating Weighted Regions with Scattered Skinny Tetrahedra
Algorithms and Computation | 2016-01-11 | Paper |
Geometric optimization and sums of algebraic functions
ACM Transactions on Algorithms | 2015-08-14 | Paper |
Computing the Gromov hyperbolicity of a discrete metric space
Information Processing Letters | 2015-05-21 | Paper |
A faster algorithm for computing motorcycle graphs
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
A generalization of the convex Kakeya problem
Algorithmica | 2015-01-19 | Paper |
| Approximate shortest paths in anisotropic regions | 2014-12-18 | Paper |
A faster algorithm for computing motorcycle graphs
Discrete & Computational Geometry | 2014-11-14 | Paper |
A faster algorithm for computing straight skeletons
Algorithms - ESA 2014 | 2014-10-08 | Paper |
| Geometric optimization and sums of algebraic functions | 2014-05-22 | Paper |
Realistic roofs over a rectilinear polygon
Computational Geometry | 2013-09-03 | Paper |
A deterministic algorithm for fitting a step function to a weighted point-set
Information Processing Letters | 2013-03-20 | Paper |
Covering and piercing disks with two centers
Computational Geometry | 2013-01-25 | Paper |
Computing the discrete Fréchet distance with imprecise input
International Journal of Computational Geometry & Applications | 2012-11-23 | Paper |
APPROXIMATE SHORTEST HOMOTOPIC PATHS IN WEIGHTED REGIONS
International Journal of Computational Geometry & Applications | 2012-11-23 | Paper |
A generalization of the convex Kakeya problem
Lecture Notes in Computer Science | 2012-06-29 | Paper |
Reachability by paths of bounded curvature in a convex polygon
Computational Geometry | 2012-06-08 | Paper |
Covering and piercing disks with two centers
Algorithms and Computation | 2011-12-16 | Paper |
Generating realistic roofs over a rectilinear polygon
Algorithms and Computation | 2011-12-16 | Paper |
Fitting a step function to a point set
Algorithmica | 2011-07-01 | Paper |
THE ALIGNED K-CENTER PROBLEM
International Journal of Computational Geometry & Applications | 2011-05-11 | Paper |
REVERSE NEAREST NEIGHBOR QUERIES IN FIXED DIMENSION
International Journal of Computational Geometry & Applications | 2011-05-11 | Paper |
Approximate shortest homotopic paths in weighted regions
Algorithms and Computation | 2010-12-09 | Paper |
Computing the discrete Fréchet distance with imprecise input
Algorithms and Computation | 2010-12-09 | Paper |
Querying Approximate Shortest Paths in Anisotropic Regions
SIAM Journal on Computing | 2010-11-04 | Paper |
Approximate Shortest Paths in Anisotropic Regions
SIAM Journal on Computing | 2009-06-22 | Paper |
Querying approximate shortest paths in anisotropic regions
Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 | 2009-02-12 | Paper |
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces
Algorithms - ESA 2008 | 2008-11-25 | Paper |
Fitting a Step Function to a Point Set
Algorithms - ESA 2008 | 2008-11-25 | Paper |
Lower Bounds for Geometric Diameter Problems
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Sparse geometric graphs with small dilation
Computational Geometry | 2008-06-18 | Paper |
A tight lower bound for computing the diameter of a 3D convex polytope
Algorithmica | 2007-11-28 | Paper |
Packing two disks into a polygonal environment.
Journal of Discrete Algorithms | 2007-04-25 | Paper |
Maximizing the overlap of two planar convex sets under rigid motions
Computational Geometry | 2007-03-15 | Paper |
Motorcycle graphs and straight skeletons
Algorithmica | 2007-03-12 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets
Computational Geometry | 2006-04-28 | Paper |
The Voronoi diagram of curved objects
Discrete & Computational Geometry | 2005-11-10 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2005-06-15 | Paper |
| scientific article; zbMATH DE number 2119657 (Why is no real title available?) | 2004-11-29 | Paper |
Computing farthest neighbors on a convex polytope.
Theoretical Computer Science | 2003-08-17 | Paper |
Polynomial time algorithms for three-label point labeling.
Theoretical Computer Science | 2003-08-17 | Paper |
Reporting intersections among thick objects.
Information Processing Letters | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 1796962 (Why is no real title available?) | 2002-09-05 | Paper |
| scientific article; zbMATH DE number 1796963 (Why is no real title available?) | 2002-09-05 | Paper |
An algorithm for finding a k-median in a directed tree
Information Processing Letters | 2002-07-25 | Paper |
An elementary algorithm for reporting intersections of red/blue curve segments
Computational Geometry | 2002-03-14 | Paper |
| scientific article; zbMATH DE number 1736032 (Why is no real title available?) | 2001-01-01 | Paper |
