About the Book
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 74. Chapters: Squaring the square, Delaunay triangulation, Penrose tiling, Arrangement of lines, Oriented matroid, Kakeya set, Packing problem, Sylvester-Gallai theorem, Voronoi diagram, Kepler conjecture, Nearest neighbor search, K-set, Happy Ending problem, Radon's theorem, Integer triangle, Sphere packing, Davenport-Schinzel sequence, Close-packing of spheres, Straight skeleton, Arrangement of hyperplanes, Heronian triangle, Erd s-Szekeres theorem, Kissing number problem, Napkin folding problem, Regular map, Ammann-Beenker tiling, Mountain climbing problem, Hadwiger conjecture, Helly's theorem, Beck's theorem, Erd s distinct distances problem, Four-vertex theorem, Necklace splitting problem, Pinwheel tiling, Self-avoiding walk, Szemeredi-Trotter theorem, Caratheodory's theorem, Flexible polyhedron, Pitteway triangulation, Borsuk's conjecture, Cauchy's theorem, Discrete Green's theorem, Covering problem of Rado, Tarski's circle-squaring problem, Krein-Milman theorem, Orchard-planting problem, Carpenter's rule problem, Kobon triangle problem, Erd s-Diophantine graph, Bolyai-Gerwien theorem, Moving sofa problem, Heilbronn triangle problem, Slothouber-Graatsma puzzle, Tverberg's theorem, Centroidal Voronoi tessellation, Point set triangulation, Bedlam cube, Vertex enumeration problem, De Bruijn-Erd s theorem, Weighted Voronoi diagram, Erd s-Anning theorem, Erd s-Nagy theorem, Geometric combinatorics, Conway puzzle, Disk covering problem, Dissection problem, Moser's worm problem, Honeycomb conjecture, Quaquaversal tiling, Constrained Delaunay triangulation, Guillotine problem, De Bruijn's theorem, Supersoluble arrangement. Excerpt: A Penrose tiling is a non-periodic tiling generated by an aperiodic set of prototiles named after Sir Roger Penrose, who investigated these sets in the 1970s. The aperiodicity of the Penrose prototiles i...
