Discrete and computational geometry

The goodman-pollack festschrift

B. Aronov

862 pages, parution le 24/07/2003

Ajouter à une liste

Indisponible

Résumé

An impressive collection of original research papers in discrete and computational geometry, contributed by many leading researchers in these fields, as a tribute to Jacob E. Goodman and Richard Pollack, two of the ‘founding fathers' of the area, on the occasion of their 2/3 x 100 birthdays. The topics covered by the 41 papers provide professionals and graduate students with a comprehensive presentation of the state of the art in most aspects of discrete and computational geometry, including geometric algorithms, study of arrangements, geometric graph theory, quantitative and algorithmic real algebraic geometry, with important connections to algebraic geometry, convexity, polyhedral combinatorics, the theory of packing, covering, and tiling. The book serves as an invaluable source of reference in this discipline.

Contributors : S. Basu; J.Pach; M. Sharir

On the complexity of many faces in arrangements of pseudo-segments and of circles
Polyhedral cones of magic cubes and squares
Congruent Dudeney dissections of triangles and convex quadrilaterals with hinge points on the sides of the polygon
Computing the Hausdorff distance of geometric patterns and shapes
A sum of squares theorem for visibility complexes and applications
On the reflexivity of point sets
Geometric permutations of large families of translates
Integer points in rotating convex bodies
Complex matroids, phirotopes and their realizations in rank 2
Covering the sphere by equal spherical balls
Lower bounds for high dimensional nearest neighbor search and related problems
A Turan-type Extremal theory of convex geometric graphs
On the approximability of polynomial-programming, the geometry of stable sets, and the power of relaxation
A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube
Detecting undersampling in surface reconstruction
A survey of the Hadwiger-Debrunner (p,q)-problem
Surface reconstruction by wrapping finite sets in space
Infeasibility of systems of halfspaces
Complete Combinatorial generation of small point configurations and hyperplane arrangements
Relative closure and the complexity of Pfaffian elimination
Are your polyhedra the same as my polyhedra?
Some algorithms arising in the proof of the Kepler conjecture
The minimal Number of Triangles Needed to Span a Polygon Embedded in R^d
Jacobi decomposition and eigenvalues of symmetric matrices
Discrete geometry on red and blue points in the plane -- A survey
Configurations with rational angles and trigonometric Diphantine equations
Dense packings of congruent circles in rectangles with a variable aspect ratio
Colorings and homomorphisms of minor closed classes
Conflict free colorings
New complexity bounds for cylindrical decompositions of sub-Pfaffian sets
Note on the chromatic number of the space
Expansive motions and the polytope of pointed pseudo-triangulations
Some recent quantitative and algorithmic results in real algebraic geometry
A discrete isoperimetric inequality and its application to sphere packings
On the number of regular simplices determined by n points in R^d
Balanced lines, halving triangles, and the generalized lower bound theorem
Quantizing using lattice intersections
Note on a generalization of Roth's theorem
Arrangements, equivariant maps and partitions of measures by 4-fans
Qualitative infinite version of Erdos' problem about empty polygons

Caractéristiques techniques

	PAPIER
Éditeur(s)	Springer
Auteur(s)	B. Aronov
Parution	24/07/2003
Nb. de pages	862
Format	16 x 24
Couverture	Relié
Poids	1335g
Intérieur	Noir et Blanc
EAN13	9783540003717