.png){kind=icon}
返回
A combinatorial algorithm to compute set operations on simple isothetic polygons
.png){kind=icon}
PRE
AI
DOI：10.1007/s11042-022-13579-4.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A combinatorial algorithm is presented in this work to compute different set operations such as union, intersection, and difference on isothetic polygons. The algorithm constructs an interval tree and formulates a set of combinatorial rules to find the intersection points between two isothetic polygons and then perform the set operations respectively. The running time of the proposed algorithm is found to be O (n log n).
Keyword:
Isothetic polygons
Interval tree
Polygon intersection
Polygon union
Polygon set-difference
期刊
IF:
3
论文数:
1.9W
被引数:
3.2W
机构
引用论文
Penetration depth, microwave surface resistance, and gap ratio in NbN and Ba1−xKxBiO3 thin films
PREAI
分享收藏Sequential proton NMR assignment and secondary structure determination of salmon calcitonin in solution.png)
Biochemistry
BiochemistryIF0
PREAI
分享收藏Complications of intraoperative radiofrequency ablation of liver metastases肝脏转移瘤术中射频消融的并发症HPB
OAAI
HPBIF0
OAAI分享收藏Acute myeloid leukemia: challenges for diagnosis and treatment in Latin America急性髓系白血病：拉丁美洲的诊断和治疗挑战
IF0
PREAI
分享收藏
查看更多内容