+612 9045 4394
Data Structures and Efficient Algorithms : Final Report on the DFG Special Joint Initiative - Burkhard Monien

Data Structures and Efficient Algorithms

Final Report on the DFG Special Joint Initiative

By: Burkhard Monien (Editor), Thomas Ottmann (Editor)

Paperback Published: 20th May 1992
ISBN: 9783540554882
Number Of Pages: 395

Share This Book:


or 4 easy payments of $33.88 with Learn more
Ships in 5 to 9 business days

Algorithms are a central concept in computer science. TheGerman Science Foundation (DFG) started a special jointinitiative on data structures and efficient algorithms in1986 with the aim of encouraging collaborative research onalgorithms. For a period of five years about a dozenprojects were funded with an emphasis on algorithms and datastructures for geometric problems, on the one hand, andparallel and distributed algorithms, on the other.This volume contains 18 papers that are intended to give animpression of the achievements of this joint researchinitiative. The first group of papers addresses research onfundamental data structures, computational geometry, graphalgorithms, computer graphics, and spatial databases. Thesecond group of papers centers on the following problems:the design of parallel architectures and routing strategies,simulation of parallel machines, and the design ofdistributed algorithms for solving difficult problems.

Geometric Algorithms
Resemblance and Symmetries of Geometric Patternsp. 1
Selected Topics from Computational Geometry, Data Structures and Motion Planningp. 25
Processing of Hierarchically Defined Graphs and Graph Familiesp. 44
The Combination of Spatial Access Methods and Computational Geometry in Geographic Database Systemsp. 70
A Flexible and Extensible Index Manager for Spatial Database Systemsp. 87
The Performance of Object Decomposition Techniques for Spatial Query Processingp. 104
Distributed Image Synthesis with Breadth-First Ray Tracing and the Ray-Z-Bufferp. 124
Restricted Orientation Computational Geometryp. 148
Monotonous Bisector* Trees - A Tool for Efficient Partitioning of Complex Scenes of Geometric Objectsp. 186
Learning Convex Sets Under Uniform Distributionp. 204
Spatial Access Structures for Geometric Databasesp. 214
On Spanning Trees with Low Crossing Numbersp. 233
Parallel and Distributed Algorithms
High Performance Universal Hashing, with Applications to Shared Memory Simulationsp. 250
Distributed Game Tree Search on a Massively Parallel Systemp. 270
Balanced Strategies for Routing on Meshesp. 289
Complexity of Boolean Functions on PRAMs - Lower Bound Techniquesp. 309
Enumerative vs. Genetic Optimization Two Parallel Algorithms for the Bin Packing Problemp. 330
Area Efficient Methods to Increase the Reliability of Circuitsp. 363
Table of Contents provided by Blackwell. All Rights Reserved.

ISBN: 9783540554882
ISBN-10: 3540554882
Series: Lecture Notes in Computer Science
Audience: General
Format: Paperback
Language: English
Number Of Pages: 395
Published: 20th May 1992
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6  x 2.13
Weight (kg): 0.57