Optimizing Within-Distance Queries by Approximating Shapes with Maximal Bounded Boxes - Datasets
收藏NIAID Data Ecosystem2026-03-13 收录
下载链接:
https://zenodo.org/record/5744713
下载链接
链接失效反馈官方服务:
资源简介:
Csv and sql files for the underlying data.
Figure 9: Calculating the distance between various number and type of shapes, i.e. from polygons, rotated and axis aligned rectangles, to points, polygons, rotated and axis aligned rectangles.
Table 1: Calculating distance between shapes of various complexity, i.e. points, lines, quadrilaterals, hexagons, dodecagons, icosagons, pentacontagons.
Table 2: Comparing the ordering of the shapes when distance operation is calculated, (a) from polygons to rectangles, (b) from rectangles to polygons.
Table 5 & 6: Within-distance and distance queries between (a) actual polygons, (b) their bounded rectangles, (c) actual polygons and points, (d) their bounded rectangles and points.
创建时间:
2021-12-18



