一种二分搜索法 用于解决Bezier曲线和B样条曲线编辑时的搜索区间问题-Binary search method

区间树，创建区间树，插入删除和搜索操作。 红黑树创建查询删除。 二分查找，多种排序方式实现，快速矩阵运算实现-Interval trees, create a range of trees, insert and delete search operation. Create a query remove red-black tree. Binary search, sorting various ways, matrix operations to achieve fast

基于二分查找的二分区间检索，能根据输入一段区间进行查找(Search between two partitions based on two point lookup can be searched according to an interval of input)