Computing a Convex Hull - Parallel Algorithm - Maple Application Center
  Submit your work
Application Center Applications Computing a Convex Hull - Parallel Algorithm

Computing a Convex Hull - Parallel Algorithm

Author
: Maplesoft AuthorMaplesoft
0
Engineering software solutions from Maplesoft
 Download
 Preview
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
This application is in the following Collection:

Editor's Choice

Add to a Collection

More Like This

Pricing Arithmetic Average Asian Options

Maplesoft Author Maplesoft

6
Creating Maple Documents: Deriving the Rocket Equation

Maplesoft Author Maplesoft

8
Heating an Oil Stream Through Three Steam-Heated Tanks

Maplesoft Author Maplesoft

25
The VectorCalculus Package

Maplesoft Author Maplesoft

9
Solving Differential-Algebraic Equations in Maple 9.5

Maplesoft Author Maplesoft

13
FFT with the DiscreteTransforms Package

Maplesoft Author Maplesoft

5
Solving ordinary differential equations using Maple

Maplesoft Author Maplesoft

5
Improving Your Maple Code with map and seq

Maplesoft Author Maplesoft

14
Tips on Using Units and Dimensions in Maple

Maplesoft Author Maplesoft

11
Applications of the Global Optimization Toolbox

Maplesoft Author Maplesoft

2
Color Plate: Icosahedron

Maplesoft Author Maplesoft

2
Color Plate: Dirichlet Problem for a circle

Maplesoft Author Maplesoft

0