Skip to main content
  • Conference proceedings
  • © 1991

Computational Geometry - Methods, Algorithms and Applications

International Workshop on Computational Geometry CG '91 Bern, Switzerland, March 21-22, 1991. Proceedings

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 553)

Buy it now

Buying options

Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (23 papers)

  1. Front Matter

  2. The post office problem for fuzzy point sets

    • Franz Aurenhammer, Gerd Stöckl, Emo Welzl
    Pages 1-11
  3. An optimal algorithm for approximating a set of rectangles by two minimum area rectangles

    • Bruno Becker, Paolo Giulio Franciosa, Stephan Gschwind, Thomas Ohler, Gerald Thiem, Peter Widmayer
    Pages 13-25
  4. An on-line algorithm for constructing sweep planes in regular position

    • Hanspeter Bieri, Peter-Michael Schmidt
    Pages 27-35
  5. Performance analysis of three curve representation schemes

    • Salvador Dominguez, Oliver Günther
    Pages 37-56
  6. On the morphology of polytopes in ℝd

    • Peter Engel
    Pages 71-83
  7. Robustness in geometric modeling — Tolerance-based methods

    • Shiaofen Fang, Beat Brüderlin
    Pages 85-101
  8. On shortest networks for classes of points in the plane

    • Edmund Ihler, Gabriele Reich, Peter Widmayer
    Pages 103-111
  9. Planar geometric reasoning with the theory of hints

    • Paul-André Monney
    Pages 141-159
  10. Solving algebraic systems in Bernstein-Bézier representation

    • Heinrich Müller, Matthias Otte
    Pages 161-169
  11. XYZ: A project in experimental geometric computation

    • Jurg Nievergelt, Peter Schorn, Michele De Lorenzi, Christoph Ammann, Adrian Brüngger
    Pages 171-186
  12. Computing the rectilinear link diameter of a polygon

    • Bengt J. Nilsson, Sven Schuierer
    Pages 203-215
  13. Dynamic Voronoi diagrams in motion planning

    • Thomas Roos, Hartmut Noltemeier
    Pages 227-236
  14. Generating triangulations of 2-manifolds

    • Haijo Schipper
    Pages 237-248

About this book

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.

Bibliographic Information

Buy it now

Buying options

Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access