Uni-Logo

Institut für Informatik
 

Technical Reports from 1991


Here follows a list of all Technical Reports from 1991. By following the respective links, you can have a look at a report's abstract or the postscript version. Generally, the abstracts are written in English, since most of the reports are in this language.

Report No.42, December 1991 (PostScript)
Heinrich Müller, Michael Stark:
Adaptive Generation of Surfaces in Volume Data
(Abstract)

Report No.41, December 1991 (PostScript)
Detlef Ruprecht, Heinrich Müller:
Free Form Deformation with Scattered Data Interpolation Methods
(Abstract)

Report No.40, December 1991 (PostScript)
Sven Schuierer, Derick Wood:
Restricted Orientation Visibility
(Abstract)

Report No.39, October 1991 (PostScript)
Gabriele Reich:
Finitely-Oriented Shortest Paths in the Presence of Polygonal Obstacles
(Abstract)

Report No.38, October 1991 (PostScript)
Anne Brüggemann-Klein, Derick Wood:
Deterministic Regular Languages
(Abstract)

Report No.37, September 1991 (PostScript)
Sven Schuierer, Derick Wood:
Visibility in Semi-convex Spaces
(Abstract)

Report No.36, August 1991 (PostScript)
Bruno Becker, Paolo Giulio Franciosa, Stephan Gschwind, Thomas Ohler, Gerald Thiemt, Peter Widmayer:
Enclosing Many Boxes by an Optimal Pair of Boxes
(Abstract)

Report No.35, August 1991 (PostScript)
Bruno Becker, Paolo Giulio Franciosa, Stephan Gschwind, Thomas Ohler, Gerald Thiemt, Peter Widmayer:
An Optimal Algorithm for Approximating a Set of Rectangles by Two Minimum Area Rectangles
(Abstract)

Report No.34, July 1991
Petteri Jokinen, Esko Ukkonen:
Using Suffix Automata as an Index for Approximate String Searches
(Abstract)

Report No.33, July 1991 (PostScript)
Anne Brüggemann-Klein:
Regular Expressions into Finite Automata
(Abstract)

Report No.32, July 1991 (PostScript)
Edmund Ihler:
The Complexity of Approximating the Class Steiner Tree Problem
(Abstract)

Report No.31, July 1991 (PostScript)
Bengt J. Nilsson, Sven Schuierer:
An Optimal Algorithm for the Rectilinear Link Center of a Rectilinear Polygon
(Abstract)

Report No.30, July 1991 (PostScript)
Edmund Ihler, Gabriele Reich, Peter Widmayer:
On Shortest Networks for Classes of Points in the Plane
(Abstract)

Report No.29, May 1991
Esko Ukkonen:
Approximate String Matching with $q$-grams and Maximal Matches
(Abstract)

Report No.28, April 1991 (PostScript)
Svante Carlsson, Bengt J. Nilsson, Simeon Ntafos:
Optimum Guard Covers and $m$-Watchmen Routes for Histograms
(Abstract)