Proceedings of the Course on Algorithms and Data Structures for Geometric Computations Held at CISM (Centre International des Sciences Mecaniques) in Udine (Italy) on 8-12 July 1985,
INSTITUT FUER INFORMATIK ZURICH (SWITZERLAND)
Pagination or Media Count:
The Outline of the course was as follows 1 Computational geometry 2 Geometrical problems related to robotics 3 Heuristics for finding approximations for Steiner minimum trees 4 The grid file as a data structure suited for geometrical computation 5 Different schemes for representing three-dimensional objects 6 Visibility problems that occur in VLSI design 7 Algorithms for point location, convex hull and the maxima of a set of vectors in two and three dimensions and 8 Merging heaps and some unsolved problems.
- Theoretical Mathematics