| Publication | Date of Publication | Type |
|---|
| Discrete Fréchet distance oracles | 2025-11-24 | Paper |
| A clique-based separator for intersection graphs of geodesic disks in \(\mathbb{R}^2\) | 2025-11-24 | Paper |
| Eight-partitioning points in 3D, and efficiently too | 2025-11-24 | Paper |
A clique-based separator for intersection graphs of geodesic disks in \(\mathbb{R}^2\)
Algorithmica | 2025-10-10 | Paper |
Intersection queries for flat semi-algebraic objects in three dimensions and related problems
ACM Transactions on Algorithms | 2025-10-01 | Paper |
Discrete Fréchet distance oracles
Journal of Computational Geometry | 2025-08-28 | Paper |
| A general technique for searching in implicit sets via function inversion | 2024-05-29 | Paper |
| Dynamic approximate multiplicatively-weighted nearest neighbors | 2024-05-27 | Paper |
| Intersection queries for flat semi-algebraic objects in three dimensions and related problems | 2024-05-14 | Paper |
scientific article; zbMATH DE number 7788443 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
| Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision tree model | 2024-01-15 | Paper |
| Geometric Pattern Matching Reduces to k-SUM. | 2023-11-14 | Paper |
| On β-Plurality Points in Spatial Voting Games. | 2023-11-02 | Paper |
| Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets. | 2023-11-02 | Paper |
Time and space efficient collinearity indexing
Computational Geometry | 2023-01-09 | Paper |
On the number of regular vertices of the union of Jordan regions
Algorithm Theory — SWAT'98 | 2022-12-09 | Paper |
Visibility with multiple reflections
Algorithm Theory — SWAT'96 | 2022-12-09 | Paper |
Star unfolding of a polytope with applications
SWAT 90 | 2022-12-09 | Paper |
Testing polynomials for vanishing on Cartesian products of planar point sets: collinearity testing and related problems
Discrete & Computational Geometry | 2022-12-08 | Paper |
Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model
Computational Geometry | 2022-11-16 | Paper |
Geometric pattern matching reduces to \(k\)-SUM
Discrete & Computational Geometry | 2022-09-16 | Paper |
Bipartite diameter and other measures under translation
Discrete & Computational Geometry | 2022-09-16 | Paper |
| scientific article; zbMATH DE number 7559117 (Why is no real title available?) | 2022-07-18 | Paper |
| scientific article; zbMATH DE number 7559380 (Why is no real title available?) | 2022-07-18 | Paper |
| scientific article; zbMATH DE number 7559205 (Why is no real title available?) | 2022-07-18 | Paper |
On β-Plurality Points in Spatial Voting Games
ACM Transactions on Algorithms | 2022-02-16 | Paper |
| Resolving SINR queries in a dynamic setting | 2021-07-28 | Paper |
Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications
SIAM Journal on Computing | 2021-05-27 | Paper |
Resolving SINR Queries in a Dynamic Setting
SIAM Journal on Computing | 2021-01-13 | Paper |
On pseudo-disk hypergraphs
Computational Geometry | 2021-01-07 | Paper |
Constructive polynomial partitioning for algebraic curves in \(\mathbb{R}^3\) with applications
SIAM Journal on Computing | 2020-12-04 | Paper |
Eliminating depth cycles among triangles in three dimensions
Discrete & Computational Geometry | 2020-10-23 | Paper |
Non-monochromatic and conflict-free colorings on tree spaces and planar network spaces
Algorithmica | 2020-04-01 | Paper |
Efficient nearest-neighbor query and clustering of planar curves
(available as arXiv preprint) | 2020-01-16 | Paper |
Constructive polynomial partitioning for algebraic curves in \(\mathbb{R}^3\) with applications
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Segmentation of trajectories on non-monotone criteria
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| Computing the distance between piecewise-linear bivariate functions | 2019-05-10 | Paper |
Batched point location in SINR diagrams via algebraic tools
ACM Transactions on Algorithms | 2019-03-28 | Paper |
More Turán-type theorems for triangles in convex point sets
The Electronic Journal of Combinatorics | 2019-03-05 | Paper |
More Turán-type theorems for triangles in convex point sets
The Electronic Journal of Combinatorics | 2019-03-05 | Paper |
Data structures for halfplane proximity queries and incremental Voronoi diagrams
Algorithmica | 2019-01-11 | Paper |
Cost prediction for ray shooting
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
Incidences between points and circles in three and higher dimensions
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
Nearest-neighbor searching under uncertainty. II
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Computing the distance between piecewise-linear bivariate functions
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Segmentation of trajectories on nonmonotone criteria
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Non-monochromatic and conflict-free coloring on tree spaces and planar network spaces
(available as arXiv preprint) | 2018-10-04 | Paper |
Eliminating depth cycles among triangles in three dimensions
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Time-space trade-offs for triangulating a simple polygon | 2018-06-05 | Paper |
Non-Monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces
(available as arXiv preprint) | 2018-05-07 | Paper |
Almost tight bounds for eliminating depth cycles in three dimensions
Discrete & Computational Geometry | 2018-04-20 | Paper |
scientific article; zbMATH DE number 6832267 (Why is no real title available?)
(available as arXiv preprint) | 2018-01-30 | Paper |
Time-space trade-offs for triangulating a simple polygon
(available as arXiv preprint) | 2017-10-17 | Paper |
Cost-driven octree construction schemes
Proceedings of the nineteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
A Helly-type theorem for hyperplane transversals to well-separated convex sets
Proceedings of the sixteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Almost tight bounds for eliminating depth cycles in three dimensions
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
| Improved bound for the union of fat triangles | 2017-09-29 | Paper |
On lines avoiding unit balls in three dimensions
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
On the union of \(\kappa\)-round objects
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
The number of holes in the union of translates of a convex set in three dimensions
Discrete & Computational Geometry | 2017-02-24 | Paper |
Distance-sensitive planar point location
Computational Geometry | 2016-05-17 | Paper |
Batched point location in SINR diagrams via algebraic tools
Lecture Notes in Computer Science | 2015-10-27 | Paper |
Efficient algorithms for bichromatic separability
ACM Transactions on Algorithms | 2015-09-02 | Paper |
| scientific article; zbMATH DE number 6472624 (Why is no real title available?) | 2015-08-14 | Paper |
| scientific article; zbMATH DE number 6469209 (Why is no real title available?) | 2015-08-03 | Paper |
Small-size ε-nets for axis-parallel rectangles and boxes
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
| On geometric permutations induced by lines transversal through a fixed point | 2014-10-13 | Paper |
| On approximating the depth and related problems | 2014-10-13 | Paper |
Witness rectangle graphs
Graphs and Combinatorics | 2014-09-19 | Paper |
On the union complexity of diametral disks
The Electronic Journal of Combinatorics | 2014-08-14 | Paper |
Improved bounds for the union of locally fat objects in the plane
SIAM Journal on Computing | 2014-07-30 | Paper |
Mutual witness proximity graphs
Information Processing Letters | 2014-06-23 | Paper |
Convex equipartitions: the spicy chicken theorem
Geometriae Dedicata | 2014-05-30 | Paper |
Computing similarity between piecewise-linear functions
Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
Computing correlation between piecewise-linear functions
SIAM Journal on Computing | 2014-02-04 | Paper |
Witness Gabriel graphs
Computational Geometry | 2013-08-22 | Paper |
Witness Gabriel graphs
Computational Geometry | 2013-08-22 | Paper |
Distance-Sensitive Planar Point Location
Lecture Notes in Computer Science | 2013-08-12 | Paper |
How to cover a point set with a \(V\)-shape of minimum width
Computational Geometry | 2013-01-25 | Paper |
Unions of fat convex polytopes have short skeletons
Discrete & Computational Geometry | 2012-08-13 | Paper |
Minimizing the error of linear separators on linearly inseparable data
Discrete Applied Mathematics | 2012-06-18 | Paper |
| Complexity of a Single Face in an Arrangement of s-Intersecting Curves | 2011-08-22 | Paper |
How to cover a point set with a V-shape of minimum width
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Witness rectangle graphs
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Witness (Delaunay) graphs
Computational Geometry | 2011-07-20 | Paper |
Peeling meshed potatoes
Algorithmica | 2011-05-10 | Paper |
Small-size \(\varepsilon\)-nets for axis-parallel rectangles and boxes
SIAM Journal on Computing | 2011-04-04 | Paper |
Approximate halfspace range counting
SIAM Journal on Computing | 2011-04-04 | Paper |
Lines pinning lines
Discrete & Computational Geometry | 2011-03-10 | Paper |
| Convex Equipartitions of volume and surface area | 2010-10-22 | Paper |
Cutting triangular cycles of lines in space
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Distinct distances in three and higher dimensions
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
| scientific article; zbMATH DE number 5764843 (Why is no real title available?) | 2010-08-06 | Paper |
OPTIMAL TRIANGULATIONS OF POINTS AND SEGMENTS WITH STEINER POINTS
International Journal of Computational Geometry & Applications | 2010-03-19 | Paper |
Connect the Dot: Computing Feed-Links with Minimum Dilation
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Minimum-cost load-balancing partitions
Algorithmica | 2009-08-27 | Paper |
On Approximating the Depth and Related Problems
SIAM Journal on Computing | 2009-06-22 | Paper |
Small weak epsilon-nets
Computational Geometry | 2009-06-18 | Paper |
On approximate halfspace range counting and relative epsilon-approximations
Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 | 2009-02-12 | Paper |
| scientific article; zbMATH DE number 5506196 (Why is no real title available?) | 2009-02-10 | Paper |
| scientific article; zbMATH DE number 5506221 (Why is no real title available?) | 2009-02-10 | Paper |
The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains
Algorithms - ESA 2008 | 2008-11-25 | Paper |
Data structures for halfplane proximity queries and incremental Voronoi diagrams
Lecture Notes in Computer Science | 2008-09-18 | Paper |
The Complexity of Diffuse Reflections in a Simple Polygon
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
Computational Geometry | 2008-07-29 | Paper |
Sparse geometric graphs with small dilation
Computational Geometry | 2008-06-18 | Paper |
Optimal Triangulation with Steiner Points
Algorithms and Computation | 2008-05-27 | Paper |
A generalization of magic squares with applications to digital halftoning
Theory of Computing Systems | 2008-04-03 | Paper |
Fréchet Distance for Curves, Revisited
Lecture Notes in Computer Science | 2008-03-11 | Paper |
On the union of \(\kappa\)-round objects in three and four dimensions
Discrete & Computational Geometry | 2006-12-06 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Cost prediction for ray shooting in octrees
Computational Geometry | 2006-06-30 | Paper |
POLYLINE FITTING OF PLANAR POINTS UNDER MIN-SUM CRITERIA
International Journal of Computational Geometry & Applications | 2006-05-29 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Lines avoiding unit balls in three dimensions
Discrete & Computational Geometry | 2005-11-01 | Paper |
Geometric permutations induced by line transversals through a fixed point
Discrete & Computational Geometry | 2005-11-01 | Paper |
| scientific article; zbMATH DE number 2209708 (Why is no real title available?) | 2005-09-28 | Paper |
Cost-driven octree construction schemes: An experimental study
Computational Geometry | 2005-05-04 | Paper |
Cutting triangular cycles of lines in space
Discrete & Computational Geometry | 2005-04-15 | Paper |
Incidences between points and circles in three and higher dimensions
Discrete & Computational Geometry | 2005-04-15 | Paper |
Cell complexities in hyperplane arrangements
Discrete & Computational Geometry | 2004-12-16 | Paper |
Distinct Distances in Three and Higher Dimensions
Combinatorics, Probability and Computing | 2004-09-24 | Paper |
Facility location on a polyhedral surface
Discrete & Computational Geometry | 2004-07-07 | Paper |
On the number of views of translates of a cube and related problems.
Computational Geometry | 2004-03-14 | Paper |
Cutting circles into pseudo-segments and improved bounds for incidences
Discrete & Computational Geometry | 2003-03-17 | Paper |
A lower bound on Voronoi diagram complexity.
Information Processing Letters | 2003-01-21 | Paper |
A Helly-type theorem for higher-dimensional transversals
Computational Geometry | 2003-01-08 | Paper |
On the number of regular vertices of the union of Jordan regions
Discrete & Computational Geometry | 2002-11-04 | Paper |
A Helly-type theorem for hyperplane transversals to well-separated convex sets
Discrete & Computational Geometry | 2002-11-04 | Paper |
| scientific article; zbMATH DE number 1786501 (Why is no real title available?) | 2002-08-21 | Paper |
Exact and approximation algorithms for minimum-width cylindrical shells
Discrete & Computational Geometry | 2002-07-22 | Paper |
Approximation algorithms for minimum-width annuli and shells
Discrete & Computational Geometry | 2001-08-16 | Paper |
On the Helly number for hyperplane transversals to unit balls
Discrete & Computational Geometry | 2001-05-17 | Paper |
| scientific article; zbMATH DE number 1445343 (Why is no real title available?) | 2001-01-29 | Paper |
Motion planning for multiple robots
Discrete & Computational Geometry | 1999-11-25 | Paper |
Motion planning for a convex polygon in a polygonal environment
Discrete & Computational Geometry | 1999-09-12 | Paper |
Approximating minimum-weight triangulations in three dimensions
Discrete & Computational Geometry | 1999-06-29 | Paper |
Line transversals of balls and smallest enclosing cylinders in three dimensions
Discrete & Computational Geometry | 1999-05-27 | Paper |
Visibility with multiple reflections
Discrete & Computational Geometry | 1998-10-26 | Paper |
Visibility with one reflection
Discrete & Computational Geometry | 1998-08-12 | Paper |
The common exterior of convex polygons in the plane
Computational Geometry | 1998-02-16 | Paper |
Star Unfolding of a Polytope with Applications
SIAM Journal on Computing | 1998-02-10 | Paper |
Computing Envelopes in Four Dimensions with Applications
SIAM Journal on Computing | 1998-02-10 | Paper |
The Union of Convex Polyhedra in Three Dimensions
SIAM Journal on Computing | 1998-02-10 | Paper |
On Translational Motion Planning of a Convex Polyhedron in 3-Space
SIAM Journal on Computing | 1998-02-10 | Paper |
Quasi-planar graphs have a linear number of edges
Combinatorica | 1998-01-05 | Paper |
| scientific article; zbMATH DE number 763368 (Why is no real title available?) | 1995-06-22 | Paper |
Can visibility graphs be represented compactly?
Discrete & Computational Geometry | 1994-11-27 | Paper |
Castles in the air revisited
Discrete & Computational Geometry | 1994-09-26 | Paper |
Crossing families
Combinatorica | 1994-08-11 | Paper |
On the number of minimal 1-Steiner trees
Discrete & Computational Geometry | 1994-08-10 | Paper |
On the sum of squares of cell complexities in hyperplane arrangements
Journal of Combinatorial Theory. Series A | 1994-06-06 | Paper |
An invariant property of balls in arrangements of hyperplanes
Discrete & Computational Geometry | 1994-01-19 | Paper |
On compatible triangulations of simple polygons
Computational Geometry | 1993-08-23 | Paper |
Selecting distances in the plane
Algorithmica | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 177534 (Why is no real title available?) | 1993-05-18 | Paper |
The furthest-site geodesic Voronoi diagram
Discrete & Computational Geometry | 1993-05-16 | Paper |
On the zone of a surface in a hyperplane arrangement
Discrete & Computational Geometry | 1993-05-16 | Paper |
The number of edges of many faces in a line segment arrangement
Combinatorica | 1993-01-17 | Paper |
Nonoverlap of the star unfolding
Discrete & Computational Geometry | 1993-01-16 | Paper |
Counting facets and incidences
Discrete & Computational Geometry | 1992-09-26 | Paper |
Points and triangles in the plane and halving planes in space
Discrete & Computational Geometry | 1992-06-25 | Paper |
Computing external farthest neighbors for a simple polygon
Discrete Applied Mathematics | 1992-06-25 | Paper |
Triangles in space or building (and analyzing) castles in the air
Combinatorica | 1990-01-01 | Paper |
On the geodesic Voronoi diagram of point sites in a simple polygon
Algorithmica | 1989-01-01 | Paper |
Eight-Partitioning Points in 3D, and Efficiently Too
(available as arXiv preprint) | N/A | Paper |
