Plane-sweep algorithm for determining the colliding parts of simple polygons

被引：0

作者：

Qu, Jilin ^{[1
]}

机构：

[1] Shandong Finance Inst, Jinan, China

来源：

Jisuanji Xuebao/Chinese Journal of Computers | 2000年 / 23卷 / 07期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

页码：692 / 698

共 50 条

[41] A CONVEX-HULL ALGORITHM FOR PLANAR SIMPLE POLYGONS
ORLOWSKI, M
PATTERN RECOGNITION, 1985, 18 (05) : 361 - 366
[42] AN OPTIMAL VISIBILITY GRAPH ALGORITHM FOR TRIANGULATED SIMPLE POLYGONS
HERSHBERGER, J
ALGORITHMICA, 1989, 4 (01) : 141 - 155
[43] Point inclusion test algorithm for simple planar polygons
Wang, Huabing
Liu, Weijun
Bian, Hongyou
Zhou, Xiongjun
Yi Qi Yi Biao Xue Bao/Chinese Journal of Scientific Instrument, 2007, 28 (SUPPL. 5): : 479 - 482
[44] An Efficient Algorithm for Touring a Sequence of given Convex Polygons in the Plane
Xu, Changan
Jiang, Bo
Wang, Lijuan
PROCEEDINGS OF 2017 6TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND NETWORK TECHNOLOGY (ICCSNT 2017), 2017, : 74 - 78
[45] Search　Algorithm　for　Determining　the　Range　of　the　Possible　Collision　of　Conver　Polygons
Li Qinghua(Department of Computer Science and EngineeringHuazhong University of Science Technology
JournalofSystemsEngineeringandElectronics, 1996, (03) : 31 - 42
[46] Parallel algorithm for determining possible collision between convex polygons
Li, Qinghua
Gao, Yan
Cui, Guohua
Huazhong Ligong Daxue Xuebao/Journal Huazhong (Central China) University of Science and Technology, 1994, 22 (06):
[47] Two efficient algorithms for determining intersection points between simple polygons
Zalik, B
COMPUTERS & GEOSCIENCES, 2000, 26 (02) : 137 - 151
[48] Efficient generation of simple polygons for characterizing the shape of a set of points in the plane
Duckham, Matt
Kulik, Lars
Worboys, Mike
Galton, Antony
PATTERN RECOGNITION, 2008, 41 (10) : 3224 - 3236
[49] An Algorithm for Partitioning a Set into Simple Parts
L. Ya. Savel'ev
Programming and Computer Software, 2005, 31 : 293 - 300
[50] An algorithm for partitioning a set into simple parts
Savel'ev, LY
PROGRAMMING AND COMPUTER SOFTWARE, 2005, 31 (06) : 293 - 300

← 1 2 3 4 5 →