Research and application of a new rectangle intersection algorithm

Rectangles´ intersecting includes several situations like intersecting, containing, enclosing and crossing. Rectangle intersection algorithm is a more complex algorithm. Some of traditional algorithms are incomplete, for example, vertex detection algorithm ignores the situation of crossing and edges crossing algorithm ignores the situation of containing and enclosing. Some solved the problem successfully. But they separated the problem into several sub cases which needs to judge all kinds of conditions with complex formulas. In this paper, we design a new rectangle intersection algorithm based on ISO-oriented rectangles which successfully solves the rectangle intersection problem using one simple and perfect judgment formula. We also use this algorithm combined with the Google map technology to achieve a regional retrieval system. It is verified to be simple, comprehensive and practical through the tests.