Vor Ort
Merkzettel Warenkorb
Produktbild: Twentieth Anniversary Volume: Discrete & Computational Geometry
- 12%

Twentieth Anniversary Volume: Discrete & Computational Geometry

12% sparen

93,99 € UVP 106,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

13.11.2008

Abbildungen

XVIII, 212 illus., schwarz-weiss Illustrationen

Herausgeber

Jacob E. Goodman + weitere

Verlag

Springer Us

Seitenzahl

635

Maße (L/B/H)

23,5/15,5/3,6 cm

Gewicht

991 g

Auflage

2009

Sprache

Englisch

ISBN

978-0-387-87362-6

Beschreibung

Portrait

Jacob Goodman, Richard Pollack and János Pach are each distinguished professors and authors in their own right, and together they are the pre-eminent founders and editors-in-chief of the journal, Discrete & Computational Geometry . Over the 20 years since the founding of this premiere journal, it has become synonymous with the field of discrete and computational geometry itself.

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

13.11.2008

Abbildungen

XVIII, 212 illus., schwarz-weiss Illustrationen

Herausgeber

Verlag

Springer Us

Seitenzahl

635

Maße (L/B/H)

23,5/15,5/3,6 cm

Gewicht

991 g

Auflage

2009

Sprache

Englisch

ISBN

978-0-387-87362-6

Herstelleradresse

Springer-Verlag GmbH
Tiergartenstr. 17
69121 Heidelberg
DE

Email: GPSR Kontakt

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Twentieth Anniversary Volume: Discrete & Computational Geometry
  • Preface.- There are Not too Many Magic Configurations.- Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D.- Robus Shape Fitting via Peeling and Grating Coresets.- Siegel's LEmaa and Sum-Distinct Sets.- Slicing Convex Sets and Measures by a Hyperplane.- A Centrally Symmetric Version of the Cyclic Polytope.- On Projections of Semi-Algebraic Sets Defined by Few Quadratic Inequalities.- Enumeration in Convex Geometries and Associated Polytopal Subdivisions of Spheres.- Isotopic Implicit Surface Meshing.- Line Transversals to Disjoint Balls.- Generating all Vertices of a Polyhedron is Hard.- Norm Bounds for Ehrhart Polynominal Roots.- Helly-Type Theorems for Line Transversals to Disjoint Unit Balls.- Grid Vertex-Unfolding Orthogonal Polyhedra.- Empty Convex Hexagons in Planar Point Sets.- Affinely Regular Polygons are Extremals of Area Functionals.- Improved Output-Sensitive Snap Rounding.- Pure Point Diffractive Substitution Delone Sets Have the Meyer Property.- Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings.- Empty Simplices of Polytopes and Graded Betti Numbers.- Rigidity and the Lower Bound Theorem for Doubly Cohen–Macaulay Complexes.- Finding the Homology of Submanifolds with HIgh Confidence from Random Samples.- Odd Crossing Number and Crossing Number are Not the Same.- Visibility Graphs of Point Sets in the Plane.- Decomposability of Polytopes.- An Inscribing Model for Random Polytopes.- An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions.- Genral-Dimensional Constrained Delaunay nad Constrained Regular Triangulation, I: Combinatorial Properties.