Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    UID:
    almahu_9949384947402882
    Format: 1 online resource : , text file, PDF
    Edition: Third edition.
    ISBN: 9781315119601 , 1315119609 , 9781498711425 , 1498711421 , 9781351645911 , 1351645919
    Series Statement: Discrete Mathematics and Its Applications
    Content: "The Handbook of Discrete and Computational Geometry is intended as a reference book fully accessible to nonspecialists as well as specialists, covering all major aspects of both fields. The book offers the most important results and methods in discrete and computational geometry to those who use them in their work, both in the academic world--as researchers in mathematics and computer science--and in the professional world--as practitioners in?elds as diverse as operations research, molecular biology, and robotics. Discrete geometry has contributed signi?cantly to the growth of discrete mathematics in recent years. This has been fueled partly by the advent of powerful computers and by the recent explosion of activity in the relatively young?eld of computational geometry. This synthesis between discrete and computational geometry lies at the heart of this Handbook. A growing list of application fields includes combinatorial optimization, computer-aided design, computer graphics, crystallography, data analysis, error-correcting codes, geographic information systems, motion planning, operations research, pattern recognition, robotics, solid modeling, and tomography."--Provided by publisher.
    Note: Part Part I. Combinatorial And Discrete Geometry -- chapter 1 Finite point congurations (J. Pach) -- chapter 2 Packing and covering (G. Fejes Toth) -- chapter 3 Tilings (e. Harriss, D. Schattschneider, And M. Senechal) -- chapter 4 Helly-type Theorems And Geometric Transversals (a. Holmsen And R. Wenger) -- chapter 5 Pseudoline Arrangements (s. Felsner And J.e. Goodman) -- chapter 6 Oriented Matroids (j. Richter-gebert And G.m. Ziegler) -- chapter 7 Lattice Points And Lattice Polytopes (a. Barvinok) -- chapter 8 Low-distortion embeddings of nite metric spaces (P. Indyk, J. Matousek, and A. Sidiropoulos) -- chapter 9 Geometry And Topology Of Polygonal Linkages (r. Connelly And E.d. Demaine) -- chapter 10 Geometric Graph Theory (j. Pach) -- chapter 11 Euclidean Ramsey Theory (r.l. Graham) -- chapter 12 Discrete Aspects Of Stochastic Geometry (r. Schneider) -- chapter 13 Geometric Discrepancy Theory And Uniform Distribution (j.r. Alexander, J. Beck, And W.w.l. Chen) -- chapter 14 Polyominoes (g. Barequet, S.w. Golomb, And D.a. Klarner) -- part Part II. Polytopes And Polyhedra -- chapter 15 Basic Properties Of Convex Polytopes (m. Henk, J. Richter-gebert, And G.m. Ziegler) -- chapter 16 Subdivisions And Triangulations Of Polytopes (c.w. Lee And F. Santos) -- chapter 17 Face numbers of polytopes and complexes (L.J. Billera and A. Bj?orner) -- chapter 18 Symmetry Of Polytopes And Polyhedra (e. Schulte) -- chapter 19 Polytope Skeletons And Paths (g. Kalai) -- chapter 20 Polyhedral Maps (u. Brehm And E. Schulte) -- part Part III. Combinatorial And Computational Topology -- chapter 21 Topological methods in discrete geometry (R.T. Zivaljevic) -- chapter 22 Random Simplicial Complexes (m. Kahle) -- chapter 23 Computational topology of graphs on surfaces (E. Colin de Verdiere) -- chapter 24 Persistent Homology (h. Edelsbrunner And D. Morozov) -- chapter 25 High-dimensional Topological Data Analysis (f. Chazal) -- part Part IV. Algorithms And Complexity Of Fundamental Geometric Objects -- chapter 26 Convex Hull Computations (r. Seidel) -- chapter 27 Voronoi Diagrams And Delaunay Triangulations (s. Fortune) -- chapter 28 Arrangements (d. Halperin And M. Sharir) -- chapter 29 Triangulations And Mesh Generation (m. Bern, J. Shewchuk, And N. Amenta) -- chapter 30 Polygons (J. O'Rourke, S. Suri, and C.D. Toth) -- chapter 31 Shortest Paths And Networks (j.s.b. Mitchell) -- chapter 32 Proximity Algorithms (j.s.b. Mitchell And W. Mulzer) -- chapter 33 Visibility (j. O'rourke) -- chapter 34 Geometric Reconstruction Problems (y. Disser And S.s. Skiena) -- chapter 35 Curve And Surface Reconstruction (t.k. Dey) -- chapter 36 Computational Convexity (p. Gritzmann And V. Klee) -- chapter 37 Computational And Quantitative Real Algebraic Geometry (s. Basu And B. Mishra) -- part Part V. Geometric Data Structures And Searching -- chapter 38 Point Location (j. Snoeyink) -- chapter 39 Collision And Proximity Queries (y. Kim, M.c. Lin, And D. Manocha) -- chapter 40 Range Searching (p.k. Agarwal) -- chapter 41 Ray Shooting And Lines In Space (m. Pellegrini) -- chapter 42 Geometric Intersection (d.m. Mount) -- chapter 43 Nearest Neighbors In High-dimensional Spaces (a. Andoni And P. Indyk) -- part Part VI. Computational Techniques -- chapter 44 Randomizaton And Derandomization (o. Cheong, K. Mulmuley, And E. Ramos) -- chapter 45 Robust Geometric Computation (v. Sharma And C.k. Yap) -- chapter 46 Parallel Algorithms In Geometry (m.t. Goodrich And N. Sitchinava) -- chapter 47 Epsilon-approximations And Epsilon-nets (n. Mustafa And K. Varadarajan) -- chapter 48 Coresets And Sketches (j. Phillips) -- part Part VII. Applications Of Discrete And Computational Geometry -- chapter 49 Linear programming (M. Dyer, B. G?artner, N. Megiddo, and E. Welzl) -- chapter 50 Algorithmic Motion Planning (d. Halperin, O. Salzman, And M. Sharir) -- chapter 51 Robotics (d. Halperin, L.e. Kavraki, And K. Solovey) -- chapter 52 Computer Graphics (d. Dobkin And S. Teller) -- chapter 53 Modeling motion (L.J. Guibas and M. Roelozen) -- chapter 54 Pattern Recognition (j. O'rourke And G.t. Toussaint) -- chapter 55 Graph Drawing (e. Di Giacomo, G. Liotta, And R. Tamassia) -- chapter 56 Splines And Geometric Modeling (c.l. Bajaj) -- chapter 57 Solid modeling (C.M. Homann and V. Shapiro) -- chapter 58 Computation Of Robust Statistics: Depth, Median, And Related Measures (p.j. Rousseeuw And M. Hubert) -- chapter 59 Geographic Information Systems (m. Van Kreveld) -- chapter 60 Geometric Applications Of The Grassmann-cayley Algebra (n.l. White) -- chapter 61 Rigidity And Scene Analysis (b. Schulze And W. Whiteley) -- chapter 62 Rigidity Of Symmetric Frameworks (b. Schulze And W. Whiteley) -- chapter 63 Global rigidity (T. Jordan and W. Whiteley) -- chapter 64 Crystals, Periodic And Aperiodic (m. Senechal) -- chapter 65 Applications To Structural Molecular Biology (h. Edelsbrunner And P. Koehl) -- chapter 66 Geometry and topology of genomic (A.J. Blumberg and R. Rabadan) -- part Part VIII. Geometric Software -- chapter 67 Software (m. Joswig And B. Lorenz) -- chapter 68 Two computational geometry libraries: LEDA and CGAL (M. Homann, L. Kettner, and S. N?aher).
    Additional Edition: Print version: ISBN 9781315119601
    Additional Edition: ISBN 9781498711425
    Language: English
    Keywords: Electronic book. ; Electronic books. ; Handbooks and manuals.
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    UID:
    almahu_9949865797702882
    Format: 1 online resource : , text file, PDF.
    Edition: Third edition.
    ISBN: 9781315119601 , 1315119609 , 9781498711425 , 1498711421 , 9781351645911 , 1351645919
    Series Statement: Discrete Mathematics and Its Applications
    Content: "The Handbook of Discrete and Computational Geometry is intended as a reference book fully accessible to nonspecialists as well as specialists, covering all major aspects of both fields. The book offers the most important results and methods in discrete and computational geometry to those who use them in their work, both in the academic world--as researchers in mathematics and computer science--and in the professional world--as practitioners in?elds as diverse as operations research, molecular biology, and robotics. Discrete geometry has contributed signi?cantly to the growth of discrete mathematics in recent years. This has been fueled partly by the advent of powerful computers and by the recent explosion of activity in the relatively young?eld of computational geometry. This synthesis between discrete and computational geometry lies at the heart of this Handbook. A growing list of application fields includes combinatorial optimization, computer-aided design, computer graphics, crystallography, data analysis, error-correcting codes, geographic information systems, motion planning, operations research, pattern recognition, robotics, solid modeling, and tomography."--Provided by publisher.
    Note: Part Part I. Combinatorial And Discrete Geometry -- chapter 1 Finite point congurations (J. Pach) -- chapter 2 Packing and covering (G. Fejes Toth) -- chapter 3 Tilings (e. Harriss, D. Schattschneider, And M. Senechal) -- chapter 4 Helly-type Theorems And Geometric Transversals (a. Holmsen And R. Wenger) -- chapter 5 Pseudoline Arrangements (s. Felsner And J.e. Goodman) -- chapter 6 Oriented Matroids (j. Richter-gebert And G.m. Ziegler) -- chapter 7 Lattice Points And Lattice Polytopes (a. Barvinok) -- chapter 8 Low-distortion embeddings of nite metric spaces (P. Indyk, J. Matousek, and A. Sidiropoulos) -- chapter 9 Geometry And Topology Of Polygonal Linkages (r. Connelly And E.d. Demaine) -- chapter 10 Geometric Graph Theory (j. Pach) -- chapter 11 Euclidean Ramsey Theory (r.l. Graham) -- chapter 12 Discrete Aspects Of Stochastic Geometry (r. Schneider) -- chapter 13 Geometric Discrepancy Theory And Uniform Distribution (j.r. Alexander, J. Beck, And W.w.l. Chen) -- chapter 14 Polyominoes (g. Barequet, S.w. Golomb, And D.a. Klarner) -- part Part II. Polytopes And Polyhedra -- chapter 15 Basic Properties Of Convex Polytopes (m. Henk, J. Richter-gebert, And G.m. Ziegler) -- chapter 16 Subdivisions And Triangulations Of Polytopes (c.w. Lee And F. Santos) -- chapter 17 Face numbers of polytopes and complexes (L.J. Billera and A. Bj?orner) -- chapter 18 Symmetry Of Polytopes And Polyhedra (e. Schulte) -- chapter 19 Polytope Skeletons And Paths (g. Kalai) -- chapter 20 Polyhedral Maps (u. Brehm And E. Schulte) -- part Part III. Combinatorial And Computational Topology -- chapter 21 Topological methods in discrete geometry (R.T. Zivaljevic) -- chapter 22 Random Simplicial Complexes (m. Kahle) -- chapter 23 Computational topology of graphs on surfaces (E. Colin de Verdiere) -- chapter 24 Persistent Homology (h. Edelsbrunner And D. Morozov) -- chapter 25 High-dimensional Topological Data Analysis (f. Chazal) -- part Part IV. Algorithms And Complexity Of Fundamental Geometric Objects -- chapter 26 Convex Hull Computations (r. Seidel) -- chapter 27 Voronoi Diagrams And Delaunay Triangulations (s. Fortune) -- chapter 28 Arrangements (d. Halperin And M. Sharir) -- chapter 29 Triangulations And Mesh Generation (m. Bern, J. Shewchuk, And N. Amenta) -- chapter 30 Polygons (J. O'Rourke, S. Suri, and C.D. Toth) -- chapter 31 Shortest Paths And Networks (j.s.b. Mitchell) -- chapter 32 Proximity Algorithms (j.s.b. Mitchell And W. Mulzer) -- chapter 33 Visibility (j. O'rourke) -- chapter 34 Geometric Reconstruction Problems (y. Disser And S.s. Skiena) -- chapter 35 Curve And Surface Reconstruction (t.k. Dey) -- chapter 36 Computational Convexity (p. Gritzmann And V. Klee) -- chapter 37 Computational And Quantitative Real Algebraic Geometry (s. Basu And B. Mishra) -- part Part V. Geometric Data Structures And Searching -- chapter 38 Point Location (j. Snoeyink) -- chapter 39 Collision And Proximity Queries (y. Kim, M.c. Lin, And D. Manocha) -- chapter 40 Range Searching (p.k. Agarwal) -- chapter 41 Ray Shooting And Lines In Space (m. Pellegrini) -- chapter 42 Geometric Intersection (d.m. Mount) -- chapter 43 Nearest Neighbors In High-dimensional Spaces (a. Andoni And P. Indyk) -- part Part VI. Computational Techniques -- chapter 44 Randomizaton And Derandomization (o. Cheong, K. Mulmuley, And E. Ramos) -- chapter 45 Robust Geometric Computation (v. Sharma And C.k. Yap) -- chapter 46 Parallel Algorithms In Geometry (m.t. Goodrich And N. Sitchinava) -- chapter 47 Epsilon-approximations And Epsilon-nets (n. Mustafa And K. Varadarajan) -- chapter 48 Coresets And Sketches (j. Phillips) -- part Part VII. Applications Of Discrete And Computational Geometry -- chapter 49 Linear programming (M. Dyer, B. G?artner, N. Megiddo, and E. Welzl) -- chapter 50 Algorithmic Motion Planning (d. Halperin, O. Salzman, And M. Sharir) -- chapter 51 Robotics (d. Halperin, L.e. Kavraki, And K. Solovey) -- chapter 52 Computer Graphics (d. Dobkin And S. Teller) -- chapter 53 Modeling motion (L.J. Guibas and M. Roelozen) -- chapter 54 Pattern Recognition (j. O'rourke And G.t. Toussaint) -- chapter 55 Graph Drawing (e. Di Giacomo, G. Liotta, And R. Tamassia) -- chapter 56 Splines And Geometric Modeling (c.l. Bajaj) -- chapter 57 Solid modeling (C.M. Homann and V. Shapiro) -- chapter 58 Computation Of Robust Statistics: Depth, Median, And Related Measures (p.j. Rousseeuw And M. Hubert) -- chapter 59 Geographic Information Systems (m. Van Kreveld) -- chapter 60 Geometric Applications Of The Grassmann-cayley Algebra (n.l. White) -- chapter 61 Rigidity And Scene Analysis (b. Schulze And W. Whiteley) -- chapter 62 Rigidity Of Symmetric Frameworks (b. Schulze And W. Whiteley) -- chapter 63 Global rigidity (T. Jordan and W. Whiteley) -- chapter 64 Crystals, Periodic And Aperiodic (m. Senechal) -- chapter 65 Applications To Structural Molecular Biology (h. Edelsbrunner And P. Koehl) -- chapter 66 Geometry and topology of genomic (A.J. Blumberg and R. Rabadan) -- part Part VIII. Geometric Software -- chapter 67 Software (m. Joswig And B. Lorenz) -- chapter 68 Two computational geometry libraries: LEDA and CGAL (M. Homann, L. Kettner, and S. N?aher).
    Additional Edition: Print version: ISBN 9781315119601
    Additional Edition: ISBN 9781498711425
    Language: English
    Keywords: Handbooks and manuals
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Online Resource
    Online Resource
    Boca Raton ; London ; New York : CRC Press, Taylor & Francis Group
    UID:
    b3kat_BV046896736
    Format: 1 Online-Ressource (xxi, 1927 Seiten) , Illustrationen, Diagramme
    Edition: third edition
    ISBN: 9781315119601
    Series Statement: Discrete mathematics and its applications
    Note: Includes bibliographical references
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-1-4987-1139-5
    Language: English
    Keywords: Diskrete Geometrie ; Algorithmische Geometrie
    URL: Volltext  (URL des Erstveröffentlichers)
    Author information: Goodman, Jacob E. 1933-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Did you mean 9781315111001?
Did you mean 9781315115603?
Did you mean 9781315112602?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages