Twentieth Anniversary Volume: Discrete & Computational Geometry

Twentieth Anniversary Volume: Discrete & Computational Geometry edited by Jacob E. Goodman, János Pach, Richard Pollack.

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...

Full description

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Goodman, Jacob E. (Editor), Pach, János (Editor), Pollack, Richard (Editor)
Format: eBook
Language:English
Published: New York, NY : Springer New York : Imprint: Springer, 2009.
Edition:1st ed. 2009.
Series:Springer eBook Collection.
Subjects:
Convex geometry .
Discrete geometry.
Discrete mathematics.
Algebraic geometry.
Computer science—Mathematics.
Computer graphics.
Computer mathematics.
Electronic resources (E-books)
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Table of Contents:
  • 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.

Similar Items