000			05406nam a22005055i 4500
001			978-0-387-87363-3
003			DE-He213
005			20251006084426.0
007			cr nn 008mamaa
008			100301s2009 xxu| s |||| 0|eng d
020			_a9780387873633
020			_a99780387873633
024	7		_a10.1007/978-0-387-87363-3 _2doi
100	1		_aPollack, Richard. _eeditor.
245	1	0	_aTwentieth Anniversary Volume: _h[electronic resource] : _bDiscrete & Computational Geometry / _cedited by Richard Pollack, János Pach, Jacob E. Goodman.
264		1	_aNew York, NY : _bSpringer New York, _c2009.
300			_bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
505	0		_aThere 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.
520			_aThis 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
650		0	_aMATHEMATICS.
650		0	_aCOMPUTATIONAL COMPLEXITY.
650		0	_aCOMPUTER GRAPHICS.
650		0	_aGEOMETRY, ALGEBRAIC.
650		0	_aCOMPUTER SCIENCE _xMATHEMATICS.
650		0	_aDISCRETE GROUPS.
650	1	4	_aMATHEMATICS.
650	2	4	_aALGEBRAIC GEOMETRY.
650	2	4	_aCOMPUTATIONAL MATHEMATICS AND NUMERICAL ANALYSIS.
650	2	4	_aCOMPUTER GRAPHICS.
650	2	4	_aDISCRETE MATHEMATICS IN COMPUTER SCIENCE.
650	2	4	_aCONVEX AND DISCRETE GEOMETRY.
700	1		_aPach, János. _eeditor.
700	1		_aGoodman, Jacob E. _eeditor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9780387873626
856	4	0	_uhttp://dx.doi.org/10.1007/978-0-387-87363-3 _zVer el texto completo en las instalaciones del CICY
912			_aZDB-2-SMA
942			_2ddc _cER
999			_c59303 _d59303