Twentieth Anniversary Volume: Discrete & Computational Geometry

ISBN-13: 9780387873626 / Angielski / Miękka / 2008 / 635 str.

Jacob E. Goodman; Janos Pach; Richard Pollack

Opis

While we were busy putting together the present collection of articles celebrating the twentieth birthday of our journal, Discrete & Computational Geometry, and, in a way, of the ?eld that has become known under the same name, two more years have elapsed. There is no doubt that DCG has crossed the line between childhood and adulthood. By the mid-1980s it became evident that the solution of many algorithmic qu- tions in the then newly emerging ?eld of computational geometry required classical methodsandresultsfromdiscreteandcombinatorialgeometry. Forinstance, visibility and ray shooting problems arising in computer graphics often reduce to Helly-type questions for line transversals; the complexity (hardness) of a variety of geometric algorithms depends on McMullen s upper bound theorem on convex polytopes or on the maximum number of halving lines determined by 2n points in the plane, that is, the number of different ways a set of points can be cut by a straight line into two parts of the same size; proximity questions stemming from several application areas turn out to be intimately related to Erdos s classical questions on the distribution of distances determined by n points in the plane or in space. On the other hand, the algorithmic point of view has fertilized several ?elds of c- vexity and of discrete geometry which had lain fallow for some years, and has opened new research directions."

Spis treści

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.

O autorze

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.

Blurb

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