Optimizing Within-Distance Queries by Approximating Shapes with Maximal Bounded Boxes - Datasets

<p>Csv and sql files for the underlying data.<br> Figure 9: Calculating the distance between various number and type of shapes, i.e. from&nbsp;polygons, rotated and axis aligned rectangles, to points, polygons, rotated and axis aligned rectangles.<br> Table 1: Calculating distance between shapes of various complexity, i.e. points, lines, quadrilaterals, hexagons, dodecagons, icosagons, pentacontagons.<br> Table 2: Comparing the ordering of the shapes when distance operation is calculated, (a) from polygons to rectangles, (b) from rectangles to polygons.<br> Table 5 &amp; 6: Within-distance and distance&nbsp;queries between (a) actual polygons,&nbsp;(b) their bounded rectangles, (c) actual polygons and points, (d) their bounded rectangles and points.</p>