|
" Discrete and Computational Geometry The Goodman-Pollack Festschrift "
Boris Aronov
| Document Type
|
:
|
BL
|
| Record Number
|
:
|
724484
|
| Doc. No
|
:
|
b544203
|
| Main Entry
|
:
|
Boris Aronov
|
| Title & Author
|
:
|
Discrete and Computational Geometry The Goodman-Pollack Festschrift\ Boris Aronov
|
| Publication Statement
|
:
|
Berlin Springer Berlin, 2013
|
| Series Statement
|
:
|
Algorithms and Combinatorics, 25
|
| Page. NO
|
:
|
XXIV, 853 Seiten in 2 Teilen XXIV, 853 Seiten, 39 schw.-w. Illustrationen 235 x 155 mm
|
| ISBN
|
:
|
3642624421
|
|
|
:
|
: 9783642624421
|
| Contents
|
:
|
On the Complexity of Many Faces in Arrangements of Pseudo-Segments and of Circles.- Polyhedral Cones of Magic Cubes and Squares.- of the Polygons.- 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 C Phirotopes and Their Realizations in Rank.- Covering the Sphere by Equal Spherical Balls.- Lower Bounds for High Dimensional Nearest Neighbor Searchand Related Problems.- A Tur'an-type Extremal Theory of Convex Geometric Graphs.- Relaxation.- A Lower Bound on the Complexity of Approximate Nearest-NeighborSearching on the Hamming.- 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.- 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 Rd.- Jacobi Decomposition and Eigenvalues of Symmetric Matrices.- Discrete Geometry on Red and Blue Points in the PlaneC A Survey C.- Configurations with Rational Angles and Trigonometric DiophantineEquations.- Reconstructing Sets From Interpoint Distances.- 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 Maximal Regular Simplices Determined by n Points in Rd.- 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 k-Fans.- Qualitative Infinite Version of Erd?s' Problem About Empty Polygons.
|
| LC Classification
|
:
|
QA167.B675 2013
|
| Added Entry
|
:
|
Boris Aronov
|
|
|
:
|
Janos Pach
|
|
|
:
|
Micha Sharir
|
|
|
:
|
Saugata Basu
|
| |