# Tag Archives: convex hull

## Find a minimal bounding circle of a set of points in C#

The example Find the convex hull of a set of points in C# finds the convex hull of a set of points. A convex hull is the smallest convex polygon that encloses the points. This example extends that result to … Continue reading

Posted in algorithms, geometry, graphics, mathematics | | 7 Comments

## Perform geometric operations on polygons in C#

This example contains a Polygon class that perform several useful geometric operations for polygons. The following list describes the key methods provided by the class. Click the links to see posts that describe the methods in greater detail. PolygonIsConvex – … Continue reading

## Find a minimal bounding rectangle for a polygon in C#

This program assumes that its Points array contains the points in a convex polygon in counterclockwise order. If you have some other group of points, first find their convex hull and then orient the resulting polygon counterclockwise. See these related … Continue reading

## Find the convex hull of a set of points in C#

This example shows how to find the convex hull for a set of points. The details are fairly complicated so I’m not going to show them all here, but the basic ideas are relatively straightforward. A convex hull is a … Continue reading

Posted in algorithms, geometry, graphics | | 10 Comments