Monien B., Ottmann T. (eds.) Data Structures and Efficient Algorithms. Final Report on the DFG Special Joint Initiative

Springer, 1992. — 397.The German Science Foundation (Deutsche Forschungsgemeinschaft, DFG) started a special joint intiative (Schwerpunktprogramm) entitled "Datenstrukturen und effiziente Algorithmen" in 1986. The aim of the initiative was to encourage collaborative research on algorithms, a central concept in computer science. For a period of five years about a dozen projects were funded with an emphasis on algorithms and data structures for geometric problems, on the one hand, and parallel and distributed algorithms, on the other.
The first group of projects addressed research on fundamental data structures, computational geometry, graph algorithms, computer graphics, and spatial databases. The second group of projects centered around the following problems: the design of parallel architectures and routing strategies, simulation of parallel machines, and the design of distributed algorithms for solving difficult problems.
The initiative has proven to be very successful. Within the last five years numerous results were obtained by the research groups taking part in the initiative. The results were presented at national and international conferences as well as at the annual DFG symposium organized by the iniative participants.Geometric Algorithms
Resemblance and Symmetries of Geometric Patterns
Selected Topics from Computational Geometry, Data Structures and Motion Planning
Processing of Hierarchically Defined Graphs and Graph Families
The Combination of Spatial Access Methods and Computational Geometry in Geographic Database Systems
A Flexible and Extensible Index Manager for Spatial Database Systems
The Performance of Object Decomposition Techniques for Spatial Query Processing
Distributed Image Synthesis with Breadth-First Ray Tracing and the Ray-Z-Buffer
Restricted Orientation Computational Geometry
Monotonous Bisector Trees – A Tool for Efficient Partitioning of Complex Scenes of Geometric Objects
Learning Convex Sets under Uniform Distribution
Spatial Access Structures for Geometric Databases
On Spanning Trees with Low Crossing Numbers
Parallel and Distributed Algorithms
High Performance Universal Hashing, with Applications to Shared Memory Simulations
Distributed Game Tree Search on a Massively Parallel System
Balanced Strategies for Routing on Meshes
Complexity of Boolean Functions on PRAMs – Lower Bound Techniques
Enumerative vs. Genetic Optimization. Two Parallel Algorithms for the Bin Packing Problem
Area Efficient Methods to Increase the Reliability of Circuits