Tree structure and block structure are typical data structures used to save time of query. Figure 13.4.3 shows the block structure for solving a point-in-polygon problem, where only the block that includes a polygon should be checked and searched instead of all other blocks.