"Delaunay triangulation" meaning in All languages combined

See Delaunay triangulation on Wiktionary

Noun [English]

Forms: Delaunay triangulations [plural]
Etymology: Named after Boris Delaunay for his work on this topic from 1934. Head templates: {{en-noun|~}} Delaunay triangulation (countable and uncountable, plural Delaunay triangulations)
  1. (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). Wikipedia link: Boris Delaunay, Delaunay triangulation Tags: countable, uncountable Categories (topical): Computer graphics, Geometry

Inflected forms

{
  "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": "English entries with language name categories using raw markup",
          "parents": [
            "Entries with language name categories using raw markup",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms with non-redundant non-automated sortkeys",
          "parents": [
            "Terms with non-redundant non-automated sortkeys",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "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 entries with language name categories using raw markup",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English terms with non-redundant non-automated sortkeys",
        "English uncountable nouns",
        "Pages with 1 entry",
        "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"
}

Download raw JSONL data for Delaunay triangulation meaning in All languages combined (1.6kB)


This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-09-01 from the enwiktionary dump dated 2024-08-20 using wiktextract (8e41825 and f99c758). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.

If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.