"Ramer-Douglas-Peucker algorithm" meaning in English

{
  "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": "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": "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 entries with language name categories using raw markup",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English proper nouns",
        "English terms with non-redundant non-automated sortkeys",
        "English uncountable nouns",
        "Pages with 1 entry",
        "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"
}