Randomized Incremental Construction Of Delaunay Triangulations Of Nice Point Sets | 0 | 0.34 | 2021 |

Expected Length of the Voronoi Path in a High Dimensional Poisson–Delaunay Triangulation | 0 | 0.34 | 2018 |

On Order Types of Random Point Sets. | 0 | 0.34 | 2018 |

Walking in a Planar Poisson-Delaunay Triangulation: Shortcuts in the Voronoi Path. | 0 | 0.34 | 2018 |

3D Snap Rounding. | 0 | 0.34 | 2018 |

Array-Based Compact Data Structures For Triangulations: Practical Solutions With Theoretical Guarantees | 0 | 0.34 | 2018 |

Canonical Ordering For Graphs On The Cylinder, With Applications To Periodic Straight-Line Drawings On The Flat Cylinder And Torus | 0 | 0.34 | 2018 |

Delaunay Triangulations of Points on Circles. | 0 | 0.34 | 2018 |

Monotone Simultaneous Paths Embeddings in $\mathbb{R}^d$. | 0 | 0.34 | 2018 |

Qualitative Symbolic Perturbation: Two Applications Of A New Geometry-Based Perturbation Framework | 0 | 0.34 | 2017 |

The worst visibility walk in a random Delaunay triangulation is $O(\sqrt{n})$. | 3 | 0.44 | 2016 |

Monotone Simultaneous Embeddings Of Paths In D Dimensions | 0 | 0.34 | 2016 |

Guest Editors' Foreword | 0 | 0.34 | 2015 |

Recognizing Shrinkable Complexes Is Np-Complete | 0 | 0.34 | 2014 |

Homological reconstruction and simplification in R3 | 1 | 0.34 | 2013 |

Complexity analysis of random geometric structures made simpler | 4 | 0.57 | 2013 |

Oja centers and centers of gravity | 2 | 0.37 | 2013 |

A Tight Bound for the Delaunay Triangulation of Points on a Polyhedron | 1 | 0.37 | 2012 |

The monotonicity of f-vectors of random polytopes | 0 | 0.34 | 2012 |

Catalog-Based Representation Of 2d Triangulations | 6 | 0.43 | 2011 |

Vertex removal in two-dimensional Delaunay triangulation: Speed-up by low degrees optimization | 4 | 0.50 | 2011 |

Explicit array-based compact data structures for triangulations | 4 | 0.41 | 2011 |

Perturbations for Delaunay and weighted Delaunay 3D triangulations | 7 | 0.67 | 2011 |

On the complexity of umbra and penumbra | 2 | 0.37 | 2009 |

Filtering relocations on a Delaunay triangulation | 10 | 0.76 | 2009 |

Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension | 27 | 1.22 | 2009 |

Predicates for line transversals to lines and line segments in three-dimensional space | 1 | 0.35 | 2008 |

Succinct representations of planar maps | 8 | 0.50 | 2008 |

Maintaining Visibility Information Of Planar Point Sets With A Moving Viewpoint | 2 | 0.41 | 2007 |

Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra | 12 | 0.63 | 2007 |

Lines Tangent to Four Triangles in Three-Dimensional Space | 1 | 0.35 | 2007 |

2D Triangulation Representation Using Stable Catalogs | 3 | 0.43 | 2006 |

Succinct representation of triangulations with a boundary | 21 | 0.75 | 2005 |

Drawing Kn in three dimensions with one bend per edge | 3 | 0.49 | 2005 |

Farthest point seeding for efficient placement of streamlines | 47 | 2.01 | 2005 |

Centroidal Voronoi diagrams for isotropic surface remeshing | 33 | 1.31 | 2005 |

On the number of line tangents to four triangles in three-dimensional space | 1 | 0.36 | 2004 |

The Expected Number of 3D Visibility Events Is Linear | 11 | 0.69 | 2003 |

Efficient Exact Geometric Predicates for Delauny Triangulations | 14 | 0.92 | 2003 |

Perturbations and vertex removal in a 3D delaunay triangulation | 23 | 1.20 | 2003 |

Chromatic variants of the Erdős–Szekeres theorem on points in convex position | 13 | 1.24 | 2003 |

Culling A Set Of Points For Roundness Or Cylindricity Evaluations | 2 | 0.37 | 2003 |

Progressive lossless compression of arbitrary simplicial complexes | 71 | 2.12 | 2002 |

Splitting a Delaunay Triangulation in Linear Time | 13 | 0.71 | 2002 |

On the number of lines tangent to four convex polyhedra | 7 | 0.74 | 2002 |

Computing Roundness Is Easy If The Set Is Almost Round | 2 | 0.37 | 2002 |

Triangulations in CGAL | 58 | 2.45 | 2002 |

Circular Separability of Polygons | 5 | 0.52 | 2001 |

The Shuffling Buffer | 2 | 0.40 | 2001 |

Walking in a triangulation | 49 | 2.03 | 2001 |