Data Structures and Efficient Algorithms
Editat de Burkhard Monien, Thomas Ottmannen Limba Engleză Paperback – 20 mai 1992
Preț: 327.48 lei
Preț vechi: 409.36 lei
-20%
Puncte Express: 491
Preț estimativ în valută:
57.91€ • 66.40$ • 50.05£
57.91€ • 66.40$ • 50.05£
Carte tipărită la comandă
Livrare economică 27 aprilie-11 mai
Specificații
ISBN-13: 9783540554882
ISBN-10: 3540554882
Pagini: 404
Ilustrații: IX, 395 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.61 kg
Ediția:1992
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540554882
Pagini: 404
Ilustrații: IX, 395 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.61 kg
Ediția:1992
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Resemblance and symmetries of geometric patterns.- Selected topics from computational geometry, data structures and motion planning.- Processing of hierarchically defined graphs and graph families.- The combination of spatial access methods and computational geometry in geographic database systems.- A flexible and extensible index manager for spatial database systems.- The performance of object decomposition techniques for spatial query processing.- Distributed image synthesis with breadth-first ray tracing and the ray-z-buffer.- Restricted orientation computational geometry.- Monotonous Bisector* Trees — a tool for efficient partitioning of complex scenes of geometric objects.- Learning convex sets under uniform distribution.- Spatial access structures for geometric databases.- On spanning trees with low crossing numbers.- High performance universal hashing, with applications to shared memory simulations.- Distributed game tree search on a massively parallel system.- Balanced strategies for routing on meshes.- Complexity of Boolean functions on PRAMs - Lower bound techniques.- Enumerative vs. genetic optimization two parallel algorithms for the bin packing problem.- Area efficient methods to increase the reliability of circuits.