| Publication | Date of Publication | Type |
|---|
Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear-time
Lecture Notes in Computer Science | 2023-05-08 | Paper |
| Finding the medial axis of a simple polygon in linear time | 2023-03-21 | Paper |
| A new subgraph of minimum weight triangulations | 2023-01-25 | Paper |
Triangulations without minimum-weight drawing
Information Processing Letters | 2016-06-16 | Paper |
On constrained minimum pseudotriangulations
Lecture Notes in Computer Science | 2011-03-18 | Paper |
How much precision is needed to compare two sums of square roots of integers?
Information Processing Letters | 2010-01-29 | Paper |
Construction of the nearest neighbor embracing graph of a point set
Journal of Combinatorial Optimization | 2008-04-04 | Paper |
Progress on maximum weight triangulation
Computational Geometry | 2006-04-28 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
| scientific article; zbMATH DE number 2185620 (Why is no real title available?) | 2005-07-04 | Paper |
| scientific article; zbMATH DE number 2185617 (Why is no real title available?) | 2005-07-04 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2005-06-15 | Paper |
A linear-time approximation scheme for maximum weight triangulation of convex polygons
Algorithmica | 2005-02-11 | Paper |
Minimal tetrahedralizations of a class of polyhedra
Journal of Combinatorial Optimization | 2004-11-22 | Paper |
Detecting tetrahedralizations of a set of line segments
Journal of Algorithms | 2004-11-12 | Paper |
A lower bound for \(\beta\)-skeleton belonging to minimum weight triangulations
Computational Geometry | 2002-08-14 | Paper |
Maximum weight triangulation and graph drawing
Information Processing Letters | 2002-07-25 | Paper |
| Approximation for minimum triangulation of convex polyhedra | 2002-07-22 | Paper |
| scientific article; zbMATH DE number 1696645 (Why is no real title available?) | 2002-07-01 | Paper |
Approximation for minimum triangulations of simplicial convex 3-polytopes
Discrete & Computational Geometry | 2002-02-07 | Paper |
| scientific article; zbMATH DE number 1629854 (Why is no real title available?) | 2001-11-06 | Paper |
Computing a minimum weight triangulation of a sparse point set
Journal of Global Optimization | 2001-01-30 | Paper |
On some polyhedra covering problems
Journal of Combinatorial Optimization | 2001-01-25 | Paper |
| scientific article; zbMATH DE number 1555973 (Why is no real title available?) | 2001-01-24 | Paper |
Three-dimensional weak visibility: Complexity and applications
Theoretical Computer Science | 2000-08-21 | Paper |
Finding the medial axis of a simple polygon in linear time
Discrete & Computational Geometry | 1999-05-27 | Paper |
| scientific article; zbMATH DE number 1222816 (Why is no real title available?) | 1999-03-30 | Paper |
Finding constrained and weighted Voronoi diagrams in the plane
Computational Geometry | 1998-06-08 | Paper |
Efficiently updating constrained Delaunay triangulations
BIT | 1993-11-30 | Paper |
Duality of constrained Voronoi diagrams and Delaunay triangulations
Algorithmica | 1993-04-01 | Paper |
Finding minimal nested polygons
BIT | 1991-01-01 | Paper |
An O(log n) time parallel algorithm for triangulating a set of points in the plane
Information Processing Letters | 1987-01-01 | Paper |
