Compute convex hull from chain code
#include "dip_chaincode.h"
dip_Error dip_ChainCodeConvexHull ( chaincode, polygon, resources )
(To be documented)
We're using Melkman's algorithm to determine the convex hull of a polygonal representation of the boundary encoded by chaincode.
| Data type | Name | Description |
| dip_ChainCode | chaincode | Input chain code |
| dip_Polygon* | polygon | Output convex polygon |
| dip_Resources | resources | Resources tracking structure. See ResourcesNew |
Avraham A. Melkman, "On-line construction of the convex hull of a simple polyline," Information Processing Letters 25(1):11-12, 1987.
ImageChainCode, ConvexHullGetArea, ConvexHullGetPerimeter, ConvexHullGetFeret