Computational Geometry
Springer Berlin (Verlag)
978-3-642-09681-5 (ISBN)
Computational Geometry: Introduction.- Line Segment Intersection: Thematic Map Overlay.- Polygon Triangulation: Guarding an Art Gallery.- Linear Programming: Manufacturing with Molds.- Orthogonal Range Searching: Querying a Database.- Point Location: Knowing Where You Are.- Voronoi Diagrams: The Post Office Problem.- Arrangements and Duality: Supersampling in Ray Tracing.- Delaunay Triangulations: Height Interpolation.- More Geometric Data Structures: Windowing.- Convex Hulls: Mixing Things.- Binary Space Partitions: The Painter's Algorithm.- Robot Motion Planning: Getting Where You Want to Be.- Quadtrees: Non-Uniform Mesh Generation.- Visibility Graphs: Finding the Shortest Route.- Simplex Range Searching: Windowing Revisited.- Bibliography.- Index.
"An excellent introduction to the field is given here, including a general motivation and usage cases beyond simple graphics rendering or interaction." from the ACM Reviews by William Fahle, University of Texas at Dallas, USA
Erscheint lt. Verlag | 19.10.2010 |
---|---|
Zusatzinfo | XII, 386 p. 370 illus. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 189 x 246 mm |
Gewicht | 800 g |
Themenwelt | Mathematik / Informatik ► Informatik ► Theorie / Studium |
Schlagworte | algorithm • Algorithm analysis and problem complexity • algorithms • area • CAD/CAM • CAM • Computational Geometry • Computer Graphics • Computer Science • Database • data structure • data structures • Geographical Information Systems • geometric algorithms • Geometric Data Structures • Information • linear optimization • Partition • programming • robot • Robotics • Triangulation |
ISBN-10 | 3-642-09681-6 / 3642096816 |
ISBN-13 | 978-3-642-09681-5 / 9783642096815 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich