Computational Geometry: Algorithms and Applications
Autor Mark de Berg, Otfried Cheong, Marc van Kreveld, Mark Overmarsen Limba Engleză Paperback – 19 oct 2010
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 402.17 lei 3-5 săpt. | |
Springer Berlin, Heidelberg – 19 oct 2010 | 402.17 lei 3-5 săpt. | |
Hardback (1) | 341.04 lei 3-5 săpt. | +46.27 lei 7-13 zile |
Springer Berlin, Heidelberg – 7 mar 2008 | 341.04 lei 3-5 săpt. | +46.27 lei 7-13 zile |
Preț: 402.17 lei
Nou
Puncte Express: 603
Preț estimativ în valută:
76.96€ • 79.86$ • 64.33£
76.96€ • 79.86$ • 64.33£
Carte disponibilă
Livrare economică 22 februarie-08 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783642096815
ISBN-10: 3642096816
Pagini: 400
Ilustrații: XII, 386 p. 370 illus.
Dimensiuni: 189 x 246 x 21 mm
Greutate: 0.75 kg
Ediția:3rd ed. 2008
Editura: Springer Berlin, Heidelberg
Colecția Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642096816
Pagini: 400
Ilustrații: XII, 386 p. 370 illus.
Dimensiuni: 189 x 246 x 21 mm
Greutate: 0.75 kg
Ediția:3rd ed. 2008
Editura: Springer Berlin, Heidelberg
Colecția Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.
Recenzii
"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
Caracteristici
A broad overview of the major algorithms and data structures of the field Motivated from applications Covers concepts and techniquesto be presented in any course on computational geometry Self-contained and illustrated with 370 figures Additional online material available under http://www.cs.uu.nl/geobook/ Besides revisions to the second edition, new sections discussing Voronoi diagrams of line segments, farthest-point Voronoi diagrams, and realistic input models have been added Includes supplementary material: sn.pub/extras