Twentieth Anniversary Volume: Discrete & Computational Geometry / Edition 1

Paperback (Print)
Buy New
Buy New from
Used and New from Other Sellers
Used and New from Other Sellers
from $8.82
Usually ships in 1-2 business days
(Save 91%)
Other sellers (Paperback)
  • All (16) from $8.82   
  • New (11) from $12.00   
  • Used (5) from $8.82   


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 discipline of combinatorial and discrete geometry with the new field of computational geometry that sprang up in the 1970s, discrete and computational geometry now claims the allegiance of a sizeable number of mathematicians and computer scientists all over the world, whose most important work has been appearing since 1986 in the pages of the journal.

The articles in this volume, a number of which solve long-outstanding problems in the field, were chosen by the editors of DCG for the importance of their results, for the breadth of their scope, and to show the intimate connections that have arisen between discrete and computational geometry and other areas of both computer science and mathematics. Apart from the articles, the editors present an expanded preface, along with a set of photographs of groups and individuals who have played a major role in the history of the field during the past twenty years.

Contributors include:

E. Ackerman

P.K. Agarwal

I. Aliev

I. Bárány

A. Barvinok

S. Basu

L.J. Billera

J.-D. Boissonnat

C. Borcea

E. Boros

K. Borys

B. Braun

K. Buchin

O. Cheong

D. Cohen-Steiner

M. Damian

K. Elbassioni

R. Flatland

T. Gerken

J.E. Goodman

X. Goaoc

P. Gronchi

V. Gurvich

S. Har-Peled

J. Hershberger

A. Holmsen

S.K. Hsiao

A. Hubard

J. Jerónimo

L. Khachiyan

R. Klein

C. Knauer

S. Langerman

J.-Y. Lee

M. Longinetti

E. Miller

P. Morin

U. Nagel

E. Nevo

P. Niyogi

I. Novik

J. O’Rourke

J. Pach

I. Pak

M.J. Pelsmajer

S. Petitjean

F. Pfender

R. Pinchasi

R. Pollack

J.S. Provan

K. Przeslawski

R.M. Richardson

G. Rote

M. Schaefer

Y. Schreiber

M. Sharir

J.R. Shewchuk

S. Smale

B. Solomyak

M. Soss

D. Štefankovic

G. Vegter

V.H. Vu

S. Weinberger

L. Wu

D. Yost

H. Yu

T. Zell

Read More Show Less

Product Details

  • ISBN-13: 9780387873626
  • Publisher: Springer New York
  • Publication date: 11/14/2008
  • Edition description: 2009
  • Edition number: 1
  • Pages: 635
  • Product dimensions: 6.10 (w) x 9.20 (h) x 1.30 (d)

Meet the Author

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.

Read More Show Less

Table of Contents

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.

Read More Show Less

Customer Reviews

Average Rating 5
( 1 )
Rating Distribution

5 Star


4 Star


3 Star


2 Star


1 Star


Your Rating:

Your Name: Create a Pen Name or

Barnes & Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation


  • - By submitting a review, you grant to Barnes & and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Terms of Use.
  • - Barnes & reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously
Sort by: Showing 1 Customer Reviews
  • Posted June 18, 2013

    I¿m loving McDonalds for fast food... MyDeals247 for the best de

    I’m loving McDonalds for fast food... MyDeals247 for the best deals;))

    Was this review helpful? Yes  No   Report this review
Sort by: Showing 1 Customer Reviews

If you find inappropriate content, please report it to Barnes & Noble
Why is this product inappropriate?
Comments (optional)