Klee’s rule finds a union of line segments lying horizontally. OR total length lined by horizontal line segments once seen vertically. The rule was planned by Paul Klee in 1977. The time complexness of the rule is O (N log ...
Tag: Klee Algorithm
