Home
last modified time | relevance | path

Searched refs:pointIndex (Results 1 – 4 of 4) sorted by relevance

/external/libgdx/gdx/src/com/badlogic/gdx/math/
DDelaunayTriangulator.java113 for (int pointIndex = offset; pointIndex < end; pointIndex += 2) { in computeTriangles()
114 float x = points[pointIndex], y = points[pointIndex + 1]; in computeTriangles()
188 triangles.add(pointIndex); in computeTriangles()
/external/dng_sdk/source/
Ddng_bad_pixels.cpp1031 uint32 pointIndex, in FixClusteredPixel() argument
1060 dng_point badPoint = fList->Point (pointIndex); in FixClusteredPixel()
1085 pointIndex)) in FixClusteredPixel()
1746 for (uint32 pointIndex = 0; pointIndex < pointCount; pointIndex++) in ProcessArea() local
1749 dng_point badPoint = fList->Point (pointIndex); in ProcessArea()
1757 bool isIsolated = fList->IsPointIsolated (pointIndex, in ProcessArea()
1776 pointIndex, in ProcessArea()
Ddng_bad_pixels.h294 uint32 pointIndex,
/external/opencv3/modules/imgproc/src/
Dmin_enclosing_triangle.cpp185 static unsigned int intersectsAboveOrBelow(unsigned int succPredIndex, unsigned int pointIndex,
878 static unsigned int intersectsAboveOrBelow(unsigned int succPredIndex, unsigned int pointIndex, in intersectsAboveOrBelow() argument
881 … if (height(succPredIndex, polygon, nrOfPoints, c) > height(pointIndex, polygon, nrOfPoints, c)) { in intersectsAboveOrBelow()