Computational Geometry - Methods, Algorithms and Applications
International Workshop on Computational Geometry CG '91 Bern, Switzerland, March 21-22, 1991. Proceedings
Published on 13. November 1991
Book
Paperback/Softback
VIII, 323 pages
978-3-540-54891-1 (ISBN)
Description
This volume presents the proceedings of the Seventh
International 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 concerning
geometrical problems and algorithms. But often too, and
perhaps increasingly, questions of more practical relevance
are central, such as applicability, numerical behavior and
performance for all kinds of input size. Topics considered
in 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.
More details
Series
Edition
1991 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
VIII, 323 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 19 mm
Weight
517 gr
ISBN-13
978-3-540-54891-1 (9783540548911)
DOI
10.1007/3-540-54891-2
Schweitzer Classification
Content
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-Bézier 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.