"Ramer-Douglas-Peucker algorithm" meaning in All languages combined

See Ramer-Douglas-Peucker algorithm on Wiktionary

Proper name [English]

Forms: the Douglas-Peucker algorithm [canonical]
Etymology: Named after Urs Ramer, David Douglas and Thomas Peucker. Head templates: {{en-proper noun|def=1|head=Douglas-Peucker algorithm}} the Douglas-Peucker algorithm
  1. (computing theory) An algorithm that examines a curve composed of line segments (i.e. a polyline) and attempts to find a similar curve with fewer points. Categories (topical): Theory of computing
{
  "etymology_text": "Named after Urs Ramer, David Douglas and Thomas Peucker.",
  "forms": [
    {
      "form": "the Douglas-Peucker algorithm",
      "tags": [
        "canonical"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "def": "1",
        "head": "Douglas-Peucker algorithm"
      },
      "expansion": "the Douglas-Peucker algorithm",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "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": "Theory of computing",
          "orig": "en:Theory of computing",
          "parents": [
            "Computer science",
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "An algorithm that examines a curve composed of line segments (i.e. a polyline) and attempts to find a similar curve with fewer points."
      ],
      "id": "en-Ramer-Douglas-Peucker_algorithm-en-name-pVbV~AA2",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "algorithm",
          "algorithm"
        ],
        [
          "curve",
          "curve"
        ],
        [
          "line",
          "line"
        ],
        [
          "segment",
          "segment"
        ],
        [
          "polyline",
          "polyline"
        ],
        [
          "similar",
          "similar"
        ],
        [
          "point",
          "point"
        ]
      ],
      "raw_glosses": [
        "(computing theory) An algorithm that examines a curve composed of line segments (i.e. a polyline) and attempts to find a similar curve with fewer points."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "Ramer-Douglas-Peucker algorithm"
}
{
  "etymology_text": "Named after Urs Ramer, David Douglas and Thomas Peucker.",
  "forms": [
    {
      "form": "the Douglas-Peucker algorithm",
      "tags": [
        "canonical"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "def": "1",
        "head": "Douglas-Peucker algorithm"
      },
      "expansion": "the Douglas-Peucker algorithm",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English proper nouns",
        "English uncountable nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Theory of computing"
      ],
      "glosses": [
        "An algorithm that examines a curve composed of line segments (i.e. a polyline) and attempts to find a similar curve with fewer points."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "algorithm",
          "algorithm"
        ],
        [
          "curve",
          "curve"
        ],
        [
          "line",
          "line"
        ],
        [
          "segment",
          "segment"
        ],
        [
          "polyline",
          "polyline"
        ],
        [
          "similar",
          "similar"
        ],
        [
          "point",
          "point"
        ]
      ],
      "raw_glosses": [
        "(computing theory) An algorithm that examines a curve composed of line segments (i.e. a polyline) and attempts to find a similar curve with fewer points."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "Ramer-Douglas-Peucker algorithm"
}

Download raw JSONL data for Ramer-Douglas-Peucker algorithm meaning in All languages combined (1.3kB)


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-12-21 from the enwiktionary dump dated 2024-12-04 using wiktextract (d8cb2f3 and 4e554ae). 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.