mirror of
https://github.com/opencv/opencv.git
synced 2026-07-25 21:33:04 +04:00
59218f9edd
Geometry module #29175 OpenCV Contrib: https://github.com/opencv/opencv_contrib/pull/4129 CI changes: https://github.com/opencv/ci-gha-workflow/pull/313 Continues - https://github.com/opencv/opencv/pull/28804 - https://github.com/opencv/opencv/pull/29101 - https://github.com/opencv/opencv/pull/29108 - https://github.com/opencv/opencv/pull/28810 Todo for followup PRs: - [x] Rename doxygen groups - [x] Fix JS modules layout and whitelists - [ ] Sort tutorials code/snippets ### Pull Request Readiness Checklist See details at https://github.com/opencv/opencv/wiki/How_to_contribute#making-a-good-pull-request - [x] I agree to contribute to the project under Apache 2 License. - [x] To the best of my knowledge, the proposed patch is not based on a code under GPL or another license that is incompatible with OpenCV - [x] The PR is proposed to the proper branch - [ ] There is a reference to the original bug report and related work - [ ] There is accuracy test, performance test and test data in opencv_extra repository, if applicable Patch to opencv_extra has the same branch name. - [ ] The feature is well documented and sample code can be built with the project CMake
118 lines
2.8 KiB
Java
118 lines
2.8 KiB
Java
package org.opencv.test.geometry;
|
|
|
|
import org.opencv.core.MatOfFloat6;
|
|
import org.opencv.core.Point;
|
|
import org.opencv.core.Rect;
|
|
import org.opencv.geometry.Subdiv2D;
|
|
import org.opencv.test.OpenCVTestCase;
|
|
|
|
public class Subdiv2DTest extends OpenCVTestCase {
|
|
|
|
protected void setUp() throws Exception {
|
|
super.setUp();
|
|
}
|
|
|
|
public void testEdgeDstInt() {
|
|
fail("Not yet implemented");
|
|
}
|
|
|
|
public void testEdgeDstIntPoint() {
|
|
fail("Not yet implemented");
|
|
}
|
|
|
|
public void testEdgeOrgInt() {
|
|
fail("Not yet implemented");
|
|
}
|
|
|
|
public void testEdgeOrgIntPoint() {
|
|
fail("Not yet implemented");
|
|
}
|
|
|
|
public void testFindNearestPoint() {
|
|
fail("Not yet implemented");
|
|
}
|
|
|
|
public void testFindNearestPointPoint() {
|
|
fail("Not yet implemented");
|
|
}
|
|
|
|
public void testGetEdge() {
|
|
fail("Not yet implemented");
|
|
}
|
|
|
|
public void testGetEdgeList() {
|
|
fail("Not yet implemented");
|
|
}
|
|
|
|
public void testGetTriangleList() {
|
|
Subdiv2D s2d = new Subdiv2D( new Rect(0, 0, 50, 50) );
|
|
s2d.insert( new Point(10, 10) );
|
|
s2d.insert( new Point(20, 10) );
|
|
s2d.insert( new Point(20, 20) );
|
|
s2d.insert( new Point(10, 20) );
|
|
MatOfFloat6 triangles = new MatOfFloat6();
|
|
s2d.getTriangleList(triangles);
|
|
assertEquals(2, triangles.cols());
|
|
/*
|
|
int cnt = triangles.rows();
|
|
float buff[] = new float[cnt*6];
|
|
triangles.get(0, 0, buff);
|
|
for(int i=0; i<cnt; i++)
|
|
Log.d("*****", "["+i+"]: " + // (a.x, a.y) -> (b.x, b.y) -> (c.x, c.y)
|
|
"("+buff[6*i+0]+","+buff[6*i+1]+")" + "->" +
|
|
"("+buff[6*i+2]+","+buff[6*i+3]+")" + "->" +
|
|
"("+buff[6*i+4]+","+buff[6*i+5]+")"
|
|
);
|
|
*/
|
|
}
|
|
|
|
public void testGetVertexInt() {
|
|
fail("Not yet implemented");
|
|
}
|
|
|
|
public void testGetVertexIntIntArray() {
|
|
fail("Not yet implemented");
|
|
}
|
|
|
|
public void testGetVoronoiFacetList() {
|
|
fail("Not yet implemented");
|
|
}
|
|
|
|
public void testInitDelaunay() {
|
|
fail("Not yet implemented");
|
|
}
|
|
|
|
public void testInsertListOfPoint() {
|
|
fail("Not yet implemented");
|
|
}
|
|
|
|
public void testInsertPoint() {
|
|
fail("Not yet implemented");
|
|
}
|
|
|
|
public void testLocate() {
|
|
fail("Not yet implemented");
|
|
}
|
|
|
|
public void testNextEdge() {
|
|
fail("Not yet implemented");
|
|
}
|
|
|
|
public void testRotateEdge() {
|
|
fail("Not yet implemented");
|
|
}
|
|
|
|
public void testSubdiv2D() {
|
|
fail("Not yet implemented");
|
|
}
|
|
|
|
public void testSubdiv2DRect() {
|
|
fail("Not yet implemented");
|
|
}
|
|
|
|
public void testSymEdge() {
|
|
fail("Not yet implemented");
|
|
}
|
|
|
|
}
|