org.andengine.util.algorithm.hull

Class JarvisMarch

java.lang.Object

org.andengine.util.algorithm.hull.JarvisMarch

All Implemented Interfaces:

IHullAlgorithm

public class JarvisMarch
extends java.lang.Object
implements IHullAlgorithm

The Jarvis March algorithm marches around the hull, like a ribbon wrapping itself around the points, this algorithm also called the gift-wrapping algorithm. (c) 2010 Nicolas Gramlich (c) 2011 Zynga Inc.

Since:

14:01:18 - 14.09.2010

See Also:

http://www.iti.fh-flensburg.de/lang/algorithmen/geo/

Constructor Summary

Constructors

Constructor and Description
JarvisMarch()

Method Summary

Modifier and Type	Method and Description
int	computeHull(float[] pVertices, int pVertexCount, int pVertexOffsetX, int pVertexOffsetY, int pVertexStride)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

JarvisMarch

public JarvisMarch()

Method Detail

computeHull

public int computeHull(float[] pVertices,
                       int pVertexCount,
                       int pVertexOffsetX,
                       int pVertexOffsetY,
                       int pVertexStride)

Specified by:

computeHull in interface IHullAlgorithm

Parameters:

pVertices - a interleaved float[] containing vertex data.

pVertexCount - the amount of vertices to look at in pVertices.

pVertexOffsetX - the offset of the x-coordinate in a vertex.

pVertexOffsetY - the offset of the y-coordinate in a vertex.

pVertexStride - the stride between each vertex.

Returns: