See Liang–Barsky algorithm on Wiktionary
{
"head_templates": [
{
"args": {
"1": "?",
"nolinkhead": "1"
},
"expansion": "Liang–Barsky 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": "other",
"name": "Pages with entries",
"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 line clipping algorithm that uses the parametric equation of a line and inequalities describing the range of the clipping window to determine the intersections between the line and the clip window."
],
"id": "en-Liang–Barsky_algorithm-en-noun-eduH7g0f",
"links": [
[
"computer science",
"computer science"
],
[
"line clipping",
"line clipping"
],
[
"parametric",
"parametric"
],
[
"equation",
"equation"
],
[
"intersections",
"intersections"
],
[
"clip window",
"clip window"
]
],
"raw_glosses": [
"(computer science) A line clipping algorithm that uses the parametric equation of a line and inequalities describing the range of the clipping window to determine the intersections between the line and the clip window."
],
"topics": [
"computer",
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"science",
"sciences"
]
}
],
"word": "Liang–Barsky algorithm"
}
{
"head_templates": [
{
"args": {
"1": "?",
"nolinkhead": "1"
},
"expansion": "Liang–Barsky 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",
"Pages with entries",
"en:Computer science"
],
"glosses": [
"A line clipping algorithm that uses the parametric equation of a line and inequalities describing the range of the clipping window to determine the intersections between the line and the clip window."
],
"links": [
[
"computer science",
"computer science"
],
[
"line clipping",
"line clipping"
],
[
"parametric",
"parametric"
],
[
"equation",
"equation"
],
[
"intersections",
"intersections"
],
[
"clip window",
"clip window"
]
],
"raw_glosses": [
"(computer science) A line clipping algorithm that uses the parametric equation of a line and inequalities describing the range of the clipping window to determine the intersections between the line and the clip window."
],
"topics": [
"computer",
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"science",
"sciences"
]
}
],
"word": "Liang–Barsky algorithm"
}
Download raw JSONL data for Liang–Barsky 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.