Given a dataset S of points in $${\mathbb {R}}^2$$ , the range closest-pair (RCP) problem aims to preprocess into data structure such that when query X is specified, $$S \cap X$$ can be reported efficiently. The RCP viewed as range-search version classical problem, and finds applications many areas. Due its non-decomposability, much more challenging than traditional problems. This paper revisit...