Skip to content

Commit

Permalink
docs: fix links
Browse files Browse the repository at this point in the history
  • Loading branch information
MichaelKreil committed Mar 31, 2024
1 parent 706bceb commit fdb4e13
Show file tree
Hide file tree
Showing 2 changed files with 6 additions and 6 deletions.
6 changes: 3 additions & 3 deletions readme.md
Original file line number Diff line number Diff line change
Expand Up @@ -7,6 +7,6 @@

## Implementations

- [versatiles (Rust)](https://github.com/versatiles-org/versatile)
- [@versatile/container (Node ESM)](https://github.com/versatiles-org/node-versatiles-container)
- [versatiles (Node CJS)](https://github.com/yetzt/node-versatiles)
- VersaTiles (Rust) [Repo](https://github.com/versatiles-org/versatiles-rs), [library crate](https://crates.io/crates/versatiles-lib)
- VersaTiles (Node ESM) [Repo](https://github.com/versatiles-org/node-versatiles-container), [npm package](https://www.npmjs.com/package/@versatiles/container)
- VersaTiles (Node CJS) [Repo](https://github.com/yetzt/node-versatiles)
6 changes: 3 additions & 3 deletions v01/readme.md
Original file line number Diff line number Diff line change
Expand Up @@ -11,7 +11,7 @@ The file is composed of several parts:
- **index** of these tiles
4. **index** of all blocks

<p align="center"><img src="file_format.svg?raw=true"></p>
<p align="center"><img src="file_format.svg"></p>

## file

Expand Down Expand Up @@ -79,7 +79,7 @@ The file is composed of several parts:
- Each `block` contains data of up to 256x256 (= 65536) `tile`s.
- Levels 0-8 can be stored with one `block` each. level 9 might contain 512x512 `tile`s so 4 `block`s are necessary.

<p align="center"><img src="level_blocks.svg?raw=true"></p>
<p align="center"><img src="level_blocks.svg"></p>

- Each `block` contains the concatenated `tile` blobs and ends with a `tile_index`.
- Neither the order of `block`s in the `file` nor the order of `tile`s in a `block` matters as long as their indexes are correct.
Expand All @@ -96,7 +96,7 @@ The file is composed of several parts:
- `tile`s are read horizontally then vertically
- `j = (row - row_min)*(col_max - col_min + 1) + (col - col_min)`

<p align="center"><img src="block_tiles.svg?raw=true"></p>
<p align="center"><img src="block_tiles.svg"></p>

- identical `tile`s can be stored once and referenced multiple times to save storage space
- if a `tile` does not exist, the length of `tile` is zero
Expand Down

0 comments on commit fdb4e13

Please sign in to comment.