Knowledge (XXG)

Discrete geometry

Source 📝

2332: 443: 511: 2344: 42: 2368: 2356: 1489:
Because matroids and oriented matroids are abstractions of other mathematical abstractions, nearly all the relevant books are written for mathematical scientists rather than for the general public. For learning about oriented matroids, a good preparation is to study the textbook on
637: 594: 709: 1763: 1682: 534:) as can be seen from their axiomatic definitions. Incidence structures also generalize the higher-dimensional analogs and the finite structures are sometimes called 1792: 736: 661: 1006:
and this theorem retains a prominent role in this new field. This theorem has many equivalent versions and analogs and has been used in the study of
327:
Packings, coverings, and tilings are all ways of arranging uniform objects (typically circles, spheres, or tiles) in a regular way on a surface or
1147:, and both the algebraic structure of lattices and the geometry of the totality of all lattices are relatively well understood. Deep results of 1702: 1595: 1573: 1551: 2155: 2372: 1374: 2300: 1785: 1747: 1721: 1666: 1644: 1618: 1529: 1454: 523: 1836: 2250: 2348: 1292: 212: 138: 488: 1494:
by Nering and Tucker, which is infused with oriented-matroid ideas, and then to proceed to Ziegler's lectures on polytopes.
1778: 1172: 844: 810: 2275: 1831: 954: 953:
appearing in modern simplicial homotopy theory. The purely combinatorial counterpart to a simplicial complex is an
342:
within a containing space. The spheres considered are usually all of identical size, and the space is usually three-
2394: 1846: 1336: 1183: 1022: 755: 130: 958: 208: 2260: 2232: 1869: 1351: 1331: 1321: 1175:
obtained from the 1950s through the 1970s provided examples and generalized much of the theory to the setting of
1132: 970: 420: 111: 177:, modern discrete geometry has its origins in the late 19th century. Early topics studied were: the density of 2305: 745: 281: 262:
in four dimensions). Some theories further generalize the idea to include such objects as unbounded polytopes (
186: 2190: 2180: 2150: 2084: 1819: 1356: 425: 286: 2360: 2288: 2185: 2165: 2160: 2089: 1814: 905: 896: 834: 782: 760: 610: 366: 150: 142: 122: 991: 454:
drawn as a square can be tilted over by the blue force into a parallelogram, so it is a flexible graph. K
2315: 2245: 2122: 2046: 1985: 1970: 1965: 1942: 1824: 1346: 1301: 848: 174: 110:, and so forth. The subject focuses on the combinatorial properties of these objects, such as how they 2331: 442: 30:"Combinatorial geometry" redirects here. The term combinatorial geometry is also used in the theory of 986:
In 1978, the situation was reversed – methods from algebraic topology were used to solve a problem in
2295: 2175: 2170: 2094: 1995: 1381: 1361: 1313: 798: 750: 640: 474: 72: 949:(see illustration). Simplicial complexes should not be confused with the more abstract notion of a 458:, drawn as a triangle, cannot be altered by any force that is applied to it, so it is a rigid graph. 2310: 2220: 2142: 2041: 1975: 1932: 1922: 1902: 1735: 1731: 1491: 1048: 1003: 860: 852: 818: 806: 505: 493: 437: 381: 198: 194: 551: 2336: 2255: 2195: 2127: 2117: 2056: 2031: 1907: 1864: 1859: 1757: 1676: 1195: 980: 917: 673: 291: 1264:
is replacing an object by a discrete set of its points. The images we see on the TV screen, the
1017: 510: 2036: 1980: 1927: 1743: 1717: 1698: 1662: 1640: 1614: 1591: 1569: 1547: 1525: 1450: 1442: 1341: 1317: 1276: 1164: 1136: 1128: 1124: 1082: 1063: 1055: 927: 876: 405: 301: 296: 271: 83: 2265: 2240: 2112: 1960: 1897: 1654: 1583: 1561: 1539: 1239: 1226: 1209: 1168: 931: 891: 772: 527: 415: 370: 134: 95: 87: 250:
is a geometric object with flat sides, which exists in any general number of dimensions. A
2205: 2132: 2061: 1854: 1690: 1265: 1254: 1176: 1160: 1144: 1121: 1106: 1034: 901: 872: 535: 350: 346: 170: 126: 118: 91: 50: 531: 2283: 2210: 1917: 1633: 1280: 1235: 1214: 1152: 1038: 950: 786: 721: 646: 400: 395: 358: 318: 190: 178: 146: 80: 35: 17: 2388: 2071: 2003: 1955: 1628: 1606: 1407: 1386: 1156: 1007: 987: 886: 794: 466: 216: 68: 2013: 2008: 1912: 1269: 1148: 1102: 1094: 995: 935: 790: 410: 384:
using one or more geometric shapes, called tiles, with no overlaps and no gaps. In
322: 267: 166: 1504: 277:
The following are some of the aspects of polytopes studied in discrete geometry:
27:
Branch of geometry that studies combinatorial properties and constructive methods
2215: 1879: 1802: 1468: 1246: 1187: 447: 385: 362: 1505:
Li Chen, Digital and discrete geometry: Theory and Algorithms, Springer, 2014.
2200: 2079: 1874: 1243: 1191: 864: 515: 470: 306: 263: 259: 255: 237: 76: 41: 1471:
1969. Björner et alia, Chapters 1-3. Bokowski, Chapter 1. Ziegler, Chapter 7.
1179: 343: 182: 162: 1770: 2104: 2023: 1950: 1075: 976: 939: 868: 856: 328: 241: 202: 64: 975:
The discipline of combinatorial topology used combinatorial concepts in
1889: 1305: 1086: 943: 802: 251: 107: 31: 339: 103: 99: 46: 114:
one another, or how they may be arranged to cover a larger object.
1250: 509: 478: 40: 1445:(2010), "Discrete and convex geometry", in Horváth, János (ed.), 1309: 75:
geometric objects. Most questions in discrete geometry involve
1774: 1659:
Handbook of Discrete and Computational Geometry, Second Edition
1447:
A Panorama of Hungarian Mathematics in the Twentieth Century, I
258:
in three dimensions, and so on in higher dimensions (such as a
1566:
Lectures on Sphere Arrangements - the Discrete Geometric Side
979:
and in the early 20th century this turned into the field of
1522:
Discrete geometry: in honor of W. Kuperberg's 60th birthday
446:
Graphs are drawn as rods connected by rotating hinges. The
1423:
Katona, G. O. H. (2005), "Laszlo Fejes Toth – Obituary",
388:, tessellations can be generalized to higher dimensions. 357:-dimensional Euclidean space (where the problem becomes 1480:
Björner et alia, Chapters 1-3. Bokowski, Chapters 1-4.
469:
for predicting the flexibility of ensembles formed by
724: 676: 649: 613: 554: 1300:
is the study of discrete counterparts of notions in
1268:
display of a computer, or in newspapers are in fact
930:
of a certain kind, constructed by "gluing together"
2274: 2231: 2141: 2103: 2070: 2022: 1994: 1941: 1888: 1845: 1304:. Instead of smooth curves and surfaces, there are 801:). In comparison, an ordinary (i.e., non-oriented) 1632: 1143:, this amounts to the usual geometric notion of a 859:objects. Examples include Euclidean graphs, the 1- 730: 703: 655: 631: 588: 169:had been studied for many years by people such as 1409:Intuitive Geometry, in Memoriam László Fejes Tóth 522:Incidence structures generalize planes (such as 514:Seven points are elements of seven lines in the 353:can be generalised to consider unequal spheres, 1786: 125:, and is closely related to subjects such as 8: 1762:: CS1 maint: multiple names: authors list ( 1681:: CS1 maint: multiple names: authors list ( 1425:Studia Scientiarum Mathematicarum Hungarica 117:Discrete geometry has a large overlap with 1793: 1779: 1771: 1202:, which remains an active research area. 723: 675: 648: 612: 585: 553: 1449:, New York: Springer, pp. 431–441, 441: 1412:, Alfréd Rényi Institute of Mathematics 1398: 518:, an example of an incidence structure. 71:properties and constructive methods of 1755: 1740:Excursions into Combinatorial Geometry 1674: 1661:. Boca Raton: Chapman & Hall/CRC. 1611:Research problems in discrete geometry 1139:. In the special case of subgroups of 1085:is the discrete one. For example, the 817:, and to arrangements of vectors over 391:Specific topics in this area include: 1544:Classical Topics in Discrete Geometry 380:of a flat surface is the tiling of a 338:is an arrangement of non-overlapping 7: 2355: 789:and of arrangements of vectors in a 632:{\displaystyle I\subseteq P\times L} 365:packing in higher dimensions) or to 86:of basic geometric objects, such as 2367: 1586:; Deza, Antoine; Ye, Yinyu (2013). 1375:Discrete and Computational Geometry 809:properties that are common both to 432:Structural rigidity and flexibility 254:is a polytope in two dimensions, a 1588:Discrete Geometry and Optimization 1093:, form a discrete subgroup of the 998:, thus beginning the new study of 25: 1406:Pach, János; et al. (2008), 785:that abstracts the properties of 2366: 2354: 2343: 2342: 2330: 1639:. New York: Wiley-Interscience. 1524:. New York, N.Y: Marcel Dekker. 2251:Computational complexity theory 1275:Its main application areas are 799:partially ordered vector spaces 313:Packings, coverings and tilings 1605:Brass, Peter; Moser, William; 1298:Discrete differential geometry 1293:Discrete differential geometry 1287:Discrete differential geometry 689: 677: 579: 561: 139:discrete differential geometry 1: 1714:Lectures on discrete geometry 1657:and O'Rourke, Joseph (2004). 1631:; Agarwal, Pankaj K. (1995). 1327:Topics in this area include: 1316:. It is used in the study of 1205:Topics in this area include: 1013:Topics in this area include: 882:Topics in this area include: 741:Topics in this area include: 484:Topics in this area include: 1695:Convex and Discrete Geometry 1029:Lattices and discrete groups 821:, which are not necessarily 813:, which are not necessarily 589:{\displaystyle C=(P,L,I).\,} 38:, especially in older texts. 1590:. New York, N.Y: Springer. 1568:. New York, N.Y: Springer. 1546:. New York, N.Y: Springer. 1253:of objects of the 2D or 3D 1184:semisimple algebraic groups 1131:with the property that the 955:abstract simplicial complex 704:{\displaystyle (p,l)\in I,} 2411: 2301:Films about mathematicians 1738:, Petru S. Soltan (1997). 1337:Discrete exterior calculus 1290: 1224: 1032: 1002:. Lovász's proof used the 968: 959:random geometric complexes 915: 832: 770: 643:relation. The elements of 503: 435: 316: 235: 131:combinatorial optimization 29: 2324: 1870:Philosophy of mathematics 1810: 1352:Topological combinatorics 1332:Discrete Laplace operator 1322:topological combinatorics 1000:topological combinatorics 971:Topological combinatorics 965:Topological combinatorics 947:-dimensional counterparts 187:projective configurations 2306:Recreational mathematics 607:is a set of "lines" and 426:Finite subdivision rules 282:Polyhedral combinatorics 219:laid the foundations of 2191:Mathematical statistics 2181:Mathematical psychology 2151:Engineering mathematics 2085:Algebraic number theory 1712:Matoušek, Jiří (2002). 1520:Bezdek, András (2003). 1357:Spectral shape analysis 1242:sets) considered to be 1238:sets (usually discrete 1198:initiated the study of 1070:of a topological group 906:Delaunay triangulations 897:Random geometric graphs 756:Hyperplane arrangements 232:Polyhedra and polytopes 2337:Mathematics portal 2186:Mathematical sociology 2166:Mathematical economics 2161:Mathematical chemistry 2090:Analytic number theory 1971:Differential equations 1635:Combinatorial geometry 1058:. With this topology, 835:Geometric graph theory 829:Geometric graph theory 783:mathematical structure 732: 705: 657: 633: 603:is a set of "points", 590: 519: 473:connected by flexible 459: 361:in two dimensions, or 201:by Tait, Heawood, and 151:combinatorial topology 143:geometric graph theory 123:computational geometry 61:combinatorial geometry 53: 49:and the corresponding 18:Combinatorial geometry 2316:Mathematics education 2246:Theory of computation 1966:Hypercomplex analysis 1347:Discrete Morse theory 1302:differential geometry 733: 706: 658: 634: 591: 513: 445: 44: 2296:Informal mathematics 2176:Mathematical physics 2171:Mathematical finance 2156:Mathematical biology 2095:Diophantine geometry 1716:. Berlin: Springer. 1697:. Berlin: Springer. 1613:. Berlin: Springer. 1382:Discrete mathematics 1362:Analysis on fractals 1314:simplicial complexes 912:Simplicial complexes 855:are associated with 722: 674: 647: 611: 552: 500:Incidence structures 467:combinatorial theory 2311:Mathematics and art 2221:Operations research 1976:Functional analysis 1732:Vladimir Boltyanski 1492:linear optimization 1101:(with the standard 1004:Borsuk-Ulam theorem 543:incidence structure 506:Incidence structure 463:Structural rigidity 438:Structural rigidity 292:Ehrhart polynomials 195:geometry of numbers 2256:Numerical analysis 1865:Mathematical logic 1860:Information theory 1054:equipped with the 981:algebraic topology 924:simplicial complex 918:Simplicial complex 797:(particularly for 728: 714:we say that point 701: 653: 629: 586: 520: 494:Flexible polyhedra 460: 349:. However, sphere 272:abstract polytopes 197:by Minkowski, and 54: 2395:Discrete geometry 2382: 2381: 1981:Harmonic analysis 1704:978-3-540-71132-2 1655:Goodman, Jacob E. 1597:978-3-319-00200-2 1575:978-1-4614-8117-1 1553:978-1-4419-0599-4 1342:Discrete calculus 1318:computer graphics 1277:computer graphics 1210:Reflection groups 1165:M. S. Raghunathan 1137:invariant measure 1129:discrete subgroup 1125:topological group 1083:relative topology 1068:discrete subgroup 1064:topological group 1056:discrete topology 996:Kneser conjecture 928:topological space 892:Polyhedral graphs 877:visibility graphs 767:Oriented matroids 751:Line arrangements 731:{\displaystyle l} 656:{\displaystyle I} 536:finite geometries 416:Aperiodic tilings 406:Kepler conjecture 302:Hirsch conjecture 287:Lattice polytopes 221:discrete geometry 209:László Fejes Tóth 57:Discrete geometry 16:(Redirected from 2402: 2370: 2369: 2358: 2357: 2346: 2345: 2335: 2334: 2266:Computer algebra 2241:Computer science 1961:Complex analysis 1795: 1788: 1781: 1772: 1767: 1761: 1753: 1727: 1708: 1691:Gruber, Peter M. 1686: 1680: 1672: 1650: 1638: 1624: 1601: 1579: 1557: 1535: 1507: 1501: 1495: 1487: 1481: 1478: 1472: 1466: 1460: 1459: 1439: 1433: 1432: 1420: 1414: 1413: 1403: 1232:Digital geometry 1227:Digital geometry 1221:Digital geometry 1190:. In the 1990s, 1107:rational numbers 902:Voronoi diagrams 873:unit disk graphs 779:oriented matroid 773:Oriented matroid 737: 735: 734: 729: 710: 708: 707: 702: 662: 660: 659: 654: 638: 636: 635: 630: 595: 593: 592: 587: 489:Cauchy's theorem 371:hyperbolic space 351:packing problems 135:digital geometry 63:are branches of 45:A collection of 21: 2410: 2409: 2405: 2404: 2403: 2401: 2400: 2399: 2385: 2384: 2383: 2378: 2329: 2320: 2270: 2227: 2206:Systems science 2137: 2133:Homotopy theory 2099: 2066: 2018: 1990: 1937: 1884: 1855:Category theory 1841: 1806: 1799: 1754: 1750: 1730: 1724: 1711: 1705: 1689: 1673: 1669: 1653: 1647: 1627: 1621: 1604: 1598: 1582: 1576: 1560: 1554: 1538: 1532: 1519: 1516: 1511: 1510: 1502: 1498: 1488: 1484: 1479: 1475: 1467: 1463: 1457: 1441: 1440: 1436: 1422: 1421: 1417: 1405: 1404: 1400: 1395: 1370: 1295: 1289: 1255:Euclidean space 1229: 1223: 1215:Triangle groups 1122:locally compact 1103:metric topology 1041: 1035:Lattice (group) 1033:Main articles: 1031: 1018:Sperner's lemma 973: 967: 920: 914: 841:geometric graph 837: 831: 787:directed graphs 775: 769: 720: 719: 718:"lies on" line 672: 671: 645: 644: 609: 608: 550: 549: 508: 502: 457: 453: 440: 434: 401:Sphere packings 396:Circle packings 369:spaces such as 347:Euclidean space 325: 317:Main articles: 315: 244: 236:Main articles: 234: 229: 179:circle packings 159: 127:finite geometry 119:convex geometry 51:unit disk graph 39: 28: 23: 22: 15: 12: 11: 5: 2408: 2406: 2398: 2397: 2387: 2386: 2380: 2379: 2377: 2376: 2364: 2352: 2340: 2325: 2322: 2321: 2319: 2318: 2313: 2308: 2303: 2298: 2293: 2292: 2291: 2284:Mathematicians 2280: 2278: 2276:Related topics 2272: 2271: 2269: 2268: 2263: 2258: 2253: 2248: 2243: 2237: 2235: 2229: 2228: 2226: 2225: 2224: 2223: 2218: 2213: 2211:Control theory 2203: 2198: 2193: 2188: 2183: 2178: 2173: 2168: 2163: 2158: 2153: 2147: 2145: 2139: 2138: 2136: 2135: 2130: 2125: 2120: 2115: 2109: 2107: 2101: 2100: 2098: 2097: 2092: 2087: 2082: 2076: 2074: 2068: 2067: 2065: 2064: 2059: 2054: 2049: 2044: 2039: 2034: 2028: 2026: 2020: 2019: 2017: 2016: 2011: 2006: 2000: 1998: 1992: 1991: 1989: 1988: 1986:Measure theory 1983: 1978: 1973: 1968: 1963: 1958: 1953: 1947: 1945: 1939: 1938: 1936: 1935: 1930: 1925: 1920: 1915: 1910: 1905: 1900: 1894: 1892: 1886: 1885: 1883: 1882: 1877: 1872: 1867: 1862: 1857: 1851: 1849: 1843: 1842: 1840: 1839: 1834: 1829: 1828: 1827: 1822: 1811: 1808: 1807: 1800: 1798: 1797: 1790: 1783: 1775: 1769: 1768: 1748: 1728: 1722: 1709: 1703: 1687: 1667: 1651: 1645: 1625: 1619: 1602: 1596: 1584:Bezdek, Károly 1580: 1574: 1562:Bezdek, Károly 1558: 1552: 1540:Bezdek, Károly 1536: 1530: 1515: 1512: 1509: 1508: 1496: 1482: 1473: 1461: 1455: 1434: 1415: 1397: 1396: 1394: 1391: 1390: 1389: 1384: 1379: 1369: 1366: 1365: 1364: 1359: 1354: 1349: 1344: 1339: 1334: 1291:Main article: 1288: 1285: 1281:image analysis 1225:Main article: 1222: 1219: 1218: 1217: 1212: 1153:Harish-Chandra 1133:quotient space 1045:discrete group 1039:discrete group 1030: 1027: 1026: 1025: 1020: 969:Main article: 966: 963: 951:simplicial set 916:Main article: 913: 910: 909: 908: 899: 894: 889: 833:Main article: 830: 827: 805:abstracts the 771:Main article: 768: 765: 764: 763: 758: 753: 748: 746:Configurations 727: 712: 711: 700: 697: 694: 691: 688: 685: 682: 679: 652: 628: 625: 622: 619: 616: 597: 596: 584: 581: 578: 575: 572: 569: 566: 563: 560: 557: 504:Main article: 501: 498: 497: 496: 491: 455: 451: 436:Main article: 433: 430: 429: 428: 423: 421:Periodic graph 418: 413: 408: 403: 398: 359:circle packing 336:sphere packing 319:circle packing 314: 311: 310: 309: 304: 299: 297:Pick's theorem 294: 289: 284: 233: 230: 228: 225: 213:H.S.M. Coxeter 199:map colourings 158: 155: 147:toric geometry 36:simple matroid 34:to refer to a 26: 24: 14: 13: 10: 9: 6: 4: 3: 2: 2407: 2396: 2393: 2392: 2390: 2375: 2374: 2365: 2363: 2362: 2353: 2351: 2350: 2341: 2339: 2338: 2333: 2327: 2326: 2323: 2317: 2314: 2312: 2309: 2307: 2304: 2302: 2299: 2297: 2294: 2290: 2287: 2286: 2285: 2282: 2281: 2279: 2277: 2273: 2267: 2264: 2262: 2259: 2257: 2254: 2252: 2249: 2247: 2244: 2242: 2239: 2238: 2236: 2234: 2233:Computational 2230: 2222: 2219: 2217: 2214: 2212: 2209: 2208: 2207: 2204: 2202: 2199: 2197: 2194: 2192: 2189: 2187: 2184: 2182: 2179: 2177: 2174: 2172: 2169: 2167: 2164: 2162: 2159: 2157: 2154: 2152: 2149: 2148: 2146: 2144: 2140: 2134: 2131: 2129: 2126: 2124: 2121: 2119: 2116: 2114: 2111: 2110: 2108: 2106: 2102: 2096: 2093: 2091: 2088: 2086: 2083: 2081: 2078: 2077: 2075: 2073: 2072:Number theory 2069: 2063: 2060: 2058: 2055: 2053: 2050: 2048: 2045: 2043: 2040: 2038: 2035: 2033: 2030: 2029: 2027: 2025: 2021: 2015: 2012: 2010: 2007: 2005: 2004:Combinatorics 2002: 2001: 1999: 1997: 1993: 1987: 1984: 1982: 1979: 1977: 1974: 1972: 1969: 1967: 1964: 1962: 1959: 1957: 1956:Real analysis 1954: 1952: 1949: 1948: 1946: 1944: 1940: 1934: 1931: 1929: 1926: 1924: 1921: 1919: 1916: 1914: 1911: 1909: 1906: 1904: 1901: 1899: 1896: 1895: 1893: 1891: 1887: 1881: 1878: 1876: 1873: 1871: 1868: 1866: 1863: 1861: 1858: 1856: 1853: 1852: 1850: 1848: 1844: 1838: 1835: 1833: 1830: 1826: 1823: 1821: 1818: 1817: 1816: 1813: 1812: 1809: 1804: 1796: 1791: 1789: 1784: 1782: 1777: 1776: 1773: 1765: 1759: 1751: 1749:3-540-61341-2 1745: 1741: 1737: 1736:Horst Martini 1733: 1729: 1725: 1723:0-387-95374-4 1719: 1715: 1710: 1706: 1700: 1696: 1692: 1688: 1684: 1678: 1670: 1668:1-58488-301-4 1664: 1660: 1656: 1652: 1648: 1646:0-471-58890-3 1642: 1637: 1636: 1630: 1626: 1622: 1620:0-387-23815-8 1616: 1612: 1608: 1603: 1599: 1593: 1589: 1585: 1581: 1577: 1571: 1567: 1563: 1559: 1555: 1549: 1545: 1541: 1537: 1533: 1531:0-8247-0968-3 1527: 1523: 1518: 1517: 1513: 1506: 1500: 1497: 1493: 1486: 1483: 1477: 1474: 1470: 1465: 1462: 1458: 1456:9783540307211 1452: 1448: 1444: 1438: 1435: 1430: 1426: 1419: 1416: 1411: 1410: 1402: 1399: 1392: 1388: 1385: 1383: 1380: 1377: 1376: 1372: 1371: 1367: 1363: 1360: 1358: 1355: 1353: 1350: 1348: 1345: 1343: 1340: 1338: 1335: 1333: 1330: 1329: 1328: 1325: 1323: 1319: 1315: 1311: 1307: 1303: 1299: 1294: 1286: 1284: 1282: 1278: 1273: 1271: 1267: 1263: 1258: 1256: 1252: 1248: 1245: 1241: 1237: 1233: 1228: 1220: 1216: 1213: 1211: 1208: 1207: 1206: 1203: 1201: 1200:tree lattices 1197: 1193: 1189: 1185: 1181: 1178: 1174: 1170: 1166: 1162: 1158: 1154: 1150: 1146: 1142: 1138: 1134: 1130: 1126: 1123: 1119: 1114: 1112: 1108: 1104: 1100: 1096: 1092: 1088: 1084: 1080: 1077: 1073: 1069: 1065: 1061: 1057: 1053: 1050: 1046: 1040: 1036: 1028: 1024: 1021: 1019: 1016: 1015: 1014: 1011: 1009: 1008:fair division 1005: 1001: 997: 993: 992:László Lovász 989: 988:combinatorics 984: 982: 978: 972: 964: 962: 960: 956: 952: 948: 946: 941: 937: 936:line segments 933: 929: 925: 919: 911: 907: 903: 900: 898: 895: 893: 890: 888: 887:Graph drawing 885: 884: 883: 880: 878: 874: 870: 866: 862: 858: 854: 850: 847:in which the 846: 842: 836: 828: 826: 824: 820: 816: 812: 808: 804: 800: 796: 795:ordered field 792: 788: 784: 780: 774: 766: 762: 759: 757: 754: 752: 749: 747: 744: 743: 742: 739: 725: 717: 698: 695: 692: 686: 683: 680: 670: 669: 668: 666: 650: 642: 626: 623: 620: 617: 614: 606: 602: 582: 576: 573: 570: 567: 564: 558: 555: 548: 547: 546: 544: 541:Formally, an 539: 537: 533: 532:Möbius planes 529: 525: 517: 512: 507: 499: 495: 492: 490: 487: 486: 485: 482: 480: 476: 472: 468: 464: 449: 444: 439: 431: 427: 424: 422: 419: 417: 414: 412: 411:Quasicrystals 409: 407: 404: 402: 399: 397: 394: 393: 392: 389: 387: 383: 379: 374: 372: 368: 367:non-Euclidean 364: 360: 356: 352: 348: 345: 341: 337: 332: 330: 324: 320: 312: 308: 305: 303: 300: 298: 295: 293: 290: 288: 285: 283: 280: 279: 278: 275: 273: 269: 268:tessellations 265: 261: 257: 253: 249: 243: 239: 231: 226: 224: 222: 218: 214: 210: 206: 204: 200: 196: 192: 188: 184: 180: 176: 172: 168: 167:tessellations 164: 156: 154: 152: 148: 144: 140: 136: 132: 128: 124: 120: 115: 113: 109: 105: 101: 97: 93: 89: 85: 82: 78: 74: 70: 69:combinatorial 66: 62: 58: 52: 48: 43: 37: 33: 19: 2371: 2359: 2347: 2328: 2261:Optimization 2123:Differential 2051: 2047:Differential 2014:Order theory 2009:Graph theory 1913:Group theory 1742:. Springer. 1739: 1713: 1694: 1658: 1634: 1610: 1587: 1565: 1543: 1521: 1499: 1485: 1476: 1464: 1446: 1443:Bárány, Imre 1437: 1428: 1424: 1418: 1408: 1401: 1373: 1326: 1297: 1296: 1274: 1261: 1260:Simply put, 1259: 1231: 1230: 1204: 1199: 1140: 1117: 1115: 1110: 1098: 1090: 1078: 1071: 1067: 1059: 1051: 1044: 1042: 1023:Regular maps 1012: 999: 985: 974: 944: 942:, and their 923: 921: 881: 840: 838: 822: 814: 791:vector space 778: 776: 740: 715: 713: 664: 604: 600: 598: 545:is a triple 542: 540: 521: 483: 471:rigid bodies 462: 461: 390: 378:tessellation 377: 375: 354: 335: 333: 326: 323:tessellation 276: 247: 245: 220: 207: 189:by Reye and 160: 116: 60: 56: 55: 2373:WikiProject 2216:Game theory 2196:Probability 1933:Homological 1923:Multilinear 1903:Commutative 1880:Type theory 1847:Foundations 1803:mathematics 1629:Pach, János 1607:Pach, János 1469:Rockafellar 1234:deals with 1188:local field 1135:has finite 1105:), but the 994:proved the 957:. See also 663:are called 448:cycle graph 386:mathematics 363:hypersphere 344:dimensional 264:apeirotopes 67:that study 2201:Statistics 2080:Arithmetic 2042:Arithmetic 1908:Elementary 1875:Set theory 1514:References 1387:Paul Erdős 1262:digitizing 1180:Lie groups 1113:, do not. 1062:becomes a 1010:problems. 865:polyhedron 807:dependence 528:projective 516:Fano plane 307:Opaque set 260:4-polytope 256:polyhedron 238:Polyhedron 217:Paul Erdős 2128:Geometric 2118:Algebraic 2057:Euclidean 2032:Algebraic 1928:Universal 1758:cite book 1677:cite book 1378:(journal) 1244:digitized 1177:nilpotent 940:triangles 857:geometric 761:Buildings 693:∈ 641:incidence 624:× 618:⊆ 163:polyhedra 161:Although 112:intersect 2389:Category 2349:Category 2105:Topology 2052:Discrete 2037:Analytic 2024:Geometry 1996:Discrete 1951:Calculus 1943:Analysis 1898:Abstract 1837:Glossary 1820:Timeline 1693:(2007). 1609:(2005). 1564:(2013). 1542:(2010). 1431:(2): 113 1368:See also 1306:polygons 1272:images. 1236:discrete 1196:Lubotzky 1169:Margulis 1161:Tamagawa 1087:integers 1076:subgroup 977:topology 869:polytope 861:skeleton 849:vertices 815:directed 793:over an 475:linkages 329:manifold 248:polytope 242:Polytope 203:Hadwiger 191:Steinitz 108:polygons 81:discrete 73:discrete 65:geometry 32:matroids 2361:Commons 2143:Applied 2113:General 1890:Algebra 1815:History 1270:digital 1186:over a 1145:lattice 1118:lattice 990:– when 823:ordered 803:matroid 639:is the 340:spheres 270:), and 252:polygon 157:History 104:spheres 100:circles 47:circles 2062:Finite 1918:Linear 1825:Future 1801:Major 1746:  1720:  1701:  1665:  1643:  1617:  1594:  1572:  1550:  1528:  1453:  1312:, and 1310:meshes 1266:raster 1251:images 1247:models 1173:Zimmer 1157:Mostow 1081:whose 932:points 875:, and 819:fields 811:graphs 665:flags. 599:where 530:, and 524:affine 479:hinges 227:Topics 215:, and 193:, the 175:Cauchy 171:Kepler 149:, and 96:planes 88:points 77:finite 2289:lists 1832:Lists 1805:areas 1393:Notes 1240:point 1149:Borel 1127:is a 1120:in a 1095:reals 1074:is a 1049:group 1047:is a 926:is a 863:of a 853:edges 845:graph 843:is a 781:is a 465:is a 382:plane 92:lines 1764:link 1744:ISBN 1718:ISBN 1699:ISBN 1683:link 1663:ISBN 1641:ISBN 1615:ISBN 1592:ISBN 1570:ISBN 1548:ISBN 1526:ISBN 1503:See 1451:ISBN 1320:and 1279:and 1194:and 1192:Bass 1182:and 1066:. A 1037:and 904:and 321:and 266:and 240:and 183:Thue 173:and 165:and 121:and 84:sets 59:and 1249:or 867:or 851:or 777:An 667:If 477:or 181:by 79:or 2391:: 1760:}} 1756:{{ 1734:, 1679:}} 1675:{{ 1429:42 1427:, 1324:. 1308:, 1283:. 1257:. 1171:, 1167:, 1163:, 1159:, 1155:, 1151:, 1116:A 1109:, 1097:, 1089:, 1043:A 983:. 961:. 938:, 934:, 922:A 879:. 871:, 839:A 825:. 738:. 538:. 526:, 481:. 376:A 373:. 334:A 331:. 274:. 246:A 223:. 211:, 205:. 185:, 153:. 145:, 141:, 137:, 133:, 129:, 106:, 102:, 98:, 94:, 90:, 1794:e 1787:t 1780:v 1766:) 1752:. 1726:. 1707:. 1685:) 1671:. 1649:. 1623:. 1600:. 1578:. 1556:. 1534:. 1141:R 1111:Q 1099:R 1091:Z 1079:H 1072:G 1060:G 1052:G 945:n 726:l 716:p 699:, 696:I 690:) 687:l 684:, 681:p 678:( 651:I 627:L 621:P 615:I 605:L 601:P 583:. 580:) 577:I 574:, 571:L 568:, 565:P 562:( 559:= 556:C 456:3 452:4 450:C 355:n 20:)

Index

Combinatorial geometry
matroids
simple matroid

circles
unit disk graph
geometry
combinatorial
discrete
finite
discrete
sets
points
lines
planes
circles
spheres
polygons
intersect
convex geometry
computational geometry
finite geometry
combinatorial optimization
digital geometry
discrete differential geometry
geometric graph theory
toric geometry
combinatorial topology
polyhedra
tessellations

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.