Hugendubel.info - Die B2B Online-Buchhandlung 

Merkliste
Die Merkliste ist leer.
Bitte warten - die Druckansicht der Seite wird vorbereitet.
Der Druckdialog öffnet sich, sobald die Seite vollständig geladen wurde.
Sollte die Druckvorschau unvollständig sein, bitte schliessen und "Erneut drucken" wählen.

Discrete and Computational Geometry, 2 Pts.

The Goodman-Pollack Festschrift
BuchKartoniert, Paperback
853 Seiten
Englisch
Springererschienen am12.11.2012Softcover reprint of the original 1st ed. 2003
With contributions by numerous expertsmehr
Verfügbare Formate
BuchGebunden
EUR160,49
BuchKartoniert, Paperback
EUR160,49
E-BookPDF1 - PDF WatermarkE-Book
EUR149,79

Produkt

KlappentextWith contributions by numerous experts
Zusammenfassung
Details
ISBN/GTIN978-3-642-62442-1
ProduktartBuch
EinbandartKartoniert, Paperback
Verlag
Erscheinungsjahr2012
Erscheinungsdatum12.11.2012
AuflageSoftcover reprint of the original 1st ed. 2003
ReiheAlgorithms and Combinatorics
Seiten853 Seiten
SpracheEnglisch
Gewicht1378 g
IllustrationenXII, 853 p.
Artikel-Nr.29953337

Inhalt/Kritik

Inhaltsverzeichnis
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 Plane¨C 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.mehr

Schlagworte

Autor