Discrete and Computational Geometry: Japanese Conference, JCDCG 2000, Tokyo, Japan, November, 22-25, 2000. Revised Papers: Lecture Notes in Computer Science, cartea 2098
Editat de Jin Akiyama, Mikio Kano, Masatsugu Urabeen Limba Engleză Paperback – 20 iun 2001
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (2) | 337.52 lei 6-8 săpt. | |
Springer Berlin, Heidelberg – 20 iun 2001 | 337.52 lei 6-8 săpt. | |
Springer Berlin, Heidelberg – 16 feb 2000 | 391.02 lei 6-8 săpt. |
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 340.32 lei
- 20% Preț: 341.95 lei
- 20% Preț: 453.32 lei
- 20% Preț: 238.01 lei
- 20% Preț: 340.32 lei
- 20% Preț: 438.69 lei
- Preț: 449.57 lei
- 20% Preț: 343.62 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 645.28 lei
- 17% Preț: 427.22 lei
- 20% Preț: 655.02 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 591.51 lei
- Preț: 381.21 lei
- 20% Preț: 337.00 lei
- 15% Preț: 438.59 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 579.30 lei
- 20% Preț: 575.48 lei
- 20% Preț: 583.40 lei
- 20% Preț: 763.23 lei
- 15% Preț: 580.46 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 353.50 lei
- 20% Preț: 585.88 lei
- Preț: 410.88 lei
- 20% Preț: 596.46 lei
- 20% Preț: 763.23 lei
- 20% Preț: 825.93 lei
- 20% Preț: 649.49 lei
- 20% Preț: 350.21 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 337.52 lei
Preț vechi: 421.90 lei
-20% Nou
Puncte Express: 506
Preț estimativ în valută:
64.59€ • 66.64$ • 54.67£
64.59€ • 66.64$ • 54.67£
Carte tipărită la comandă
Livrare economică 05-19 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540423065
ISBN-10: 3540423060
Pagini: 400
Ilustrații: XII, 388 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.56 kg
Ediția:2001
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540423060
Pagini: 400
Ilustrații: XII, 388 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.56 kg
Ediția:2001
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Papers.- Dudeney Dissections of Polygons and Polyhedrons – A Survey –.- Universal Measuring Devices Without Gradations.- A Note on the Purely Recursive Dissection for a Sequentially n-Divisible Square.- Sequentially Divisible Dissections of Simple Polygons.- Packing Convex Polygons into Rectangular Boxes.- On the Number of Views of Polyhedral Scenes.- Problems and Results around the Erdös-Szekeres Convex Polygon Theorem.- On Finding Maximum-Cardinality Symmetric Subsets.- Folding and Unfolding Linkages, Paper, and Polyhedra.- On the Skeleton of the Metric Polytope.- Geometric Dissections that Swing and Twist.- On Convex Decompositions of Points.- Volume Queries in Polyhedra.- Sum of Edge Lengths of a Graph Drawn on a Convex Polygon.- On double bound graphs with respect to graph operations.- Generalized Balanced Partitions of Two Sets of Points in the Plane.- On Paths in a Complete Bipartite Geometric Graph.- Approximating Uniform Triangular Meshes for Spheres.- The construction of Delaunay diagrams by lob reduction.- Geometric Transformation in Plane Triangulations.- Separation Sensitive Kinetic Separation Structures for Convex Polygons.- On Acute Triangulations of Quadrilaterals.- Intersecting Red and Blue Line Segments in Optimal Time and Precision.- Tight Error Bound of Goemetric Problems on Convex Objects with Imprecise Coordinates.- Triangle Contact Systems, Orthogonal Plane Partitions, and their Hit Graphs.- Note on Diagonal Flips and Chromatic Numbers of Quadrangulations on Closed Surfaces.- An Extension of Cauchy’s Arm Lemma with Application to Curve Development.- On the complexity of the union of geometric objects.- Structure Theorems for Systems of Segments.- 3—Dimensional Single Active Layer Routing.- Nonregular triangulations, view graphs oftriangulations, and linear programming duality.- Efficient Algorithms for Searching a Polygonal Room with a Door.- A New Structure of Cylinder Packing.- Efficient algorithms for the minimum diameter bridge problem.- Illuminating Both Sides of Line Segments.
Caracteristici
Includes supplementary material: sn.pub/extras