Aiming at the problem of the node covering redundancy and the overlap between brother nodes in R-tree spatial index structure,a new index structure which is called RP-tree is proposed.Spatial data is partitioned through the most suitable function and the ordered data rectangular,therefore the height of the tree becomes as low as possible and nodes overlap smaller.To RP-tree index structure,using screening rules and the relevant line segment set theorem,a new algorithm of nearest neighbor query of line segme...