Del i serien DIMACS: Series in Discrete Mathematics and Theoretical Computer Science

Discrete and Computational Geometry

Papers from the DIMACS Special Year

Inbunden, Engelska, 1991

AvJacob E. Goodman,Richard Pollack,William Steiger

1 539 kr

Beställningsvara. Skickas inom 11-20 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

The first DIMACS special year, held during 1989-1990, was devoted to discrete and computational geometry. The workshops addressed the following topics: geometric complexity, probabilistic methods in discrete and computational geometry, polytopes and convex sets, arrangements, and algebraic and practical issue in geometric computation. This volume presents results of the workshops and the special year activities. Containing both survey articles and research papers, this collection presents an excellent overview of discrete and computational geometry. The diversity of these papers demonstrate how geometry continues to provide a vital source of ideas in theoretical computer science and discrete mathematics as well as fertile ground for interaction and stimulation between the two disciplines.

Produktinformation

Utgivningsdatum1991-12-30
Vikt907 g
FormatInbunden
SpråkEngelska
SerieDIMACS: Series in Discrete Mathematics and Theoretical Computer Science
Antal sidor388
FörlagAmerican Mathematical Society
ISBN9780821865958

Tillhör följande kategorier

Matematik inom Naturvetenskap och teknik
Topologi inom Naturvetenskap och teknik

Geometric partitioning and its applications by P. K. Agarwal On the convex hull of the integer points in a disc by A. Balog and I. Barany Horizon theorems for lines and polygons by M. Bern, D. Eppstein, P. Plassmann, and F. Yao On the perimeter of a point set in the plane by V. Capolyeas and J. Pach Lines in space--A collection of results by H. Edelsbrunner Singularities of minimal surfaces and networks and related extremal problems in Minkowski space by Z. Furedi, J. C. Lagarias, and F. Morgan Wu-Ritt characteristic sets and their complexity by G. Gallo and B. Mishra Algorithms in real algebraic geometry and applications to computational geometry by J. Heintz, T. Recio, and M.-F. Roy Ehrhart polynomials of convex polytopes, $h$-vectors of simplicial complexes, and nonsingular projective toric varieties by T. Hibi Unimodular fans, linear codes, and toric manifolds by P. Kleinschmidt, N. Schwartz, and B. Sturmfels New results for simplicial spherical polytopes by P. Kleinschmidt and Z. Smilansky Rational-function-valued valuations on polyhedra by J. Lawrence Winding numbers and the generalized lower-bound conjecture by C. W. Lee Computing the center of planar point sets by J. Matousek Finite quotients of infinite universal polytopes by P. McMullen and E. Schulte The universality theorem on the oriented matroid stratification of the space of real matrices by N. Mnev The densest double-lattice packing of a convex polygon by D. M. Mount Arrangements in topology by P. Orlik Notes on geometric graph theory by J. Pach Recent progress on the complexity of the decision problem for the reals by J. Renegar Sweeping arrangements of curves by J. Snoeyink and J. Hershberger On geometric permutations and the Katchalski-Lewis conjecture on partial transversals for translates by H. Tverberg Invariant-theoretic computation in projective geometry by N. L. White.