| Publication | Date of Publication | Type |
|---|
Finding the medial axis of a simple polygon in linear time
| 2023-03-21 | Paper |
Counting and reporting red/blue segment intersections
Lecture Notes in Computer Science | 2023-01-18 | Paper |
Computing common tangents without a separating line
Lecture Notes in Computer Science | 2022-12-16 | Paper |
Convex polygons made from few lines and convex decompositions of polyhedra
Algorithm Theory — SWAT '92 | 2022-12-09 | Paper |
Input-sensitive compliant motion in the plane
SWAT 90 | 2022-12-09 | Paper |
Two- and three- dimensional point location in rectangular subdivisions
Algorithm Theory — SWAT '92 | 2022-12-09 | Paper |
Cartographic line simplication and polygon CSG formulae in \(O(n \log^* n)\) time
Lecture Notes in Computer Science | 2022-08-19 | Paper |
Linear-time reconstruction of Delaunay triangulations with applications
| 2021-12-20 | Paper |
Computation of spatial skyline points
Computational Geometry | 2021-01-07 | Paper |
Implementing streaming simplification for large labeled meshes
2010 Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Interlocked open linkages with few joints
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
Testing homotopy for paths in the plane
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
Bumpy pyramid folding
Computational Geometry | 2018-10-31 | Paper |
Visibility graphs, dismantlability, and the cops and robbers game
Computational Geometry | 2018-02-12 | Paper |
Kinetic collision detection for simple polygons
Proceedings of the sixteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Almost-Delaunay simplices, nearest neighbor relations for imprecise points
| 2015-08-03 | Paper |
Computing planar Voronoi diagrams in double precision, a further example of degree-driven algorithm design
Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
Fitting spheres to electron density
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
Number of crossing-free geometric graphs vs. Triangulations
Electronic Notes in Discrete Mathematics | 2013-06-28 | Paper |
Reconstructing polygons from scanner data
Theoretical Computer Science | 2011-07-27 | Paper |
Degree-driven design for correct geometric algorithms
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2011-06-03 | Paper |
Lossless compression of predicted floating-point geometry
CAD. Computer-Aided Design | 2011-03-04 | Paper |
Almost all Delaunay triangulations have stretch factor greater than \(\pi /2\)
Computational Geometry | 2011-01-31 | Paper |
Capturing crossings: convex hulls of segment and plane intersections
Information Processing Letters | 2010-04-19 | Paper |
Computation of non-dominated points using compact Voronoi diagrams
WALCOM: Algorithms and Computation | 2010-02-09 | Paper |
Reconstructing polygons from scanner data
Algorithms and Computation | 2009-12-17 | Paper |
Isocontour based Visualization of Time-varying Scalar Fields
Mathematics and Visualization | 2009-12-11 | Paper |
Delaunay triangulation of imprecise points in linear time after preprocessing
Computational Geometry | 2009-11-16 | Paper |
Computing the Implicit Voronoi Diagram in Triple Precision
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree
Computational Geometry | 2009-10-16 | Paper |
Representing Interpolant Topology for Contour Tree Computation
Mathematics and Visualization | 2009-05-20 | Paper |
How long can a graph be kept planar?
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Delaunay triangulations of imprecise pointsin linear time after preprocessing
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
Quadratic and cubic b-splines by generalizing higher-order voronoi diagrams
Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 | 2009-02-12 | Paper |
scientific article; zbMATH DE number 5506243 (Why is no real title available?)
| 2009-02-10 | Paper |
scientific article; zbMATH DE number 5506187 (Why is no real title available?)
| 2009-02-10 | Paper |
FARAWAY POINT: A SENTINEL POINT FOR DELAUNAY COMPUTATION
International Journal of Computational Geometry & Applications | 2008-09-29 | Paper |
Time-varying Reeb graphs for continuous space-time data
Computational Geometry | 2008-09-19 | Paper |
Efficient algorithms for maximum regression depth
Discrete & Computational Geometry | 2008-08-19 | Paper |
Faster placement of hydrogens in protein structures by dynamic programming
ACM Journal of Experimental Algorithmics | 2008-06-20 | Paper |
Delineating boundaries for imprecise regions
Algorithmica | 2008-04-03 | Paper |
Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL
Computational Geometry | 2007-07-04 | Paper |
Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
SIAM Journal on Computing | 2007-06-26 | Paper |
Maximum independent set for intervals by divide and conquer with pruning
Networks | 2007-03-30 | Paper |
scientific article; zbMATH DE number 5019916 (Why is no real title available?)
| 2006-04-28 | Paper |
THE REFLEX-FREE HULL
International Journal of Computational Geometry & Applications | 2005-12-09 | Paper |
Polygonal path simplification with angle constraints
Computational Geometry | 2005-11-01 | Paper |
A lower bound for multicast key distribution
Computer Networks | 2005-02-09 | Paper |
ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
Computing a \((1+\varepsilon)\)-approximate geometric minimum-diameter spanning tree
Algorithmica | 2004-09-22 | Paper |
Testing homotopy for paths in the plane
Discrete & Computational Geometry | 2004-03-11 | Paper |
Spanning trees crossing few barriers
Discrete & Computational Geometry | 2004-02-05 | Paper |
Interlocked open and closed linkages with few joints.
Computational Geometry | 2003-07-01 | Paper |
Spirale reversi: Reverse decoding of the edgebreaker encoding
Computational Geometry | 2003-06-03 | Paper |
Tight degree bounds for pseudo-triangulations of points
Computational Geometry | 2003-05-19 | Paper |
The Safari interface for visualizing time-dependent volume data using iso-surfaces and contour spectra
Computational Geometry | 2003-05-19 | Paper |
Compressing the Property Mapping of Polygon Meshes
Graphical Models | 2003-05-14 | Paper |
Computing contour trees in all dimensions
Computational Geometry | 2003-04-28 | Paper |
The size of spanning disks for polygonal curves
Discrete & Computational Geometry | 2003-03-17 | Paper |
Some aperture-angle optimization problems
Algorithmica | 2002-12-01 | Paper |
scientific article; zbMATH DE number 1786518 (Why is no real title available?)
| 2002-08-21 | Paper |
Efficiently approximating polygonal paths in three and higher dimensions
Algorithmica | 2002-06-17 | Paper |
Polygonal path approximation with angle constraints
| 2002-01-30 | Paper |
A one-step crust and skeleton extraction algorithm
Algorithmica | 2001-10-14 | Paper |
Generalizing ham sandwich cuts to equitable subdivisions
Discrete & Computational Geometry | 2001-08-16 | Paper |
scientific article; zbMATH DE number 1617271 (Why is no real title available?)
| 2001-07-11 | Paper |
Efficient algorithms for line and curve segment intersection using restricted predicates
Computational Geometry | 2001-04-09 | Paper |
On exclusion regions for optimal triangulations
Discrete Applied Mathematics | 2001-04-04 | Paper |
scientific article; zbMATH DE number 1568057 (Why is no real title available?)
| 2001-02-21 | Paper |
COMPUTING CONSTRAINED SHORTEST SEGMENTS: BUTTERFLY WINGSPANS IN LOGARITHMIC TIME
International Journal of Computational Geometry & Applications | 2000-11-07 | Paper |
Queries with segments in Voronoi diagrams
Computational Geometry | 2000-06-05 | Paper |
scientific article; zbMATH DE number 1445395 (Why is no real title available?)
| 2000-05-10 | Paper |
Removing degeneracies by perturbing the problem or perturbing the world
Reliable Computing | 2000-03-22 | Paper |
Cross-ratios and angles determine a polygon
Discrete & Computational Geometry | 1999-11-25 | Paper |
scientific article; zbMATH DE number 1305399 (Why is no real title available?)
| 1999-06-17 | Paper |
Finding the medial axis of a simple polygon in linear time
Discrete & Computational Geometry | 1999-05-27 | Paper |
On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time
Computational Geometry | 1999-05-03 | Paper |
scientific article; zbMATH DE number 1182923 (Why is no real title available?)
| 1999-03-02 | Paper |
Cartographic line simplification and polygon CSG formulae in \(O(n\log^* n)\) time
Computational Geometry | 1999-02-02 | Paper |
Fitting a set of points by a circle
Discrete & Computational Geometry | 1998-12-02 | Paper |
Primal dividing and dual pruning: Output-sensitive construction of four-dimensional polytopes and three-dimensional Voronoi diagrams
Discrete & Computational Geometry | 1998-07-27 | Paper |
Erased arrangements of linear and convex decompositions of polyhedra
Computational Geometry | 1998-04-13 | Paper |
Optimal Algorithms to Embed Trees in a Point Set
Journal of Graph Algorithms and Applications | 1998-04-01 | Paper |
Generating random polygons with given vertices
Computational Geometry | 1997-03-03 | Paper |
Efficiently Planning Compliant Motion in the Plane
SIAM Journal on Computing | 1996-11-26 | Paper |
Folding rulers inside triangles
Discrete & Computational Geometry | 1996-09-22 | Paper |
scientific article; zbMATH DE number 910884 (Why is no real title available?)
| 1996-08-22 | Paper |
Point location in zones of \(k\)-flats in arrangements
Computational Geometry | 1996-07-14 | Paper |
A compact piecewise-linear Voronoi diagram for convex sites in the plane
Discrete & Computational Geometry | 1996-02-13 | Paper |
Objects that cannot be taken apart with two hands
Discrete & Computational Geometry | 1995-05-29 | Paper |
scientific article; zbMATH DE number 741008 (Why is no real title available?)
| 1995-04-05 | Paper |
MINIMUM-LINK C-ORIENTED PATHS: SINGLE-SOURCE QUERIES
International Journal of Computational Geometry & Applications | 1995-01-26 | Paper |
APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
International Journal of Computational Geometry & Applications | 1995-01-02 | Paper |
scientific article; zbMATH DE number 432762 (Why is no real title available?)
| 1994-09-19 | Paper |
Ray shooting in polygons using geodesic triangulations
Algorithmica | 1994-08-10 | Paper |
Efficient ray shooting and hidden surface removal
Algorithmica | 1994-08-10 | Paper |
An optimal algorithm for the on-line closest-pair problem
Algorithmica | 1994-08-10 | Paper |
Computing minimum length paths of a given homotopy class
Computational Geometry | 1994-07-21 | Paper |
Computing a Face in an Arrangement of Line Segments and Related Problems
SIAM Journal on Computing | 1994-02-24 | Paper |
scientific article; zbMATH DE number 432847 (Why is no real title available?)
| 1993-10-20 | Paper |
An efficient algorithm for finding the CSG representation of a simple polygon
Algorithmica | 1993-09-01 | Paper |
Stabbing parallel segments with a convex polygon
Computer Vision, Graphics, and Image Processing | 1993-08-24 | Paper |
scientific article; zbMATH DE number 177559 (Why is no real title available?)
| 1993-05-18 | Paper |
scientific article; zbMATH DE number 176772 (Why is no real title available?)
| 1993-05-18 | Paper |
scientific article; zbMATH DE number 140472 (Why is no real title available?)
| 1993-03-28 | Paper |
Counting and cutting cycles of lines and rods in space
Computational Geometry | 1992-09-27 | Paper |
COMPACT INTERVAL TREES: A DATA STRUCTURE FOR CONVEX HULLS
International Journal of Computational Geometry & Applications | 1991-01-01 | Paper |
Implicitly representing arrangements of lines or segments
Discrete & Computational Geometry | 1989-01-01 | Paper |
On arrangements of Jordan arcs with three intersections per pair
Discrete & Computational Geometry | 1989-01-01 | Paper |
