libGDX 1.14.2 · com.badlogic.gdx.math.ConvexHull · APIdia, the JavaDoc alternative

Modifier and Type	Field and Description
private final FloatArray	hull
private final IntArray	indices
private final ShortArray	originalIndices
private final IntArray	quicksortStack
private float[]	sortedPoints

Access	Constructor and Description
public	ConvexHull()

Method Summary

Modifier and Type	Method and Description
private float	ccw(float p3x, float p3y) Returns > 0 if the points are a counterclockwise turn, < 0 if clockwise, and 0 if colinear.
public IntArray	computeIndices(FloatArray points, boolean sorted, boolean yDown)
public IntArray	computeIndices(float[] polygon, boolean sorted, boolean yDown)
public IntArray	computeIndices(float[] points, int offset, int count, boolean sorted, boolean yDown) Computes a hull the same as `computePolygon(float[], int, int, boolean)` but returns indices of the specified points.
public FloatArray	computePolygon(FloatArray points, boolean sorted)
public FloatArray	computePolygon(float[] polygon, boolean sorted)
public FloatArray	Returns: pairs of coordinates that describe the convex hull polygon in counterclockwise order. Note the returned array is reused for later calls to the same method. computePolygon(float[] x,y pairs describing points in counter-clockwise order. Duplicate points will result in undefined behavior. points, int offset, int count, boolean If false, the points will be sorted by the x coordinate then the y coordinate, which is required by the convex hull algorithm. If sorting is done the input array is not modified and count additional working memory is needed. sorted) Returns the convex hull polygon for the given point cloud.
private int	quicksortPartition(final float[] values, int lower, int upper)
private int	quicksortPartitionWithIndices(final float[] values, int lower, int upper, boolean yDown, short[] originalIndices)
private void	sort(float[] values, int Number of indices, must be even. count) Sorts x,y pairs of values by the x value, then the y value.
private void	sortWithIndices(float[] values, int Number of indices, must be even. count, boolean yDown) Sorts x,y pairs of values by the x value, then the y value and stores unsorted original indices.

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

hull	back to summary
private final FloatArray hull

indices	back to summary
private final IntArray indices

originalIndices	back to summary
private final ShortArray originalIndices

quicksortStack	back to summary
private final IntArray quicksortStack

sortedPoints	back to summary
private float[] sortedPoints

ConvexHull	back to summary
public ConvexHull()

Method Detail

ccw	back to summary
private float ccw(float p3x, float p3y) Returns > 0 if the points are a counterclockwise turn, < 0 if clockwise, and 0 if colinear.

computeIndices	back to summary
public IntArray computeIndices(FloatArray points, boolean sorted, boolean yDown) See Also `computeIndices(float[], int, int, boolean, boolean)`

computeIndices	back to summary
public IntArray computeIndices(float[] polygon, boolean sorted, boolean yDown) See Also `computeIndices(float[], int, int, boolean, boolean)`

computeIndices	back to summary
public IntArray computeIndices(float[] points, int offset, int count, boolean sorted, boolean yDown) Computes a hull the same as `computePolygon(float[], int, int, boolean)` but returns indices of the specified points.

computePolygon	back to summary
public FloatArray computePolygon(FloatArray points, boolean sorted) See Also `computePolygon(float[], int, int, boolean)`

computePolygon	back to summary
public FloatArray computePolygon(float[] polygon, boolean sorted) See Also `computePolygon(float[], int, int, boolean)`

computePolygon	back to summary
public FloatArray computePolygon(float[] points, int offset, int count, boolean sorted) Returns the convex hull polygon for the given point cloud. Parameters points:float[] x,y pairs describing points in counter-clockwise order. Duplicate points will result in undefined behavior. sorted:boolean If false, the points will be sorted by the x coordinate then the y coordinate, which is required by the convex hull algorithm. If sorting is done the input array is not modified and count additional working memory is needed. Returns:FloatArray pairs of coordinates that describe the convex hull polygon in counterclockwise order. Note the returned array is reused for later calls to the same method.

computePolygon

back to summary

public FloatArray computePolygon(float[] points, int offset, int count, boolean sorted)

Returns the convex hull polygon for the given point cloud.

Parameters

points:float[]: x,y pairs describing points in counter-clockwise order. Duplicate points will result in undefined behavior.
sorted:boolean: If false, the points will be sorted by the x coordinate then the y coordinate, which is required by the convex hull algorithm. If sorting is done the input array is not modified and count additional working memory is needed.

Returns:FloatArray

pairs of coordinates that describe the convex hull polygon in counterclockwise order. Note the returned array is reused for later calls to the same method.

quicksortPartition	back to summary
private int quicksortPartition(final float[] values, int lower, int upper)

quicksortPartitionWithIndices	back to summary
private int quicksortPartitionWithIndices(final float[] values, int lower, int upper, boolean yDown, short[] originalIndices)

sort	back to summary
private void sort(float[] values, int count) Sorts x,y pairs of values by the x value, then the y value. Parameters count:int Number of indices, must be even.

sort

back to summary

private void sort(float[] values, int count)

Sorts x,y pairs of values by the x value, then the y value.

Parameters

count:int: Number of indices, must be even.

sortWithIndices	back to summary
private void sortWithIndices(float[] values, int count, boolean yDown) Sorts x,y pairs of values by the x value, then the y value and stores unsorted original indices. Parameters count:int Number of indices, must be even.

sortWithIndices

back to summary

private void sortWithIndices(float[] values, int count, boolean yDown)

Sorts x,y pairs of values by the x value, then the y value and stores unsorted original indices.

Parameters

count:int: Number of indices, must be even.

public Class ConvexHull

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail