• Publications
  • Influence
Incremental constructions con BRIO
TLDR
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns. Expand
  • 125
  • 14
  • PDF
The convergence rate of the sandwich algorithm for approximating convex functions
  • G. Rote
  • Mathematics, Computer Science
  • Computing
  • 1 March 1992
TLDR
The Sandwich algorithm approximates a convex function of one variable over an interval by evaluating the function and its derivative at a sequence of points.Different versions of the Sandwich algorithm use different rules for selecting the next evaluation point. Expand
  • 91
  • 14
Minimum-weight triangulation is NP-hard
TLDR
We prove that the decision version of the minimum-weight triangulation problem is NP-hard, using a reduction from PLANAR 1-IN-3-SAT. Expand
  • 127
  • 13
  • PDF
Minimum weight triangulation is NP-hard
TLDR
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S that minimizes the sum of the edge lengths. Expand
  • 77
  • 13
Matching planar maps
TLDR
The subject of this paper are algorithms for measuring similarity of patterns of line segments in the plane, a standard problem in, e.g. computer vision, geographic information systems, etc. Expand
  • 197
  • 10
  • PDF
Simple and optimal output-sensitive construction of contour trees using monotone paths
TLDR
We present a new algorithm that avoids sorting of the whole dataset, but sorts only a subset of so-called component-critical points. Expand
  • 82
  • 10
  • PDF
Computing the Minimum Hausdorff Distance Between Two Point Sets on a Line Under Translation
  • G. Rote
  • Mathematics, Computer Science
  • Inf. Process. Lett.
  • 17 May 1991
TLDR
We solve the one-dimensional version of the Max Gap problem for two point sets on a line in linear time. Expand
  • 197
  • 7
Expansive Motions and the Polytope of Pointed Pseudo-Triangulations
We introduce the polytope of pointed pseudo-triangulations of a point set in the plane, defined as the polytope of infinitesimal expansive motions of the points subject to certain constraints on theExpand
  • 110
  • 7
  • PDF
Sequences With Subword Complexity 2n
Abstract We construct and discuss infinite 0-1-sequences which contain 2 n different sub-words of length n , for every n .
  • 94
  • 7