MOMENTAN AUSVERKAUFT

Wiley Series in Discrete Mathematics and Optimization Ser.: Combinatorial Geometry by János Pach and Pankaj K. Agarwal (1995, Hardcover)

Über dieses Produkt

Product Identifiers

PublisherWiley & Sons, Incorporated, John
ISBN-100471588903
ISBN-139780471588900
eBay Product ID (ePID)834559

Product Key Features

Number of Pages384 Pages
Publication NameCombinatorial Geometry
LanguageEnglish
Publication Year1995
SubjectGeometry / General
TypeTextbook
AuthorJános Pach, Pankaj K. Agarwal
Subject AreaMathematics
SeriesWiley Series in Discrete Mathematics and Optimization Ser.
FormatHardcover

Dimensions

Item Height1.2 in
Item Weight26.6 Oz
Item Length9.4 in
Item Width6.4 in

Additional Product Features

Edition Number1
Intended AudienceScholarly & Professional
LCCN94-048203
Dewey Edition20
Series Volume Number37
IllustratedYes
Dewey Decimal516/.13
Table Of ContentARRANGEMENTS OF CONVEX SETS. Geometry of Numbers. Approximation of a Convex Set by Polygons. Packing and Covering with Congruent Convex Discs. Lattice Packing and Lattice Covering. The Method of Cell Decomposition. Methods of Blichfeldt and Rogers. Efficient Random Arrangements. Circle Packings and Planar Graphs. ARRANGEMENTS OF POINTS AND LINES. Extremal Graph Theory. Repeated Distances in Space. Arrangement of Lines. Applications of the Bounds on Incidences. More on Repeated Distances. Geometric Graphs. Epsilon Nets and Transversals of Hypergraphs. Geometric Discrepancy. Hints to Exercises. Bibliography. Indexes.
SynopsisA complete, self-contained introduction to a powerful and resurging mathematical discipline Combinatorial Geometry presents and explains with complete proofs some of the most important results and methods of this relatively young mathematical discipline, started by Minkowski, Fejes Tth, Rogers, and Erd's. Nearly half the results presented in this book were discovered over the past twenty years, and most have never before appeared in any monograph. Combinatorial Geometry will be of particular interest to mathematicians, computer scientists, physicists, and materials scientists interested in computational geometry, robotics, scene analysis, and computer-aided design. It is also a superb textbook, complete with end-of-chapter problems and hints to their solutions that help students clarify their understanding and test their mastery of the material. Topics covered include: Geometric number theory Packing and covering with congruent convex disks Extremal graph and hypergraph theory Distribution of distances among finitely many points Epsilon-nets and Vapnik Chervonenkis dimension Geometric graph theory Geometric discrepancy theory And much more, A complete, self-contained introduction to a powerful and resurgingmathematical discipline . Combinatorial Geometry presents andexplains with complete proofs some of the most important resultsand methods of this relatively young mathematical discipline, started by Minkowski, Fejes Toth, Rogers, and Erd s. Nearly halfthe results presented in this book were discovered over the pasttwenty years, and most have never before appeared in any monograph.Combinatorial Geometry will be of particular interest tomathematicians, computer scientists, physicists, and materialsscientists interested in computational geometry, robotics, sceneanalysis, and computer-aided design. It is also a superb textbook, complete with end-of-chapter problems and hints to their solutionsthat help students clarify their understanding and test theirmastery of the material. Topics covered include: * Geometric number theory * Packing and covering with congruent convex disks * Extremal graph and hypergraph theory * Distribution of distances among finitely many points * Epsilon-nets and Vapnik--Chervonenkis dimension * Geometric graph theory * Geometric discrepancy theory * And much more, A complete, self-contained introduction to a powerful and resurging mathematical discipline Combinatorial Geometry presents and explains with complete proofs some of the most important results and methods of this relatively young mathematical discipline, started by Minkowski, Fejes Tóth, Rogers, and Erd's. Nearly half the results presented in this book were discovered over the past twenty years, and most have never before appeared in any monograph. Combinatorial Geometry will be of particular interest to mathematicians, computer scientists, physicists, and materials scientists interested in computational geometry, robotics, scene analysis, and computer-aided design. It is also a superb textbook, complete with end-of-chapter problems and hints to their solutions that help students clarify their understanding and test their mastery of the material. Topics covered include: Geometric number theory Packing and covering with congruent convex disks Extremal graph and hypergraph theory Distribution of distances among finitely many points Epsilon-nets and Vapnik--Chervonenkis dimension Geometric graph theory Geometric discrepancy theory And much more, A complete, self-contained introduction to a powerful and resurging mathematical discipline. Combinatorial Geometry presents and explains with complete proofs some of the most important results and methods of this relatively young mathematical discipline, started by Minkowski, Fejes Toth, Rogers, and Erd's.
LC Classification NumberQA167.P33 1995