Twentieth Anniversary Volume: Discrete & Computational Geometry

Editors: Goodman, Jacob E., Pach, János, Pollack, Richard (Eds.)

  • Presents a comprehensive picture of the current state of the field of discrete and computational geometry
  • Includes an expanded preface with a set of photographs of groups and individuals who have played a major role in the history of the field in the past twenty years
  • Contains twenty-eight major articles chosen for the importance of their results, the breadth of their scope, and their depiction of the intimate connections between discrete and computational geometry and other areas of both computer science and mathematics
  • Some articles solve long-outstanding problems in the field
  • Editors are preeminent founders of the journal and the field itself
see more benefits

Buy this book

eBook $99.00
price for USA (gross)
  • ISBN 978-0-387-87363-3
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $129.00
price for USA
  • ISBN 978-0-387-87362-6
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

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

About the authors

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.

Table of contents (28 chapters)

  • Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings

    Miller, Ezra (et al.)

    Pages 1-50

  • Pure Point Diffractive Substitution Delone Sets Have the Meyer Property

    Lee, Jeong-Yup (et al.)

    Pages 1-20

  • Affinely Regular Polygons as Extremals of Area Functionals

    Gronchi, Paolo (et al.)

    Pages 1-25

  • An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions

    Schreiber, Yevgeny (et al.)

    Pages 1-80

  • Odd Crossing Number and Crossing Number Are Not the Same

    Pelsmajer, Michael J (et al.)

    Pages 1-13

Buy this book

eBook $99.00
price for USA (gross)
  • ISBN 978-0-387-87363-3
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $129.00
price for USA
  • ISBN 978-0-387-87362-6
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Twentieth Anniversary Volume: Discrete & Computational Geometry
Editors
  • Jacob E. Goodman
  • János Pach
  • Richard Pollack
Copyright
2009
Publisher
Springer-Verlag New York
Copyright Holder
Springer-Verlag New York
eBook ISBN
978-0-387-87363-3
DOI
10.1007/978-0-387-87363-3
Softcover ISBN
978-0-387-87362-6
Edition Number
1
Number of Pages
XVIII, 635
Number of Illustrations and Tables
212 b/w illustrations
Topics