Convex hull of a simple polygon
id:
convex-hull-of-a-simple-polygon-263-17812434
title:
Convex hull of a simple polygon
text:
In discrete geometry and computational geometry, the convex hull of a simple polygon is the polygon of minimum perimeter that contains a given simple polygon. It is a special case of the more general concept of a convex hull. It can be computed in linear time, faster than algorithms for convex hulls of point sets. The convex hull of a simple polygon can be subdivided into the given polygon itself and into polygonal pockets bounded by a polygonal chain of the polygon together with a single convex
brand slug:
wiki
category slug:
encyclopedia
description:
Smallest convex polygon containing a given polygon
original url:
https://en.wikipedia.org/wiki/Convex_hull_of_a_simple_polygon
date created:
date modified:
2023-12-18T10:12:44Z
main entity:
{"identifier":"Q85753985","url":"https://www.wikidata.org/entity/Q85753985"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/a/ae/Convex_hull_of_a_simple_polygon.svg","width":540,"height":477}
fields total:
13
integrity:
15