The polygon retrieval problem is, in essence, the problem of preprocessing a set of n 2-dimensional points, so than given a special ContainedIn spatial query, the subset of points falling inside the polygon can be reported efficiently. Such queries find great applicability in areas such as computer graphics, spatial databases and GIS applications. However, as the size of spatial data grows rapidly existing centralized solutions fail to retrieve the results in reasonable response time. In this paper, we propose a novel MapReduce algorithm for efficiently processing convex polygon planar range queries in a distributed manner. We apply a grid-based and an angle-based partitioning scheme on the data space and perform a comparative analysis. Through our experimental evaluation we prove that our system is efficient, robust and scalable.