Port variant | 538 |
Summary | Find rectangles containing a given dot (5.38) |
BROKEN | |
Package version | 0.02 |
Homepage | No known homepage |
Keywords | perl |
Maintainer | Perl Automaton |
License | Not yet specified |
Other variants | 540 |
Ravenports | Buildsheet | History |
Ravensource | Port Directory | History |
Last modified | 20 JUN 2024, 02:19:47 UTC |
Port created | 15 JUN 2017, 04:26:08 UTC |
single | Given a set of rectangles and a set of dots, the algorithm implemented in this modules finds for every dot, which rectangles contain it. The algorithm complexity is O(R * log(R) * log(R) + D * log(R)) being R the number of rectangles and D the number of dots. |
Build and Runtime | perl-5.38:primary:std |
main | mirror://CPAN/ID:S/SA/SALVA |
perl-Algorithm-BreakOverlappingRectangles:538 | Break up overlapping rectangles (5.38) |
perl-Algorithm-RectanglesContainingDot_XS:538 | Fast find rectangles containing a dot (5.38) |