-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
7 changed files
with
57 additions
and
5 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,4 +1,6 @@ | ||
# GIF | ||
> Graphics Interchange Format是一种位图,已8位色即256种颜色重现真彩色的图像,实际上是一种压缩文档,采样LZW压缩算法进行编码,有效减少图像在网络上的传输时间. | ||
|
||
- [jsgif: A GIF player in JavaScript](https://slbkbs.org/jsgif/) | ||
- [jsgif: A GIF player in JavaScript](https://slbkbs.org/jsgif/) | ||
- [带你如何用js读取gif图片数据流,解码gif ](https://juejin.cn/post/7022637452066029599) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,13 @@ | ||
# 树形结构 | ||
> K-D-Tree, K-D-B-tree, Segment-Tree, R-Tree, R+-Tree, R*-Tree, AVL,Red-Back,B-tree, Trire-tree | ||
## B树 | ||
是一个平衡树, 在一维时,就说把直线分为若干线段,当查找某个满足要点的点的时候,只需要查找它所属的线段即可,其思想就说先找一个大的空间,再逐步缩小所要查找的空间,最终在一个设定最小不可分空间中找出满足的解. | ||
|
||
### R树 | ||
> Guttman, A.; “R-trees: a dynamic index structure for spatial searching,” ACM, 1984, 14 | ||
R树处理高维空间存储问题的数据结构 | ||
|
||
- [RBush is a high-performance JavaScript library for 2D spatial indexing of points and rectangles. It's based on an optimized R-tree data structure with bulk insertion support.](https://github.com/mourner/rbush) | ||
|
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters