Computational geometry - methods, algorithms, and applications : International Workshop on Computational Geometry CG '91, Bern, Switzerland, March 21-22, 1991 : proceedings

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, dea...

Description complète

Enregistré dans:
Détails bibliographiques
Collectivité auteur: International workshop on computational geometry :Bern
Autres auteurs: Noltemeier, Hartmut, 1940- (Directeur de la publication), Bieri, Hanspeter, 19..- (Directeur de la publication)
Format: Livre numérique
Langue:Anglais
Publié: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Collection:Lecture notes in computer science 553
Sujets:
Accès en ligne:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Note: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Computational geometry, methods, algorithms, and applications, International Workshop on Computational Geometry CG '91, Bern, Switzerland, March 21-22, 1991, proceedings, H. Bieri, H. Noltemeier (eds.), Berlin, Springer-Verlag, 1991, 1 vol. (VIII-320 p.), Lecture notes in computer science, 3-540-54891-2
• Computational Geometry - Methods, Algorithms and Applications, Texte imprimé, 9783662199220
Table des matières:
  • 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.