{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Summary\n\nComputational geometry is the study of algorithms and data structures for geometric objects such as points, segments, polygons and polyhedra.\nTypical problems are computing a [[convex hull|0FQSDC2EQ2]], a [[polygon triangulation|Q6KKBP3RRP]], a [[Voronoi diagram|QDNEBBVZ84]] or a [[Delaunay triangulation|259Y10BYJC]], and finding intersections among many segments.\nIts results are measured by running time and memory in terms of the input size, and it relies on combinatorial bounds from [[discrete geometry|Q0RW86P85F]].\nApplications include computer graphics, geographic information systems, robotics and computer-aided design.\n\n## Explanations\n\n### L1 human\n\nComputational geometry asks how a computer can answer geometric questions quickly.\nGiven a million points on a map, which is the nearest post office to each house, and which points form the outer boundary of the set?\nA naive method may compare every pair of points, which takes about $n^2$ steps for $n$ points.\nClever methods often need only about $n \\log n$ steps, which is a huge saving for large $n$.\n",
  "commit": "ff8a40749dc16545e3d2fc637f6b0196e81d0bfa",
  "front": {
    "kind": "concept",
    "msc": [
      "68U05",
      "52B55"
    ],
    "name": "Computational geometry",
    "same_as": {
      "wikidata": "Q874709",
      "wikipedia": "Computational geometry"
    },
    "sources": [
      {
        "url": "https://en.wikipedia.org/wiki/Computational_geometry"
      }
    ],
    "tag": "KAT7K2NE9Z"
  },
  "kind": "concept",
  "link": "https://tamnd.github.io/math2/node/KAT7K2NE9Z/",
  "links": null,
  "markdown": "https://tamnd.github.io/math2/node/KAT7K2NE9Z.md",
  "msc": [
    "68U05",
    "52B55"
  ],
  "name": "Computational geometry",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/KAT/KAT7K2NE9Z.md",
  "status": null,
  "tag": "KAT7K2NE9Z",
  "uri": "m2://KAT7K2NE9Z",
  "url": "https://tamnd.github.io/math2/wiki/computational-geometry/",
  "writing": {
    "tag": "KAT7K2NE9Z",
    "kind": "concept",
    "level": "W0",
    "next": [
      {
        "what": "a source with a locator",
        "have": 0,
        "want": 1
      }
    ]
  }
}