This volume presents the proceedings of the SeventhInternational Workshop on Computational Geometry, CG'91,held at the University of Berne, Switzerland, March 21/22,1991.Computational geometry is not a precisely defined field.Often, it is understood as a nearly mathematical discipline,dealing mainly with complexity questions concerninggeometrical problems and algorithms. But often too, andperhaps increasingly, questions of more practical relevanceare central, such as applicability, numerical behavior andperformance for all kinds of input size. Topics consideredin CG'91 include:- Generalizations and applications of the Voronoi diagram- Problems with rectangular objects- Path determination- Moving objects- Visibility questions- Layout problems- Representation of spatial objects and spatial queries- Problems in higher dimensions- Implementation questions- Relations to artificial intelligence.
The post office problem for fuzzy point sets.- An optimal algorithm for approximating a set of rectangles by two minimum area rectangles.- An on-line algorithm for constructing sweep planes in regular position.- Performance analysis of three curve representation schemes.- Preclassification and delayed classification of boundary entities in arbitrary dimensions.- On the morphology of polytopes in ?d.- Robustness in geometric modeling - Tolerance-based methods.- On shortest networks for classes of points in the plane.- Determination of the symmetries of polyhedra and an application to object recognition.- Moving along a street (extended abstract).- Planar geometric reasoning with the theory of hints.- Solving algebraic systems in Bernstein-Bezier representation.- XYZ: A project in experimental geometric computation.- Implementing the XYZ GeoBench: A programming environment for geometric algorithms.- Computing the rectilinear link diameter of a polygon.- Layout of flexible manufacturing systems - selected problems.- Dynamic Voronoi diagrams in motion planning.- Generating triangulations of 2-manifolds.- The TR*-tree: A new representation of polygonal objects supporting spatial queries and operations.- A Voronoi diagram based adaptive k-means-type clustering algorithm for multidimensional weighted data.- A Generalization of staircase visibility.- A new simple linear algorithm to recognize interval graphs.- Predictions about collision free paths from intersection tests.
Series: Lecture Notes in Computer Science
Number Of Pages: 323
Published: 13th November 1991
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6
Weight (kg): 0.48