6 Commits

Author	SHA1	Message	Date
Sofian Elmotiem	3d02d863f9	calib3d: use Delaunay triangulation in computeRNG for findCirclesGrid ... The relative neighborhood graph (RNG) is a subgraph of the Delaunay triangulation, so only Delaunay edges are candidates for RNG membership. The previous implementation tested all N^2 pairs against all N points, giving O(N^3). The new implementation builds the Delaunay triangulation with Subdiv2D (O(N log N)), then checks only those ~3N edges for the RNG lune-emptiness condition, reducing computeRNG to O(N^2) in the worst case and much better in practice for regular grids. Added synthetic-grid accuracy tests for both symmetric and asymmetric patterns across several sizes, and a perf test parameterized by grid size.	2026-06-10 13:17:26 +02:00
Alexander Alekhin	4a297a2443	ts: refactor OpenCV tests ... - removed tr1 usage (dropped in C++17) - moved includes of vector/map/iostream/limits into ts.hpp - require opencv_test + anonymous namespace (added compile check) - fixed norm() usage (must be from cvtest::norm for checks) and other conflict functions - added missing license headers	2018-02-03 19:39:47 +00:00
Andrey Kamaev	2a6fb2867e	Remove all using directives for STL namespace and members ... Made all STL usages explicit to be able automatically find all usages of particular class or function.	2013-02-25 15:04:17 +04:00
Andrey Kamaev	73cb77842e	Replace jpegs with png (see 06a13d9)	2012-10-05 18:15:44 +04:00
Andrey Kamaev	65f5343ed5	Refactored performance tests. TEST_CYCLE macro is renamed to TEST_CYCLE_N; SIMPLE_TEST_CYCLE is renamed to TEST_CYCLE; from now 100 iterations are default for performance tests	2011-12-29 16:46:16 +00:00
Andrey Kamaev	99d3ce52c5	Added performance tests for findCirclesGrid and solvePnP	2011-09-13 07:54:19 +00:00