| Publication | Date of Publication | Type |
|---|
The influence of dimensions on the complexity of computing decision trees
Artificial Intelligence | 2025-05-30 | Paper |
| A Note on the 2-Colored Rectilinear Crossing Number of Random Point Sets in the Unit Square | 2023-12-04 | Paper |
Inserting one edge into a simple drawing is hard
Discrete & Computational Geometry | 2023-03-09 | Paper |
Inserting one edge into a simple drawing is hard
Graph-Theoretic Concepts in Computer Science | 2022-12-21 | Paper |
Four results on randomized incremental constructions
STACS 92 | 2022-08-18 | Paper |
A tail estimate for Mulmuley's segment intersection algorithm
Automata, Languages and Programming | 2019-12-04 | Paper |
On the exact computation of the topology of real algebraic curves
Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
Counting triangulations and other crossing-free structures approximately
Computational Geometry | 2015-04-27 | Paper |
A simple aggregative algorithm for counting triangulations of planar point sets and related problems
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
| Data-specific analysis of string sorting | 2014-05-22 | Paper |
Convex hulls of spheres and convex hulls of disjoint convex polytopes
Computational Geometry | 2013-04-29 | Paper |
Can nearest neighbor searching be simple and always fast?
Algorithms – ESA 2011 | 2011-09-16 | Paper |
| scientific article; zbMATH DE number 5853979 (Why is no real title available?) | 2011-02-21 | Paper |
Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
Computational Geometry | 2010-07-28 | Paper |
Upper bound on the number of vertices of polyhedra with 0,1-constraint matrices
Information Processing Letters | 2010-01-29 | Paper |
Approximating the minimum weight spanning tree of a set of points in the Hausdorff metric
Computational Geometry | 2009-11-16 | Paper |
Maintaining Ideally Distributed Random Search Trees without Extra Space
Lecture Notes in Computer Science | 2009-11-12 | Paper |
On the complexity of umbra and penumbra
Computational Geometry | 2009-06-30 | Paper |
On the Number of Cycles in Planar Graphs
Lecture Notes in Computer Science | 2009-03-06 | Paper |
On Computing the Centroid of the Vertices of an Arrangement and Related Problems
Lecture Notes in Computer Science | 2009-02-17 | Paper |
| Between umbra and penumbra | 2009-02-12 | Paper |
On the all-pairs-shortest-path problem in unweighted undirected graphs.
Journal of Computer and System Sciences | 2008-12-21 | Paper |
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
MAXIMIZING A VORONOI REGION: THE CONVEX CASE
International Journal of Computational Geometry & Applications | 2005-11-29 | Paper |
Top-Down Analysis of Path Compression
SIAM Journal on Computing | 2005-09-16 | Paper |
| scientific article; zbMATH DE number 2079644 (Why is no real title available?) | 2004-07-30 | Paper |
| scientific article; zbMATH DE number 1979535 (Why is no real title available?) | 2003-09-14 | Paper |
A better upper bound on the number of triangulations of a planar point set
Journal of Combinatorial Theory. Series A | 2003-05-27 | Paper |
On the Exact Worst Case Query Complexity of Planar Point Location
Journal of Algorithms | 2001-10-30 | Paper |
| scientific article; zbMATH DE number 1303604 (Why is no real title available?) | 1999-06-17 | Paper |
Note on the number of triangulations of planar point sets
Combinatorica | 1999-05-18 | Paper |
Checking geometric programs or verification of geometric structures
Computational Geometry | 1999-05-03 | Paper |
| scientific article; zbMATH DE number 1182912 (Why is no real title available?) | 1998-08-02 | Paper |
How good are convex hull algorithms?
Computational Geometry | 1997-12-08 | Paper |
The upper bound theorem for polytopes: An easy proof of its asymptotic version
Computational Geometry | 1995-10-29 | Paper |
Selecting Heavily Covered Points
SIAM Journal on Computing | 1995-04-06 | Paper |
| scientific article; zbMATH DE number 431985 (Why is no real title available?) | 1993-11-11 | Paper |
Four results on randomized incremental constructions
Computational Geometry | 1993-11-01 | Paper |
On compatible triangulations of simple polygons
Computational Geometry | 1993-08-23 | Paper |
On the Zone Theorem for Hyperplane Arrangements
SIAM Journal on Computing | 1993-05-17 | Paper |
Counting and cutting cycles of lines and rods in space
Computational Geometry | 1992-09-27 | Paper |
Arrangements of curves in the plane --- topology, combinatorics, and algorithms
Theoretical Computer Science | 1992-06-28 | Paper |
On the difficulty of triangulating three-dimensional nonconvex polyhedra
Discrete & Computational Geometry | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 17662 (Why is no real title available?) | 1992-06-26 | Paper |
Small-dimensional linear programming and convex hulls made easy
Discrete & Computational Geometry | 1992-06-25 | Paper |
A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
Computational Geometry | 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 |
| scientific article; zbMATH DE number 4060713 (Why is no real title available?) | 1988-01-01 | Paper |
Computing the link center of a simple polygon
Discrete & Computational Geometry | 1988-01-01 | Paper |
Computing convolutions by reciprocal search
Discrete & Computational Geometry | 1987-01-01 | Paper |
Voronoi diagrams and arrangements
Discrete & Computational Geometry | 1986-01-01 | Paper |
Constructing Arrangements of Lines and Hyperplanes with Applications
SIAM Journal on Computing | 1986-01-01 | Paper |
The Ultimate Planar Convex Hull Algorithm?
SIAM Journal on Computing | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3945384 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3945383 (Why is no real title available?) | 1985-01-01 | Paper |
Some methods of computational geometry applied to computer graphics
Computer Vision, Graphics, and Image Processing | 1984-01-01 | Paper |
On the shape of a set of points in the plane
IEEE Transactions on Information Theory | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3854464 (Why is no real title available?) | 1982-01-01 | Paper |
