Cantitate/Preț
Produs

Discrete and Computational Geometry: Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004: Lecture Notes in Computer Science, cartea 3742

Editat de Jin Akiyama, Mikio Kano, Xuehou Tan
en Limba Engleză Paperback – 24 noi 2005

Din seria Lecture Notes in Computer Science

Preț: 32944 lei

Preț vechi: 41180 lei
-20% Nou

Puncte Express: 494

Preț estimativ în valută:
6305 6574$ 5240£

Carte tipărită la comandă

Livrare economică 21 martie-04 aprilie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540304678
ISBN-10: 3540304673
Pagini: 213
Ilustrații: VIII, 213 p.
Dimensiuni: 155 x 235 x 17 mm
Greutate: 0.34 kg
Ediția:2005
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Matching Points with Circles and Squares.- The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation.- Algorithms for the d-Dimensional Rigidity Matroid of Sparse Graphs.- Sliding Disks in the Plane.- Weighted Ham-Sandwich Cuts.- Towards Faster Linear-Sized Nets for Axis-Aligned Boxes in the Plane.- Farthest-Point Queries with Geometric and Combinatorial Constraints.- Grid Vertex-Unfolding Orthostacks.- A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem.- Tight Time Bounds for the Minimum Local Convex Partition Problem.- I/O-Efficiently Pruning Dense Spanners.- On the Minimum Size of a Point Set Containing Two Non-intersecting Empty Convex Polygons.- Three Equivalent Partial Orders on Graphs with Real Edge-Weights Drawn on a Convex Polygon.- Wedges in Euclidean Arrangements.- Visual Pascal Configuration and Quartic Surface.- Nonexistence of 2-Reptile Simplices.- Single-Vertex Origami and Spherical Expansive Motions.- An Optimal Algorithm for the 1-Searchability of Polygonal Rooms.- Crossing Stars in Topological Graphs.- The Geometry of Musical Rhythm.