"convex hull" meaning in All languages combined

See convex hull on Wiktionary

Noun [English]

Forms: convex hulls [plural]
Head templates: {{en-noun}} convex hull (plural convex hulls)
  1. (mathematics) The smallest convex set of points in which a given set of points is contained. Wikipedia link: convex hull Categories (topical): Geometry, Mathematics Synonyms (smallest convex set of points containing a given set): convex envelope, linear span, span Translations (convex set of points): konveksi verho (Finnish), enveloppe convexe (French), inviluppo convesso [masculine] (Italian), involucro convesso [masculine] (Italian)

Inflected forms

{
  "forms": [
    {
      "form": "convex hulls",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "convex hull (plural convex hulls)",
      "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": "Entries with translation boxes",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Terms with Finnish translations",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Terms with French translations",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Terms with Italian translations",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Geometry",
          "orig": "en:Geometry",
          "parents": [
            "Mathematics",
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Mathematics",
          "orig": "en:Mathematics",
          "parents": [
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "text": "1994, David Eppstein, Chapter 10: Average Case Analysis of Dynamic Geometric Optimization, Association of Computing Machinery, Society for Industrial and Applied Mathematics, Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, page 83,\nThis problem can be solved in time O(nᶜ) by combining a weight-balanced tree of the convex hull vertices with a farthest neighbor data structure of Agarwal and Matoušek [2]."
        },
        {
          "ref": "2005, A.D. Alexandrov, Convex Polyhedra, page 23:",
          "text": "Thus, the polyhedron and the convex hull of the set of its vertices coincide, which was to be proved.\nSince the convex hull of a set M is determined uniquely from M, Theorem 1 implies that a bounded solid polyhedron and its surface, i.e., a closed convex polyhedron, are determined uniquely from its vertices.",
          "type": "quote"
        },
        {
          "ref": "2007, Charalambos D. Aliprantis, Kim C. Border, Infinite Dimensional Analysis: A Hitchhiker's Guide, page 185:",
          "text": "The convex hull of a compact subset of an infinite dimensional topological vector space need not be a compact set.",
          "type": "quote"
        }
      ],
      "glosses": [
        "The smallest convex set of points in which a given set of points is contained."
      ],
      "id": "en-convex_hull-en-noun-emV2SDxv",
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "convex",
          "convex"
        ]
      ],
      "raw_glosses": [
        "(mathematics) The smallest convex set of points in which a given set of points is contained."
      ],
      "synonyms": [
        {
          "sense": "smallest convex set of points containing a given set",
          "word": "convex envelope"
        },
        {
          "sense": "smallest convex set of points containing a given set",
          "word": "linear span"
        },
        {
          "sense": "smallest convex set of points containing a given set",
          "word": "span"
        }
      ],
      "topics": [
        "mathematics",
        "sciences"
      ],
      "translations": [
        {
          "code": "fi",
          "lang": "Finnish",
          "sense": "convex set of points",
          "word": "konveksi verho"
        },
        {
          "code": "fr",
          "lang": "French",
          "sense": "convex set of points",
          "word": "enveloppe convexe"
        },
        {
          "code": "it",
          "lang": "Italian",
          "sense": "convex set of points",
          "tags": [
            "masculine"
          ],
          "word": "inviluppo convesso"
        },
        {
          "code": "it",
          "lang": "Italian",
          "sense": "convex set of points",
          "tags": [
            "masculine"
          ],
          "word": "involucro convesso"
        }
      ],
      "wikipedia": [
        "convex hull"
      ]
    }
  ],
  "word": "convex hull"
}
{
  "forms": [
    {
      "form": "convex hulls",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "convex hull (plural convex hulls)",
      "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 terms with quotations",
        "Entries with translation boxes",
        "Pages with 1 entry",
        "Pages with entries",
        "Quotation templates to be cleaned",
        "Terms with Finnish translations",
        "Terms with French translations",
        "Terms with Italian translations",
        "en:Geometry",
        "en:Mathematics"
      ],
      "examples": [
        {
          "text": "1994, David Eppstein, Chapter 10: Average Case Analysis of Dynamic Geometric Optimization, Association of Computing Machinery, Society for Industrial and Applied Mathematics, Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, page 83,\nThis problem can be solved in time O(nᶜ) by combining a weight-balanced tree of the convex hull vertices with a farthest neighbor data structure of Agarwal and Matoušek [2]."
        },
        {
          "ref": "2005, A.D. Alexandrov, Convex Polyhedra, page 23:",
          "text": "Thus, the polyhedron and the convex hull of the set of its vertices coincide, which was to be proved.\nSince the convex hull of a set M is determined uniquely from M, Theorem 1 implies that a bounded solid polyhedron and its surface, i.e., a closed convex polyhedron, are determined uniquely from its vertices.",
          "type": "quote"
        },
        {
          "ref": "2007, Charalambos D. Aliprantis, Kim C. Border, Infinite Dimensional Analysis: A Hitchhiker's Guide, page 185:",
          "text": "The convex hull of a compact subset of an infinite dimensional topological vector space need not be a compact set.",
          "type": "quote"
        }
      ],
      "glosses": [
        "The smallest convex set of points in which a given set of points is contained."
      ],
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "convex",
          "convex"
        ]
      ],
      "raw_glosses": [
        "(mathematics) The smallest convex set of points in which a given set of points is contained."
      ],
      "topics": [
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "convex hull"
      ]
    }
  ],
  "synonyms": [
    {
      "sense": "smallest convex set of points containing a given set",
      "word": "convex envelope"
    },
    {
      "sense": "smallest convex set of points containing a given set",
      "word": "linear span"
    },
    {
      "sense": "smallest convex set of points containing a given set",
      "word": "span"
    }
  ],
  "translations": [
    {
      "code": "fi",
      "lang": "Finnish",
      "sense": "convex set of points",
      "word": "konveksi verho"
    },
    {
      "code": "fr",
      "lang": "French",
      "sense": "convex set of points",
      "word": "enveloppe convexe"
    },
    {
      "code": "it",
      "lang": "Italian",
      "sense": "convex set of points",
      "tags": [
        "masculine"
      ],
      "word": "inviluppo convesso"
    },
    {
      "code": "it",
      "lang": "Italian",
      "sense": "convex set of points",
      "tags": [
        "masculine"
      ],
      "word": "involucro convesso"
    }
  ],
  "word": "convex hull"
}

Download raw JSONL data for convex hull meaning in All languages combined (2.8kB)


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-11-06 from the enwiktionary dump dated 2024-10-02 using wiktextract (fbeafe8 and 7f03c9b). 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.