Scribd
Upload
392 views7 pages

Jarvis's March Algorithm

This document discusses algorithms for finding the convex hull of a set of points. It describes five common algorithms: Gift-Wrapping (Jarvis March), Graham's Scan, Quickhull, Divide and Conquer, and Monotone Chain. It then provides more detail on the Jarvis March algorithm, explaining that it has a runtime of O(nh) where n is the number of points and h is the number of points in the convex hull. It notes that Jarvis March is most efficient when h is low while Divide and Conquer is faster when h is higher.

Uploaded by

Faez Shakil
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
392 views7 pages

Jarvis's March Algorithm

This document discusses algorithms for finding the convex hull of a set of points. It describes five common algorithms: Gift-Wrapping (Jarvis March), Graham's Scan, Quickhull, Divide and Conquer, and Monotone Chain. It then provides more detail on the Jarvis March algorithm, explaining that it has a runtime of O(nh) where n is the number of points and h is the number of points in the convex hull. It notes that Jarvis March is most efficient when h is low while Divide and Conquer is faster when h is higher.

Uploaded by

Faez Shakil
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 7

Convex Sets and Hulls

The polygon connecting the exterior points of a set of points such that there
is no convexity between any of the exterior points

Possible Algorithms
1) Gift-Wrapping (Jarvis March) Algorithm
2) Graham's Scan Algorithm
3) Quickhull
4) Divide and Conquer
5) Monotone Chain
6) Incremental Convex Hull Algorithm

Applications
- Collision Detection in 3D models
- Animation
- Object Recognition
- Segmentation of Regions in Rn

The Jarvis March Algorithm


O(nh)

Start at an extreme point


x;
find the furtherest of the
angularly minimal points
from x;
Add this point to the
hull;
move to it;
continue until you return
to the first point.
There will be
h hull points

At each hull point h0, the angle made by


the line joining h0 with all n points in
the dataset is needed. This is an O(n)
repeated h times.

Complexity and Caveats


Runtime O(nh)
Runtime proportional to the number of hull points- most efficient for data distributions
with few outliers. Divide and Conquer algorithm faster for distributions with higher h.
Best implemented with points stored in a contiguous array as index will speed up angle
computations and comparison.
Scalable to higher dimensions, does not lose efficiency if h stays low.

You might also like