Computational geometry and its applications : CG'88, International Workshop on Computational Geometry, Würzburg, FRG, March 24 25, 1988 : proceedings

The International Workshop CG '88 on "Computational Geometry" was held at the University of Würzburg, FRG, March 24-25, 1988. As the interest in the fascinating field of Computational Geometry and its Applications has grown very quickly in recent years the organizers felt the need to...

תיאור מלא

שמור ב:
מידע ביבליוגרפי
מחבר תאגידי: International workshop on computational geometry :Würzburg, West Germany
מחברים אחרים: Noltemeier, Hartmut, 1940- (Directeur de la publication)
פורמט: Livre numérique
שפה:Anglais
יצא לאור: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
סדרה:Lecture notes in computer science 333
נושאים:
גישה מקוונת:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
הערה: 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 and its applications, proceedings, CG'88, International Workshop on Computational Geometry, Würzburg, FRG, March 24-25, 1988, Berlin, Springer-Verlag, 1988, 1 vol. (VI-252 p.), Lecture notes in computer science, 0-387-50335-8
• Computational Geometry and its Applications, Texte imprimé, 9783662162644
תוכן הענינים:
  • Using graphical information from a grid file's directory to visualize patterns in Cartesian product spaces
  • Twin grid files: A performance evaluation
  • On separable and rectangular clusterings
  • A sweep algorithm for the all-nearest-neighbors problem
  • On continuous homotopic one layer routing
  • Point location in arrangements
  • Internal and external algorithms for the points-in-regions problem the INSIDE join of geo-relational algebra
  • Geo-relational algebra: A model and query language for geometric database systems
  • Elementary set operations with d-dimensional polyhedra
  • A divide-and-conquer algorithm for computing 4-dimensional convex hulls
  • Triangulating a monotone polygon in parallel
  • Abstract voronoi diagrams and their applications
  • Geometric modeling of smooth surfaces
  • Collision avoidance for nonrigid objects
  • On the detection of a common intersection of ? convex polyhedra
  • Time coherence in computer animation by ray tracing
  • Using gale transforms in computational geometry
  • Geometrical abstract automata
  • Automatizing geometric proofs and constructions.