Discrete and Computational Geometry
Editat de Jin Akiyama, Mikio Kano, Masatsugu Urabeen Limba Engleză Paperback – 16 feb 2000
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (2) | 324.68 lei 6-8 săpt. | |
| Springer Berlin, Heidelberg – 20 iun 2001 | 324.68 lei 6-8 săpt. | |
| Springer – 16 feb 2000 | 377.92 lei 6-8 săpt. |
Preț: 377.92 lei
Nou
Puncte Express: 567
Preț estimativ în valută:
66.89€ • 77.97$ • 58.50£
66.89€ • 77.97$ • 58.50£
Carte tipărită la comandă
Livrare economică 20 ianuarie-03 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540671817
ISBN-10: 3540671811
Pagini: 348
Ilustrații: VIII, 340 p.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.53 kg
Ediția:2000
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540671811
Pagini: 348
Ilustrații: VIII, 340 p.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.53 kg
Ediția:2000
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Papers.- Radial Perfect Partitions of Convex Sets in the Plane.- Dudeney Dissection of Polygons.- Effective Use of Geometric Properties for Clustering.- Living with lrs.- On the Existente of a Point Subset with 4 or 5 Interior Points.- Planar Drawing Algorithms of Survivable Telecommunication Networks.- Polygon Cutting: Revisited.- Algorithms for Packing Two Circles in a Convex Polygon.- Folding and Cutting Paper.- An Interpolant Based on Line Segment Voronoi Diagrams.- 2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Pieces.- NP-Completeness of Stage Illumination Problems.- On the Maximum Degree of Bipartite Embeddings of Trees in the Plane.- Efficient Regular Polygon Dissections.- On Soddy’s Hexlet and a Linked 4-Pair.- Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs.- Visibility of Disks on the Lattice Points.- Convex Hull Problem with Imprecise Input.- One-Dimensional Tilings with Congruent Copies of a 3-Point Set.- Polygonal Approximations for Curved Problems: An Application to Arrangements.- Grouping and Querying: A Paradigm to Get Output-Sensitive Algorithms.- Folding and Unfolding in Computational Geometry.- Crossing Numbers.- A Note on the Existente of Plane Spanning Trees of Geometrie Graphs.- Embeddings of Equilateral Polygons in Unit Lattices.- Order-k Voronoi Diagrams, k-Sections, and k-Sets.- ”Impossible Objects” Are Not Necessarily Impossible – Mathematical Study on Optical Illusion –.- An Efficient Solution to the Corridor Search Problem.
Caracteristici
Includes supplementary material: sn.pub/extras