"Cyrus–Beck algorithm" meaning in English

See Cyrus–Beck algorithm in All languages combined, or Wiktionary

Noun

Head templates: {{en-noun|?|head=Cyrus–Beck algorithm}} Cyrus–Beck algorithm
  1. (computer science) A generalized algorithm for line clipping. Categories (topical): Computer science
{
  "head_templates": [
    {
      "args": {
        "1": "?",
        "head": "Cyrus–Beck algorithm"
      },
      "expansion": "Cyrus–Beck algorithm",
      "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": "topical",
          "langcode": "en",
          "name": "Computer science",
          "orig": "en:Computer science",
          "parents": [
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A generalized algorithm for line clipping."
      ],
      "id": "en-Cyrus–Beck_algorithm-en-noun-WCm9VmZr",
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "line clipping",
          "line clipping"
        ]
      ],
      "raw_glosses": [
        "(computer science) A generalized algorithm for line clipping."
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ]
    }
  ],
  "word": "Cyrus–Beck algorithm"
}
{
  "head_templates": [
    {
      "args": {
        "1": "?",
        "head": "Cyrus–Beck algorithm"
      },
      "expansion": "Cyrus–Beck algorithm",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English nouns with unknown or uncertain plurals",
        "Pages with 1 entry",
        "en:Computer science"
      ],
      "glosses": [
        "A generalized algorithm for line clipping."
      ],
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "line clipping",
          "line clipping"
        ]
      ],
      "raw_glosses": [
        "(computer science) A generalized algorithm for line clipping."
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ]
    }
  ],
  "word": "Cyrus–Beck algorithm"
}

Download raw JSONL data for Cyrus–Beck algorithm meaning in English (0.8kB)


This page is a part of the kaikki.org machine-readable English 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.