Computational Geometry and its Applications

CG '88 International Workshop on Computational Geometry Würzburg, FRG, March 24-25, 1988. Proceedings

Hartmut Noltemeier (Herausgeber)

Buch | Softcover
VIII, 256 Seiten
1988 | 1988
Springer Berlin (Verlag)
978-3-540-50335-4 (ISBN)

Lese- und Medienproben

Computational Geometry and its Applications -
53,49 inkl. MwSt
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 have a workshop, where a suitable number of invited participants could concentrate their efforts in this field to cover a broad spectrum of topics and to communicate in a stimulating atmosphere. This workshop was attended by some fifty invited scientists. The scientific program consisted of 22 contributions, of which 18 papers with one additional paper (M. Reichling) are contained in the present volume. The contributions covered important areas not only of fundamental aspects of Computational Geometry but a lot of interesting and most promising applications: Algorithmic Aspects of Geometry, Arrangements, Nearest-Neighbor-Problems and Abstract Voronoi-Diagrams, Data Structures for Geometric Objects, Geo-Relational Algebra, Geometric Modeling, Clustering and Visualizing Geometric Objects, Finite Element Methods, Triangulating in Parallel, Animation and Ray Tracing, Robotics: Motion Planning, Collision Avoidance, Visibility, Smooth Surfaces, Basic Models of Geometric Computations, Automatizing Geometric Proofs and Constructions.

Prof. Dr. Hartmut Noltemeier ist Emeritus der Universität Würzburg.

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.

Erscheint lt. Verlag 12.10.1988
Reihe/Serie Lecture Notes in Computer Science
Zusatzinfo VIII, 256 p.
Verlagsort Berlin
Sprache englisch
Maße 155 x 235 mm
Gewicht 430 g
Themenwelt Mathematik / Informatik Informatik
Mathematik / Informatik Mathematik Geometrie / Topologie
Schlagworte algorithm • Algorithm analysis and problem complexity • algorithms • Animation • Automat • Computational Geometry • Computergeometrie • data structure • Geometric Modeling • Modeling • robot • Robotics
ISBN-10 3-540-50335-8 / 3540503358
ISBN-13 978-3-540-50335-4 / 9783540503354
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich

von Hans Marthaler; Benno Jakob; Katharina Schudel

Buch | Softcover (2024)
hep verlag
61,00
Nielsen Methods, Covering Spaces, and Hyperbolic Groups

von Benjamin Fine; Anja Moldenhauer; Gerhard Rosenberger …

Buch | Softcover (2024)
De Gruyter (Verlag)
109,95