"diamond-square algorithm" meaning in All languages combined

See diamond-square algorithm on Wiktionary

Proper name [English]

Forms: the diamond-square algorithm [canonical]
Head templates: {{en-proper noun|def=1}} the diamond-square algorithm
  1. (computer graphics) An algorithm for generating heightmaps. It starts with a two-dimensional grid and then randomly generates terrain height from four seed values arranged in a grid of points so that the entire plane is covered in squares. Wikipedia link: diamond-square algorithm Categories (topical): Computer graphics
    Sense id: en-diamond-square_algorithm-en-name--ktxJTzX Categories (other): English entries with incorrect language header Topics: computer-graphics, computing, engineering, mathematics, natural-sciences, physical-sciences, sciences

Download JSON data for diamond-square algorithm meaning in All languages combined (1.6kB)

{
  "forms": [
    {
      "form": "the diamond-square algorithm",
      "tags": [
        "canonical"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "def": "1"
      },
      "expansion": "the diamond-square 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": "topical",
          "langcode": "en",
          "name": "Computer graphics",
          "orig": "en:Computer graphics",
          "parents": [
            "Computing",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "An algorithm for generating heightmaps. It starts with a two-dimensional grid and then randomly generates terrain height from four seed values arranged in a grid of points so that the entire plane is covered in squares."
      ],
      "id": "en-diamond-square_algorithm-en-name--ktxJTzX",
      "links": [
        [
          "computer graphics",
          "computer graphics"
        ],
        [
          "heightmap",
          "heightmap"
        ],
        [
          "grid",
          "grid"
        ],
        [
          "random",
          "random"
        ],
        [
          "terrain",
          "terrain"
        ],
        [
          "seed",
          "seed"
        ],
        [
          "value",
          "value"
        ],
        [
          "point",
          "point"
        ],
        [
          "plane",
          "plane"
        ],
        [
          "square",
          "square"
        ]
      ],
      "raw_glosses": [
        "(computer graphics) An algorithm for generating heightmaps. It starts with a two-dimensional grid and then randomly generates terrain height from four seed values arranged in a grid of points so that the entire plane is covered in squares."
      ],
      "topics": [
        "computer-graphics",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "diamond-square algorithm"
      ]
    }
  ],
  "word": "diamond-square algorithm"
}
{
  "forms": [
    {
      "form": "the diamond-square algorithm",
      "tags": [
        "canonical"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "def": "1"
      },
      "expansion": "the diamond-square algorithm",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English proper nouns",
        "English uncountable nouns",
        "en:Computer graphics"
      ],
      "glosses": [
        "An algorithm for generating heightmaps. It starts with a two-dimensional grid and then randomly generates terrain height from four seed values arranged in a grid of points so that the entire plane is covered in squares."
      ],
      "links": [
        [
          "computer graphics",
          "computer graphics"
        ],
        [
          "heightmap",
          "heightmap"
        ],
        [
          "grid",
          "grid"
        ],
        [
          "random",
          "random"
        ],
        [
          "terrain",
          "terrain"
        ],
        [
          "seed",
          "seed"
        ],
        [
          "value",
          "value"
        ],
        [
          "point",
          "point"
        ],
        [
          "plane",
          "plane"
        ],
        [
          "square",
          "square"
        ]
      ],
      "raw_glosses": [
        "(computer graphics) An algorithm for generating heightmaps. It starts with a two-dimensional grid and then randomly generates terrain height from four seed values arranged in a grid of points so that the entire plane is covered in squares."
      ],
      "topics": [
        "computer-graphics",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "diamond-square algorithm"
      ]
    }
  ],
  "word": "diamond-square algorithm"
}

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-05-05 from the enwiktionary dump dated 2024-05-02 using wiktextract (f4fd8c9 and c9440ce). 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.