#### Filter Results:

- Full text PDF available (114)

#### Publication Year

1985

2018

- This year (4)
- Last 5 years (44)
- Last 10 years (81)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Wolfgang Mulzer, Günter Rote
- Symposium on Computational Geometry
- 2006

A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangulation of a given… (More)

- Nina Amenta, Sunghee Choi, Günter Rote
- Symposium on Computational Geometry
- 2003

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. We define a biased… (More)

- Helmut Alt, Alon Efrat, Günter Rote, Carola Wenk
- SODA
- 2003

The subject of this paper are algorithms for measuring the similarity of patterns of line segments in the plane, a standard problem in, e.g. computer vision, geographic information systems, etc. More… (More)

- Tetsuo Asano, Günter Rote
- CCCG
- 2009

Constant-work-space algorithms may use only constantly many cells of storage in addition to their input, which is provided as a read-only array. We show how to construct several geometric structures… (More)

- Robert Connelly, Erik D. Demaine, Günter Rote
- FOCS
- 2000

Consider a planar linkage, consisting of disjoint polygonal arcs and cycles of rigid bars joined at incident endpoints (polygonal chains), with the property that no cycle surrounds another arc or… (More)

- Yi-Jen Chiang, Tobias Lenz, Xiang Lu, Günter Rote
- Comput. Geom.
- 2005

Contour trees are used when high-dimensional data are preprocessed for efficient extraction of isocon the purpose of visualization. So far, efficient algorithms for contour trees are based on… (More)

- Oswin Aichholzer, Helmut Alt, Günter Rote
- Int. J. Comput. Geometry Appl.
- 1997

- Günter Rote
- Computing
- 1992

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. The connection of the obtained points is… (More)

- Günter Rote
- Inf. Process. Lett.
- 1991

Given two sets of points on a line, we want to translate one of them so that their Hausdorr distance (the maximum of the distances from a point in any of the sets to the nearest point in the other… (More)

- Richard Pollack, Micha Sharir, Günter Rote
- Discrete & Computational Geometry
- 1989

The geodesic center of a simple polygon is a point inside the polygon which minimizes the maximum internal distance to any point in the polygon. We present an algorithm which calculates the geodesic… (More)