| Publication | Date of Publication | Type |
|---|
Separating translates in the plane: Combinatorial bounds and an algorithm
Algorithm Theory — SWAT '94 | 2022-12-09 | Paper |
The number of lines tangent to arbitrary convex polyhedra in 3D
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
The homogeneous set sandwich problem
Information Processing Letters | 2016-06-09 | Paper |
Farthest-polygon Voronoi diagrams
Computational Geometry | 2011-03-25 | Paper |
Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices
Discrete & Computational Geometry | 2010-03-04 | Paper |
The Voronoi diagram of three lines
Discrete & Computational Geometry | 2009-07-06 | Paper |
On the complexity of umbra and penumbra
Computational Geometry | 2009-06-30 | Paper |
On the degree of standard geometric predicates for line transversals in 3D
Computational Geometry | 2009-06-18 | Paper |
The Voronoi diagram of three lines
| 2009-02-12 | Paper |
Between umbra and penumbra
| 2009-02-12 | Paper |
Drawing Kn in Three Dimensions with One Bend per Edge
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Farthest-Polygon Voronoi Diagrams
Algorithms – ESA 2007 | 2008-09-25 | Paper |
MAINTAINING VISIBILITY INFORMATION OF PLANAR POINT SETS WITH A MOVING VIEWPOINT
International Journal of Computational Geometry & Applications | 2008-05-14 | Paper |
ON THE EXPECTED SIZE OF THE 2D VISIBILITY COMPLEX
International Journal of Computational Geometry & Applications | 2008-05-14 | Paper |
PARABOLA SEPARATION QUERIES AND THEIR APPLICATION TO STONE THROWING
International Journal of Computational Geometry & Applications | 2008-05-14 | Paper |
Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra
SIAM Journal on Computing | 2008-04-22 | Paper |
Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices
Graph Drawing | 2008-03-25 | Paper |
Throwing Stones Inside Simple Polygons
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
Bull-Reducible Berge Graphs are Perfect
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Transversals to line segments in three-dimensional space
Discrete & Computational Geometry | 2005-11-10 | Paper |
The perfection and recognition of bull-reducible Berge graphs
RAIRO - Theoretical Informatics and Applications | 2005-06-07 | Paper |
PROPERTIES OF ARRANGEMENT GRAPHS
International Journal of Computational Geometry & Applications | 2005-03-30 | 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 |
The Expected Number of 3D Visibility Events Is Linear
SIAM Journal on Computing | 2004-01-08 | Paper |
Even pairs
| 2002-07-28 | Paper |
scientific article; zbMATH DE number 1472140 (Why is no real title available?)
| 2001-01-14 | Paper |
Planar segment visibility graphs
Computational Geometry | 2000-09-14 | Paper |
The Graham scan triangulates simple polygons
Pattern Recognition Letters | 2000-08-01 | Paper |
The union of moving polygonal pseudodiscs -- combinatorial bounds and applications
Computational Geometry | 1999-05-17 | Paper |
Stabbing information of a simple polygon
Discrete Applied Mathematics | 1999-03-30 | Paper |
The largest \(k\)-ball in a \(d\)-dimensional box
Computational Geometry | 1998-12-21 | Paper |
A Visibility Representation for Graphs in Three Dimensions
Journal of Graph Algorithms and Applications | 1998-07-05 | Paper |
Separating Translates in the Plane: Combinatorial Bounds and an Algorithm
International Journal of Computational Geometry & Applications | 1998-05-25 | Paper |
Path parity and perfection
Discrete Mathematics | 1998-01-12 | Paper |
An algorithm for finding homogeneous pairs
Discrete Applied Mathematics | 1997-11-09 | Paper |
Edge guarding polyhedral terrains
Computational Geometry | 1997-09-04 | Paper |
AN OPTIMAL ALGORITHM FOR COMPUTING (≤K)-LEVELS, WITH APPLICATIONS
International Journal of Computational Geometry & Applications | 1997-03-31 | Paper |
TRANSLATION QUERIES FOR SETS OF POLYGONS
International Journal of Computational Geometry & Applications | 1996-04-16 | Paper |
Slicing an ear using prune-and-search
Pattern Recognition Letters | 1994-01-02 | Paper |
scientific article; zbMATH DE number 432849 (Why is no real title available?)
| 1993-10-20 | Paper |
