Computing a Convex Hull - Parallel Algorithm - Maple Application Center
Application Center Applications Computing a Convex Hull - Parallel Algorithm

Computing a Convex Hull - Parallel Algorithm

Author
: Maplesoft AuthorMaplesoft
Engineering software solutions from Maplesoft
This Application runs in Maple. Don't have Maple? No problem!
 Try Maple free for 15 days!
Given X, a set of points in 2-D, the convex hull is the minimum set of points that define a polygon containing all the points of X. If you imagine the points as pegs on a board, you can find the convex hull by surrounding the pegs by a loop of string and then tightening the string until there is no more slack.

Application Details

Publish Date: April 06, 2011
Created In: Maple 15
Language: English

More Like This

Creating Maple Documents: Deriving the Rocket Equation
Pricing Arithmetic Average Asian Options
Heating an Oil Stream Through Three Steam-Heated Tanks
Solving Differential-Algebraic Equations in Maple 9.5
Tips on Using Units and Dimensions in Maple
Improving Your Maple Code with map and seq
Solving ordinary differential equations using Maple
Applications of the Global Optimization Toolbox
Color Plate: Icosahedron
2
Color Plate: Dirichlet Problem for a circle
0