Computational Geometry: An Introduction: Monographs in Computer Science
Autor Franco P. Preparata, Michael I. Shamosen Limba Engleză Hardback – 23 aug 1985
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 589.97 lei 6-8 săpt. | |
Springer – 27 sep 2012 | 589.97 lei 6-8 săpt. | |
Hardback (1) | 737.74 lei 6-8 săpt. | |
Springer – 23 aug 1985 | 737.74 lei 6-8 săpt. |
Din seria Monographs in Computer Science
- 20% Preț: 511.92 lei
- 20% Preț: 333.22 lei
- 20% Preț: 1285.31 lei
- 20% Preț: 328.60 lei
- 15% Preț: 646.94 lei
- 20% Preț: 357.48 lei
- 20% Preț: 339.47 lei
- 20% Preț: 653.21 lei
- 20% Preț: 329.44 lei
- 20% Preț: 993.74 lei
- 20% Preț: 992.26 lei
- 20% Preț: 1630.95 lei
- 20% Preț: 656.03 lei
- 20% Preț: 650.08 lei
- 20% Preț: 328.09 lei
- 20% Preț: 641.16 lei
- 20% Preț: 334.38 lei
- 20% Preț: 642.19 lei
- 20% Preț: 641.99 lei
- 20% Preț: 1462.66 lei
- 20% Preț: 345.59 lei
- 20% Preț: 1001.16 lei
- 20% Preț: 711.29 lei
- 20% Preț: 661.47 lei
- 20% Preț: 343.62 lei
- 20% Preț: 644.81 lei
- 15% Preț: 505.30 lei
- 20% Preț: 640.69 lei
- Preț: 396.78 lei
- 18% Preț: 956.81 lei
- 20% Preț: 592.68 lei
- 20% Preț: 329.44 lei
- Preț: 383.33 lei
- 20% Preț: 349.40 lei
- 20% Preț: 832.40 lei
- 20% Preț: 993.42 lei
- 15% Preț: 578.87 lei
- 20% Preț: 337.85 lei
- 20% Preț: 988.16 lei
- 20% Preț: 996.56 lei
- 20% Preț: 1293.37 lei
- 20% Preț: 1452.94 lei
Preț: 737.74 lei
Preț vechi: 899.68 lei
-18% Nou
Puncte Express: 1107
Preț estimativ în valută:
141.17€ • 145.86$ • 117.44£
141.17€ • 145.86$ • 117.44£
Carte tipărită la comandă
Livrare economică 20 martie-03 aprilie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9780387961316
ISBN-10: 0387961313
Pagini: 398
Ilustrații: XIV, 398 p.
Dimensiuni: 155 x 235 x 26 mm
Greutate: 0.74 kg
Ediția:1985
Editura: Springer
Colecția Springer
Seria Monographs in Computer Science
Locul publicării:New York, NY, United States
ISBN-10: 0387961313
Pagini: 398
Ilustrații: XIV, 398 p.
Dimensiuni: 155 x 235 x 26 mm
Greutate: 0.74 kg
Ediția:1985
Editura: Springer
Colecția Springer
Seria Monographs in Computer Science
Locul publicării:New York, NY, United States
Public țintă
GraduateCuprins
1 Introduction.- 1.1 Historical Perspective.- 1.2 Algorithmic Background.- 1.3 Geometric Preliminaries.- 1.4 Models of Computation.- 2 Geometric Searching.- 2.1 Introduction to Geometric Searching.- 2.2 Point-Location Problems.- 2.3 Range-Searching Problems.- 2.4 Iterated Search and Fractional Cascading.- 2.5 Notes and Comments.- 2.6 Exercises.- 3 Convex Hulls: Basic Algorithms.- 3.1 Preliminaries.- 3.2 Problem Statement and Lower Bounds.- 3.3 Convex Hull Algorithms in the Plane.- 3.4 Convex Hulls in More Than Two Dimensions.- 3.5 Notes and Comments.- 3.6 Exercises.- 4 Convex Hulls: Extensions and Applications.- 4.1 Extensions and Variants.- 4.2 Applications to Statistics.- 4.3 Notes and Comments.- 4.4 Exercises.- 5 Proximity: Fundamental Algorithms.- 5.1 A Collection of Problems.- 5.2 A Computational Prototype: Element Uniqueness.- 5.3 Lower Bounds.- 5.4 The Closest Pair Problem: A Divide-and-Conquer Approach.- 5.5 The Locus Approach to Proximity Problems: The Voronoi Diagram.- 5.6 Proximity Problems Solved by the Voronoi Diagram.- 5.7 Notes and Comments.- 5.8 Exercises.- 6 Proximity: Variants and Generalizations.- 6.1 Euclidean Minimum Spanning Trees.- 6.2 Planar Triangulations.- 6.3 Generalizations of the Voronoi Diagram.- 6.4 Gaps and Covers.- 6.5 Notes and Comments.- 6.6 Exercises.- 7 Intersections.- 7.1 A Sample of Applications.- 7.2 Planar Applications.- 7.3 Three-Dimensional Applications.- 7.4 Notes and Comments.- 7.5 Exercises.- 8 The Geometry of Rectangles.- 8.1 Some Applications of the Geometry of Rectangles.- 8.2 Domain of Validity of the Results.- 8.3 General Considerations on Static-Mode Algorithms.- 8.4 Measure and Perimeter of a Union of Rectangles.- 8.5 The Contour of a Union of Rectangles.- 8.6 The Closure of a Union of Rectangles.- 8.7 The External Contour of a Union of Rectangles.- 8.8 Intersections of Rectangles and Related Problems.- 8.9 Notes and Comments.- 8.10 Exercises.- References.- Author Index.