Geschäftskunden Kundenprogramme
Vor Ort
Merkzettel Warenkorb
Produktbild: Discrete and Computational Geometry
Band 25

Discrete and Computational Geometry The Goodman-Pollack Festschrift

Aus der Reihe Algorithms and Combinatorics

Fr. 192.00

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

12.11.2012

Herausgeber

Boris Aronov + weitere

Verlag

Springer Berlin

Seitenzahl

853

Maße (L/B/H)

23.5/15.5/4.8 cm

Gewicht

1331 g

Auflage

Softcover reprint of the original 1st ed. 2003

Sprache

Englisch

ISBN

978-3-642-62442-1

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

12.11.2012

Herausgeber

Verlag

Springer Berlin

Seitenzahl

853

Maße (L/B/H)

23.5/15.5/4.8 cm

Gewicht

1331 g

Auflage

Softcover reprint of the original 1st ed. 2003

Sprache

Englisch

ISBN

978-3-642-62442-1

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: GPSR Kontakt

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Discrete and Computational Geometry
  • 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.