.png){kind=icon}
.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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).
Keywords:
Isothetic polygons
Interval tree
Polygon intersection
Polygon union
Polygon set-difference
Journal
IF:
3
Papers:
1.9W
Citations:
3.2W