"Delaunay triangulation" meaning in English

{
  "etymology_text": "Named after Boris Delaunay for his work on this topic from 1934.",
  "forms": [
    {
      "form": "Delaunay triangulations",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "~"
      },
      "expansion": "Delaunay triangulation (countable and uncountable, plural Delaunay triangulations)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Computer graphics",
          "orig": "en:Computer graphics",
          "parents": [
            "Computing",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Geometry",
          "orig": "en:Geometry",
          "parents": [
            "Mathematics",
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "For a given set P of discrete points in a plane: a triangulation DT(P) such that no point in P is inside the circumcircle of any triangle in DT(P)."
      ],
      "id": "en-Delaunay_triangulation-en-noun-TT1NkhJN",
      "links": [
        [
          "geometry",
          "geometry"
        ],
        [
          "computer graphics",
          "computer graphics"
        ],
        [
          "discrete",
          "discrete"
        ],
        [
          "point",
          "point"
        ],
        [
          "plane",
          "plane"
        ],
        [
          "circumcircle",
          "circumcircle"
        ],
        [
          "triangle",
          "triangle"
        ]
      ],
      "raw_glosses": [
        "(geometry, computer graphics) For a given set P of discrete points in a plane: a triangulation DT(P) such that no point in P is inside the circumcircle of any triangle in DT(P)."
      ],
      "tags": [
        "countable",
        "uncountable"
      ],
      "topics": [
        "computer-graphics",
        "computing",
        "engineering",
        "geometry",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "Boris Delaunay",
        "Delaunay triangulation"
      ]
    }
  ],
  "word": "Delaunay triangulation"
}

{
  "etymology_text": "Named after Boris Delaunay for his work on this topic from 1934.",
  "forms": [
    {
      "form": "Delaunay triangulations",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "~"
      },
      "expansion": "Delaunay triangulation (countable and uncountable, plural Delaunay triangulations)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English uncountable nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Computer graphics",
        "en:Geometry"
      ],
      "glosses": [
        "For a given set P of discrete points in a plane: a triangulation DT(P) such that no point in P is inside the circumcircle of any triangle in DT(P)."
      ],
      "links": [
        [
          "geometry",
          "geometry"
        ],
        [
          "computer graphics",
          "computer graphics"
        ],
        [
          "discrete",
          "discrete"
        ],
        [
          "point",
          "point"
        ],
        [
          "plane",
          "plane"
        ],
        [
          "circumcircle",
          "circumcircle"
        ],
        [
          "triangle",
          "triangle"
        ]
      ],
      "raw_glosses": [
        "(geometry, computer graphics) For a given set P of discrete points in a plane: a triangulation DT(P) such that no point in P is inside the circumcircle of any triangle in DT(P)."
      ],
      "tags": [
        "countable",
        "uncountable"
      ],
      "topics": [
        "computer-graphics",
        "computing",
        "engineering",
        "geometry",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "Boris Delaunay",
        "Delaunay triangulation"
      ]
    }
  ],
  "word": "Delaunay triangulation"
}