Convex hull of a simple polygon
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.
Link from a Wikipage to another Wikipage
primaryTopic
Convex hull of a simple polygon
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.
has abstract
In discrete geometry and compu ...... minates with a convex polygon.
@en
Wikipage page ID
62,646,738
page length (characters) of wiki page
Wikipage revision ID
1,006,581,813
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
comment
In discrete geometry and compu ...... or convex hulls of point sets.
@en
label
Convex hull of a simple polygon
@en