Searched refs:edgeIndex (Results 1 – 2 of 2) sorted by relevance
| /external/s2-geometry-library-java/tests/com/google/common/geometry/ |
| D | S2PolylineTest.java | 129 int edgeIndex = -1;
133 edgeIndex = line.getNearestEdgeIndex(testPoint);
135 line.projectToEdge(testPoint, edgeIndex), S2LatLng.fromDegrees(0, 0).toPoint()));
136 assertEquals(0, edgeIndex);
139 edgeIndex = line.getNearestEdgeIndex(testPoint);
141 line.projectToEdge(testPoint, edgeIndex), S2LatLng.fromDegrees(0, 0.5).toPoint()));
142 assertEquals(0, edgeIndex);
145 edgeIndex = line.getNearestEdgeIndex(testPoint);
147 line.projectToEdge(testPoint, edgeIndex), S2LatLng.fromDegrees(0, 1).toPoint()));
148 assertEquals(0, edgeIndex);
[all …]
|
| /external/s2-geometry-library-java/src/com/google/common/geometry/ |
| D | S2EdgeIndex.java | 545 private final S2EdgeIndex edgeIndex; field in S2EdgeIndex.DataEdgeIterator
576 public DataEdgeIterator(S2EdgeIndex edgeIndex) { in DataEdgeIterator() argument
577 this.edgeIndex = edgeIndex; in DataEdgeIterator()
586 edgeIndex.predictAdditionalCalls(1); in getCandidates()
587 isBruteForce = !edgeIndex.isIndexComputed(); in getCandidates()
589 edgeIndex.incrementQueryCount(); in getCandidates()
591 numEdges = edgeIndex.getNumEdges(); in getCandidates()
594 edgeIndex.findCandidateCrossings(a, b, candidates); in getCandidates()
|