Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry - Brossura

Mehlhorn, K.

9783642699023: Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry

Brossura

ISBN 10: 3642699022 ISBN 13: 9783642699023

Casa editrice: Springer, 2012

Vedi tutte le copie di questa edizione con ISBN

2 Usato

Da: EUR 61,12

15 Nuovo

Da: EUR 48,37

Book by Mehlhorn K

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Contenuti

VII. Multidimensional Data Structures.- 1. A Black Box Approach to Data Structures.- 1.1 Dynamization.- 1.2 Weighting and Weighted Dynamization.- 1.3 Order Decomposable Problems.- 2. Multi-dimensional Searching Problems.- 2.1 D-dimensional Trees and Polygon Trees.- 2.2 Range Trees and Multidimensional Divide and Conquer.- 2.3 Lower Bounds.- 2.3.1 Partial MatchRetrieval in Minimum Space.- 2.3.2 The Spanning Bound.- 3. Exercises.- 4. Bibliographic Notes.- VIII. Computational Geometry.- 1. Convex Polygons.- 2. Convex Hulls.- 3. Voronoi Diagrams and Searching Planar Subdivisions.- 3.1 Voronoi Diagrams.- 3.2 Searching Planar Subdivisions.- 3.2.1 Removal of Large Independent Sets.- 3.2.2 Path Decompositions.- 3.2.3 Searching Dynamic Planar Subdivisions.- 3.3 Applications.- 4. The Sweep Paradigm.- 4.1 Intersection of Line Segments and Other Intersection Problems in the Plane.- 4.2 Triangulation and its Applications.- 4.3 Space Sweep.- 5. The Realm of Orthogonal Objects.- 5.1 Plane Sweep for Iso-Oriented Objects.- 5.1.1 The Interval Tree and its Applications.- 5.1.2 The Priority Search Tree and its Applications.- 5.1.3 Segment Trees.- 5.1.4 Path Decomposition and Plane Sweep for Non-Iso-Oriented Objects.- 5.2 Divide and Conquer on Iso-Oriented Objects.- 5.2.1 The Line Segment Intersection Problem.- 5.2.2 The Measure and Contour Problems.- 5.3 Intersection Problems in Higher-Dimensional Space.- 6. Geometric Transforms.- 6.1 Duality.- 6.2 Inversion.- 7. Exercises.- 8. Bibliographic Notes.- IX. Algorithmic Paradigms.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Editore: Springer
Data di pubblicazione: 2012
Lingua: Inglese
ISBN 10: 3642699022
ISBN 13: 9783642699023
Rilegatura: Copertina flessibile
Numero di pagine: 304
Contatto del produttore: non disponibile
Persona responsabile: CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Germania

Compra usato

Condizioni: come nuovo

Unread book in perfect condition...

Visualizza questo articolo

EUR 61,12

Convertire valuta

EUR 17,11 per la spedizione da U.S.A. a Italia

Destinazione, tempi e costi

Aggiungi al carrello

Compra nuovo

Visualizza questo articolo

EUR 48,37

Convertire valuta

EUR 9,70 per la spedizione da Germania a Italia

Destinazione, tempi e costi

Aggiungi al carrello

Altre edizioni note dello stesso titolo

9783540136422: Data Structures and Algorithms 3: Multi-Dimensional Searching and Computational Geometry

Edizione in evidenza

ISBN 10: 3540136428 ISBN 13: 9783540136422
Casa editrice: Springer-Verlag Berlin and Heide..., 1984
Rilegato

(Brossura)

Risultati della ricerca per Data Structures and Algorithms 3: Multi-dimensional...

Immagini fornite dal venditore

Data Structures and Algorithms 3

K. Mehlhorn

Editore: Springer Berlin Heidelberg, 2012

ISBN 10: 3642699022 ISBN 13: 9783642699023

Nuovo Brossura

Print on Demand

Da: moluna, Greven, Germania

Valutazione del venditore 5 su 5 stelle

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. VII. Multidimensional Data Structures.- 1. A Black Box Approach to Data Structures.- 1.1 Dynamization.- 1.2 Weighting and Weighted Dynamization.- 1.3 Order Decomposable Problems.- 2. Multi-dimensional Searching Problems.- 2.1 D-dimensional Trees and Polygon. Codice articolo 5068410

Contatta il venditore

Compra nuovo

EUR 48,37

Convertire valuta

Spese di spedizione: EUR 9,70

Da: Germania a: Italia

Destinazione, tempi e costi

Quantit�: Pi� di 20 disponibili

Aggiungi al carrello

Immagini fornite dal venditore

Data Structures and Algorithms 3

K. Mehlhorn

Editore: Springer Berlin Heidelberg Jan 2012, 2012

ISBN 10: 3642699022 ISBN 13: 9783642699023

Nuovo Taschenbuch

Print on Demand

Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania

Valutazione del venditore 5 su 5 stelle

Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -InhaltsangabeVII. Multidimensional Data Structures.- 1. A Black Box Approach to Data Structures.- 1.1 Dynamization.- 1.2 Weighting and Weighted Dynamization.- 1.3 Order Decomposable Problems.- 2. Multi-dimensional Searching Problems.- 2.1 D-dimensional Trees and Polygon Trees.- 2.2 Range Trees and Multidimensional Divide and Conquer.- 2.3 Lower Bounds.- 2.3.1 Partial MatchRetrieval in Minimum Space.- 2.3.2 The Spanning Bound.- 3. Exercises.- 4. Bibliographic Notes.- VIII. Computational Geometry.- 1. Convex Polygons.- 2. Convex Hulls.- 3. Voronoi Diagrams and Searching Planar Subdivisions.- 3.1 Voronoi Diagrams.- 3.2 Searching Planar Subdivisions.- 3.2.1 Removal of Large Independent Sets.- 3.2.2 Path Decompositions.- 3.2.3 Searching Dynamic Planar Subdivisions.- 3.3 Applications.- 4. The Sweep Paradigm.- 4.1 Intersection of Line Segments and Other Intersection Problems in the Plane.- 4.2 Triangulation and its Applications.- 4.3 Space Sweep.- 5. The Realm of Orthogonal Objects.- 5.1 Plane Sweep for Iso-Oriented Objects.- 5.1.1 The Interval Tree and its Applications.- 5.1.2 The Priority Search Tree and its Applications.- 5.1.3 Segment Trees.- 5.1.4 Path Decomposition and Plane Sweep for Non-Iso-Oriented Objects.- 5.2 Divide and Conquer on Iso-Oriented Objects.- 5.2.1 The Line Segment Intersection Problem.- 5.2.2 The Measure and Contour Problems.- 5.3 Intersection Problems in Higher-Dimensional Space.- 6. Geometric Transforms.- 6.1 Duality.- 6.2 Inversion.- 7. Exercises.- 8. Bibliographic Notes.- IX. Algorithmic Paradigms. 304 pp. Englisch. Codice articolo 9783642699023

Contatta il venditore

Compra nuovo

EUR 53,49

Convertire valuta

Spese di spedizione: EUR 11,00

Da: Germania a: Italia

Destinazione, tempi e costi

Quantit�: 2 disponibili

Aggiungi al carrello

Immagini fornite dal venditore

Data Structures and Algorithms 3 : Multi-dimensional Searching and Computational Geometry

K. Mehlhorn

Editore: Springer Berlin Heidelberg, 2012

ISBN 10: 3642699022 ISBN 13: 9783642699023

Nuovo Taschenbuch

Da: AHA-BUCH GmbH, Einbeck, Germania

Valutazione del venditore 5 su 5 stelle

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - InhaltsangabeVII. Multidimensional Data Structures.- 1. A Black Box Approach to Data Structures.- 1.1 Dynamization.- 1.2 Weighting and Weighted Dynamization.- 1.3 Order Decomposable Problems.- 2. Multi-dimensional Searching Problems.- 2.1 D-dimensional Trees and Polygon Trees.- 2.2 Range Trees and Multidimensional Divide and Conquer.- 2.3 Lower Bounds.- 2.3.1 Partial MatchRetrieval in Minimum Space.- 2.3.2 The Spanning Bound.- 3. Exercises.- 4. Bibliographic Notes.- VIII. Computational Geometry.- 1. Convex Polygons.- 2. Convex Hulls.- 3. Voronoi Diagrams and Searching Planar Subdivisions.- 3.1 Voronoi Diagrams.- 3.2 Searching Planar Subdivisions.- 3.2.1 Removal of Large Independent Sets.- 3.2.2 Path Decompositions.- 3.2.3 Searching Dynamic Planar Subdivisions.- 3.3 Applications.- 4. The Sweep Paradigm.- 4.1 Intersection of Line Segments and Other Intersection Problems in the Plane.- 4.2 Triangulation and its Applications.- 4.3 Space Sweep.- 5. The Realm of Orthogonal Objects.- 5.1 Plane Sweep for Iso-Oriented Objects.- 5.1.1 The Interval Tree and its Applications.- 5.1.2 The Priority Search Tree and its Applications.- 5.1.3 Segment Trees.- 5.1.4 Path Decomposition and Plane Sweep for Non-Iso-Oriented Objects.- 5.2 Divide and Conquer on Iso-Oriented Objects.- 5.2.1 The Line Segment Intersection Problem.- 5.2.2 The Measure and Contour Problems.- 5.3 Intersection Problems in Higher-Dimensional Space.- 6. Geometric Transforms.- 6.1 Duality.- 6.2 Inversion.- 7. Exercises.- 8. Bibliographic Notes.- IX. Algorithmic Paradigms. Codice articolo 9783642699023

Contatta il venditore

Compra nuovo

EUR 53,49

Convertire valuta

Spese di spedizione: EUR 14,99

Da: Germania a: Italia

Destinazione, tempi e costi

Quantit�: 1 disponibili

Aggiungi al carrello

Immagini fornite dal venditore

Data Structures and Algorithms 3

K. Mehlhorn

Editore: Springer Berlin Heidelberg, Springer Berlin Heidelberg Jan 2012, 2012

ISBN 10: 3642699022 ISBN 13: 9783642699023

Nuovo Taschenbuch

Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania

Valutazione del venditore 5 su 5 stelle

Taschenbuch. Condizione: Neu. Neuware -InhaltsangabeVII. Multidimensional Data Structures.- 1. A Black Box Approach to Data Structures.- 1.1 Dynamization.- 1.2 Weighting and Weighted Dynamization.- 1.3 Order Decomposable Problems.- 2. Multi-dimensional Searching Problems.- 2.1 D-dimensional Trees and Polygon Trees.- 2.2 Range Trees and Multidimensional Divide and Conquer.- 2.3 Lower Bounds.- 2.3.1 Partial MatchRetrieval in Minimum Space.- 2.3.2 The Spanning Bound.- 3. Exercises.- 4. Bibliographic Notes.- VIII. Computational Geometry.- 1. Convex Polygons.- 2. Convex Hulls.- 3. Voronoi Diagrams and Searching Planar Subdivisions.- 3.1 Voronoi Diagrams.- 3.2 Searching Planar Subdivisions.- 3.2.1 Removal of Large Independent Sets.- 3.2.2 Path Decompositions.- 3.2.3 Searching Dynamic Planar Subdivisions.- 3.3 Applications.- 4. The Sweep Paradigm.- 4.1 Intersection of Line Segments and Other Intersection Problems in the Plane.- 4.2 Triangulation and its Applications.- 4.3 Space Sweep.- 5. The Realm of Orthogonal Objects.- 5.1 Plane Sweep for Iso-Oriented Objects.- 5.1.1 The Interval Tree and its Applications.- 5.1.2 The Priority Search Tree and its Applications.- 5.1.3 Segment Trees.- 5.1.4 Path Decomposition and Plane Sweep for Non-Iso-Oriented Objects.- 5.2 Divide and Conquer on Iso-Oriented Objects.- 5.2.1 The Line Segment Intersection Problem.- 5.2.2 The Measure and Contour Problems.- 5.3 Intersection Problems in Higher-Dimensional Space.- 6. Geometric Transforms.- 6.1 Duality.- 6.2 Inversion.- 7. Exercises.- 8. Bibliographic Notes.- IX. Algorithmic Paradigms.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 304 pp. Englisch. Codice articolo 9783642699023

Contatta il venditore