Computational Geometry and its Applications
Springer Berlin (Verlag)
978-3-540-50335-4 (ISBN)
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? |
aus dem Bereich