Twentieth Anniversary Volume: Discrete & Computational Geometry /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Pollack, Richard (Επιμελητής έκδοσης), Pach, János (Επιμελητής έκδοσης), Goodman, Jacob E. (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: New York, NY : Springer New York, 2009.
• Θέματα: Mathematics.; Computer science > Mathematics.; Computer graphics.; Algebraic geometry.; Computer mathematics.; Convex geometry.; Discrete geometry.; Discrete mathematics.; Convex and Discrete Geometry.; Discrete Mathematics.; Algebraic Geometry.; Discrete Mathematics in Computer Science.; Computer Graphics.; Computational Mathematics and Numerical Analysis.

This commemorative book contains the 28 major articles that appeared in the 2008 Twentieth Anniversary Issue of the journal Discrete & Computational Geometry, and presents a comprehensive picture of the current state of the field. Formed during the past few decades by the merger of the classical...

Πίνακας περιεχομένων:

• There Are Not Too Many Magic Configurations
• Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles
• Robust Shape Fitting via Peeling and Grating Coresets
• Siegel’s Lemma 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
• Norm Bounds for Ehrhart Polynomial 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 as Extremals of Area Functionals
• Improved Output-Sensitive Snap Rounding
• Generating All Vertices of a Polyhedron Is Hard
• 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
• General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties.