Figures & data
![Figure 2. (a) Conceptual model for QQVTM and (b) Logical model of QQVTM. Note: Rectangles represent entity sets and ovals represent attributes. Diamonds with lines connecting to entity sets represent containing or constitution relationships between two entity sets (e.g. a tile contains n vertices and n arcs constitute a boundary). The numbers on the lines indicate three kinds of quantitative relationships: (1) 1:1 indicates a one-to-one relationship, (2) 1:n indicates a one-to-many relationship, and (3) m:n indicates a many-to-many relationship. To implement a relationship between two objects, the key of one attribute table is included in the other attribute table. The associated keys are linked using lines.](/cms/asset/1dcbe603-5ddc-4067-b45e-e55d5dd5a4b0/tjde_a_1016558_f0002_b.jpg)
![Figure 4. Geometry-based mapping of vector data. (a) Simply mapping the vertices contained in the vector data. (b) The resolution of the vector tile is lower than the resolution of the underlying terrain data. (c) The resolution of the vector tile is higher than the resolution of the underlying terrain data. (d) The vector geometry conforms closely to the terrain surface since they have the same resolution.](/cms/asset/17980943-e4d8-473a-b361-d17dd029c05c/tjde_a_1016558_f0004_b.jpg)
![Figure 7. The Weiler–Atherton clipping algorithm can clip all polygons, including concave polygons and polygons containing holes. The boundary of the clipping result of a polygon (abcdhHIga) constitutes a partial polygon boundary (ab, cd, and hHIg) and a partial tile boundary (bc, dh, and ga).](/cms/asset/a66f9b3a-6760-4336-8753-52d19d021836/tjde_a_1016558_f0007_c.jpg)
![Figure 8. Tile-based reconstruction of vector data. P0, P1, … P6 are the original vertices of the 2D vector data. Q0, Q1, … Q13 are the intersections of the 2D vector data and the terrain grids. (a) Vertices are stored in tiles. (b) The link relationships of vector tiles are recorded in temporary tables using the PreTile and NextTile items of the intersections.](/cms/asset/ceb94067-738e-42a2-a0c1-89f38e30633e/tjde_a_1016558_f0008_c.jpg)
![Figure 9. Storing order of polygon boundaries. Note: The dashed area is the interior of the polygon, which is always on the right of the forward direction when traversing a vertex list.](/cms/asset/b93e2124-6190-4d90-bd50-e7fd6edf5bb1/tjde_a_1016558_f0009_b.jpg)
Register now or learn more
Free access
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
To request a reprint or corporate permissions for this article, please click on the relevant link below:
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
Obtain permissions instantly via Rightslink by clicking on the button below:
If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.
People also read lists articles that other readers of this article have read.
Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.
Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.