Author : Bingyang Liu
Used queue to implement QuadTree structure. Every leaf node of the tree stored the rectangle image.
When the difference of maximum value and minimum value beyond threshold. Put the node into queue to wait for split.
forked from bbbbyang/QuadTree-Segmentation
-
Notifications
You must be signed in to change notification settings - Fork 0
DayongHN/Segmentation
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
QuadTree Segmentation C++ Code
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published
Languages
- C++ 100.0%