| Publication | Date of Publication | Type |
|---|
Some new results on geometric transversals
Discrete \& Computational Geometry | 2024-10-25 | Paper |
Minimum-width double-slabs and widest empty slabs in high dimensions
| 2024-05-31 | Paper |
Covering families of triangles
Periodica Mathematica Hungarica | 2023-10-04 | Paper |
Weakly and Strongly Fan-Planar Graphs
| 2023-08-17 | Paper |
The thickness of fan-planar graphs is at most three
Lecture Notes in Computer Science | 2023-08-16 | Paper |
Separating and shattering long line segments
| 2023-01-25 | Paper |
Computing the maximum overlap of two convex polygons under translations
| 2023-01-25 | Paper |
Parallel computation of discrete Voronoi diagrams (extended abstract)
STACS 89 | 2022-08-16 | Paper |
The Topology of the set of line Transversals
| 2022-05-29 | Paper |
Weight balancing on boundaries
| 2022-05-18 | Paper |
The inverse Kakeya problem
Periodica Mathematica Hungarica | 2022-02-22 | Paper |
No weak epsilon nets for lines and convex sets in space
| 2022-02-06 | Paper |
The reverse Kakeya problem
advg | 2021-04-20 | Paper |
Fitting a graph to one-dimensional data
Theoretical Computer Science | 2021-04-15 | Paper |
Smallest universal covers for families of triangles
Computational Geometry | 2021-01-07 | Paper |
Computation of spatial skyline points
Computational Geometry | 2021-01-07 | Paper |
Placing your coins on a shelf
| 2020-11-25 | Paper |
Shortcuts for the circle
| 2020-11-25 | Paper |
The reverse Kakeya problem
| 2020-08-18 | Paper |
The Inverse Kakeya Problem
| 2019-12-18 | Paper |
Packing 2D disks into a 3D container
| 2019-10-15 | Paper |
Covering many points with a small-area box
| 2019-09-10 | Paper |
Shortcuts for the circle
Computational Geometry | 2019-03-20 | Paper |
Placing your coins on a shelf
| 2019-02-27 | Paper |
The one-round Voronoi game
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
The minimum convex container of two convex polytopes under translations
Computational Geometry | 2018-11-19 | Paper |
Weight Balancing on Boundaries and Skeletons
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
Finding Largest Common Point Sets
International Journal of Computational Geometry & Applications | 2018-01-31 | Paper |
scientific article; zbMATH DE number 6832267 (Why is no real title available?)
| 2018-01-30 | Paper |
Approximating convex shapes with respect to symmetric difference under homotheties
| 2018-01-30 | Paper |
Hadwiger and Helly-type theorems for disjoint unit spheres in R 3
Proceedings of the twenty-first annual symposium on Computational geometry | 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 |
Reachability by paths of bounded curvature in convex polygons
Proceedings of the sixteenth 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 |
On lazy randomized incremental construction
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Separating and shattering long line segments
Information Processing Letters | 2016-06-09 | Paper |
Computing a single cell in the overlay of two simple polygons
Information Processing Letters | 2016-05-26 | Paper |
Geometric permutations of non-overlapping unit balls revisited
Computational Geometry | 2016-04-12 | Paper |
On the number of edges of fan-crossing free graphs
Algorithmica | 2016-02-19 | Paper |
Finding largest rectangles in convex polygons
Computational Geometry | 2016-01-18 | Paper |
SINGLE-SOURCE DILATION-BOUNDED MINIMUM SPANNING TREES
International Journal of Computational Geometry & Applications | 2015-12-22 | Paper |
scientific article; zbMATH DE number 6469255 (Why is no real title available?)
| 2015-08-03 | Paper |
A deterministic algorithm for the three-dimensional diameter problem
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Piecewise linear paths among convex obstacles
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
A generalization of the convex Kakeya problem
Algorithmica | 2015-01-19 | Paper |
A fast algorithm for data collection along a fixed track
Theoretical Computer Science | 2014-10-06 | Paper |
On the number of edges of fan-crossing free graphs
Lecture Notes in Computer Science | 2014-01-14 | Paper |
Lower bounds for pinning lines by balls (extended abstract)
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
A fast algorithm for data collection along a fixed track
Lecture Notes in Computer Science | 2013-06-11 | Paper |
The cost of bounded curvature
Computational Geometry | 2013-04-29 | Paper |
Set systems and families of permutations with small traces
European Journal of Combinatorics | 2012-12-03 | Paper |
Lower bounds to Helly numbers of line transversals to disjoint congruent balls
Israel Journal of Mathematics | 2012-11-13 | Paper |
The Cost of Bounded Curvature
Lecture Notes in Computer Science | 2012-09-25 | 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 |
Aligning two convex figures to minimize area or perimeter
Algorithmica | 2012-04-26 | Paper |
REVERSE NEAREST NEIGHBOR QUERIES IN FIXED DIMENSION
International Journal of Computational Geometry & Applications | 2011-05-11 | Paper |
Farthest-polygon Voronoi diagrams
Computational Geometry | 2011-03-25 | Paper |
Lines pinning lines
Discrete \& Computational Geometry | 2011-03-10 | Paper |
A note on the perimeter of fat objects
Computational Geometry | 2010-10-15 | Paper |
The complexity of flow on fat terrains and its i/o-efficient computation
Computational Geometry | 2010-03-16 | Paper |
Algorithms - ESA 2003
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Computation of non-dominated points using compact Voronoi diagrams
WALCOM: Algorithms and Computation | 2010-02-09 | Paper |
CONSTRUCTING OPTIMAL HIGHWAYS
International Journal of Foundations of Computer Science | 2009-04-14 | Paper |
scientific article; zbMATH DE number 5542494 (Why is no real title available?)
| 2009-04-14 | Paper |
I/O-Efficient Flow Modeling on Fat Terrains
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Aperture-angle and Hausdorff-approximation of convex figures
Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 | 2009-02-12 | Paper |
Aperture-angle and Hausdorff-approximation of convex figures
Discrete \& Computational Geometry | 2008-12-02 | Paper |
Farthest-Polygon Voronoi Diagrams
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Computing a minimum-dilation spanning tree is NP-hard
Computational Geometry | 2008-09-19 | Paper |
Sparse geometric graphs with small dilation
Computational Geometry | 2008-06-18 | Paper |
PARABOLA SEPARATION QUERIES AND THEIR APPLICATION TO STONE THROWING
International Journal of Computational Geometry & Applications | 2008-05-14 | Paper |
Helly-type theorems for line transversals to disjoint unit balls
Discrete \& Computational Geometry | 2008-04-16 | Paper |
Computational geometry. Algorithms and applications.
| 2008-03-25 | Paper |
Throwing Stones Inside Simple Polygons
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
Finding a guard that sees most and a shop that sells most
Discrete \& Computational Geometry | 2007-06-21 | Paper |
The Hadwiger number of Jordan regions is unbounded
Discrete \& Computational Geometry | 2007-06-21 | Paper |
Maximizing the overlap of two planar convex sets under rigid motions
Computational Geometry | 2007-03-15 | Paper |
Area-preserving approximations of polygonal paths
Journal of Discrete Algorithms | 2007-02-14 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Casting with skewed ejection direction
Algorithmica | 2006-08-16 | Paper |
Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets
Computational Geometry | 2006-04-28 | Paper |
THE REFLEX-FREE HULL
International Journal of Computational Geometry & Applications | 2005-12-09 | 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 |
REACHING A POLYGON WITH DIRECTIONAL UNCERTAINTY
International Journal of Computational Geometry & Applications | 2005-06-10 | Paper |
Geometric permutations of disjoint unit spheres
Computational Geometry | 2005-05-12 | Paper |
Optimal spanners for axis-aligned rectangles
Computational Geometry | 2005-02-09 | Paper |
Hierarchical decompositions and circular ray shooting in simple polygons
Discrete \& Computational Geometry | 2005-01-25 | Paper |
Competitive facility location: the Voronoi game
Theoretical Computer Science | 2004-10-27 | Paper |
The one-round Voronoi game
Discrete \& Computational Geometry | 2004-03-11 | Paper |
Spanning trees crossing few barriers
Discrete \& Computational Geometry | 2004-02-05 | Paper |
On simplifying dot maps.
Computational Geometry | 2004-01-23 | Paper |
scientific article; zbMATH DE number 1979506 (Why is no real title available?)
| 2003-09-14 | Paper |
Casting a polyhedron with directional uncertainty
Computational Geometry | 2003-08-25 | Paper |
Computing farthest neighbors on a convex polytope.
Theoretical Computer Science | 2003-08-17 | Paper |
Building bridges between convex regions
Computational Geometry | 2003-05-19 | Paper |
Voronoi diagrams on the sphere
Computational Geometry | 2003-03-10 | Paper |
scientific article; zbMATH DE number 1798165 (Why is no real title available?)
| 2002-11-04 | Paper |
scientific article; zbMATH DE number 1796963 (Why is no real title available?)
| 2002-09-05 | Paper |
scientific article; zbMATH DE number 1670669 (Why is no real title available?)
| 2001-12-19 | Paper |
scientific article; zbMATH DE number 1568057 (Why is no real title available?)
| 2001-02-21 | Paper |
scientific article; zbMATH DE number 1433426 (Why is no real title available?)
| 2000-04-18 | Paper |
Computing the maximum overlap of two convex polygons under translations
Theory of Computing Systems | 1998-11-11 | Paper |
scientific article; zbMATH DE number 1182927 (Why is no real title available?)
| 1998-08-02 | Paper |
Vertical decomposition of a single cell in a three-dimensional arrangement of surfaces
Discrete \& Computational Geometry | 1998-07-27 | Paper |
Approximation of convex figures by pairs of rectangles
Computational Geometry | 1998-06-08 | Paper |
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
SIAM Journal on Computing | 1998-05-10 | Paper |
Computing Many Faces in Arrangements of Lines and Segments
SIAM Journal on Computing | 1998-05-10 | Paper |
scientific article; zbMATH DE number 1033560 (Why is no real title available?)
| 1997-07-14 | Paper |
Reaching a goal with directional uncertainty
Theoretical Computer Science | 1997-02-28 | Paper |
Range searching in low-density environments
Information Processing Letters | 1997-02-27 | Paper |
Point location in zones of \(k\)-flats in arrangements
Computational Geometry | 1996-07-14 | Paper |
A deterministic algorithm for the three-dimensional diameter problem
Computational Geometry | 1996-07-14 | Paper |
The overlay of lower envelopes and its applications
Discrete \& Computational Geometry | 1996-06-27 | Paper |
Bounds on the size of merging networks
Discrete Applied Mathematics | 1996-03-18 | Paper |
CUTTINGS AND APPLICATIONS
International Journal of Computational Geometry & Applications | 1996-02-01 | Paper |
On lazy randomized incremental construction
Discrete \& Computational Geometry | 1995-11-29 | Paper |
Piecewise linear paths among convex obstacles
Discrete \& Computational Geometry | 1995-08-01 | Paper |
Computing and Verifying Depth Orders
SIAM Journal on Computing | 1994-05-10 | Paper |
A SIMPLE ON-LINE RANDOMIZED INCREMENTAL ALGORITHM FOR COMPUTING HIGHER ORDER VORONOI DIAGRAMS
International Journal of Computational Geometry & Applications | 1993-10-17 | Paper |
On ray shooting in convex polytopes
Discrete \& Computational Geometry | 1993-09-30 | Paper |
scientific article; zbMATH DE number 108277 (Why is no real title available?)
| 1993-01-23 | Paper |
Euclidean minimum spanning trees and bichromatic closest pairs
Discrete \& Computational Geometry | 1992-06-25 | Paper |
Parallel computation of distance transforms
Algorithmica | 1992-06-25 | Paper |
scientific article; zbMATH DE number 4206040 (Why is no real title available?)
| 1990-01-01 | Paper |
