| org.andengine.util.algorithm.hull.IHullAlgorithm |
 Known Indirect Subclasses
| JarvisMarch |
The Jarvis March algorithm marches around the hull,
like a ribbon wrapping itself around the points,
this algorithm also called the gift-wrapping algorithm. |
|
Class Overview
(c) 2010 Nicolas Gramlich
(c) 2011 Zynga Inc.
Summary
| Public Methods |
|---|
|
abstract
int
|
computeHull(float[] pVertices, int pVertexCount, int pVertexOffsetX, int pVertexOffsetY, int pStride)
|
Public Methods
public
abstract
int
computeHull
(float[] pVertices, int pVertexCount, int pVertexOffsetX, int pVertexOffsetY, int pStride)
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. |
| pStride
| the stride between each vertex. |