Talk:Axis-aligned object

"Many problems in computational geometry allow for algorithms with better computational complexity when restricted to (collections of) axis-oriented objects"

I'm not sure that this is true. Often, performing calculations on axis-aligned objects gives a better constant factor, but does not improve the computational complexity as typically measured (asymptotic complexity doesn't care about constants or constant factors). You can see this is the case because if you are working with every object at least once, you have at least O(N) complexity, and rotating each object is a constant time operation in N (in any dimensions, as far as I'm aware). It is common knowledge that the algorithms are faster, but I think a source or at the very least an example is needed before talking about computational complexity. Thus, I am editing this article to only say "faster". 64.60.21.90 (talk) 15:26, 9 June 2015 (UTC)