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

被引:0
|
作者
Qu, Jilin [1 ]
机构
[1] Shandong Finance Inst, Jinan, China
来源
关键词
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
页码:692 / 698
相关论文
共 50 条
  • [1] Plane-sweep algorithm for finding the touch parts of rotating simple polygons
    Qu, Jilin
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2000, 37 (05): : 564 - 569
  • [2] Plane-sweep algorithm of O(nlogn) for the inclusion hierarchy among circles
    Kim, DS
    Lee, BH
    Cho, CH
    Sugihara, K
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2004, PT 3, 2004, 3045 : 53 - 61
  • [3] A New Plane-Sweep Algorithm for the K-Closest-Pairs Query
    Roumelis, George
    Vassilakopoulos, Michael
    Corral, Antonio
    Manolopoulos, Yannis
    SOFSEM 2014: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2014, 8327 : 478 - 490
  • [4] A PLANE-SWEEP ALGORITHM FOR FINDING A CLOSEST PAIR AMONG CONVEX PLANAR OBJECTS
    BARTLING, F
    HINRICHS, K
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 577 : 221 - 232
  • [5] SPACE-ECONOMICAL PLANE-SWEEP ALGORITHMS
    OTTMANN, T
    WOOD, D
    COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1986, 34 (01): : 35 - 51
  • [6] Diminished reality using plane-sweep algorithm with weakly-calibrated cameras
    Jarusirisawad S.
    Hosokawa T.
    Saito H.
    Progress in Informatics, 2010, (07): : 11 - 20
  • [7] A plane-sweep based depth reconstruction for DIBR
    Liu, Suxing
    An, Pong
    Zhang, Zhaoyang
    AD'07: PROCEEDINGS OF ASIA DISPLAY 2007, VOLS 1 AND 2, 2007, : 1016 - 1021
  • [8] Parallel GPU-based Plane-Sweep Algorithm for Construction of iCPI-Trees
    Andrzejewski, Witold
    Boinski, Pawel
    JOURNAL OF DATABASE MANAGEMENT, 2015, 26 (03) : 1 - 20
  • [9] PLANE-SWEEP SOLVES THE CLOSEST PAIR PROBLEM ELEGANTLY
    HINRICHS, K
    NIEVERGELT, J
    SCHORN, P
    INFORMATION PROCESSING LETTERS, 1988, 26 (05) : 255 - 261
  • [10] PLANE-SWEEP ALGORITHMS FOR INTERSECTING GEOMETRIC-FIGURES
    NIEVERGELT, J
    PREPARATA, FP
    COMMUNICATIONS OF THE ACM, 1982, 25 (10) : 739 - 747