Algorithm for computing the union, intersection or difference of two polygons

被引:0
|
作者
机构
[1] Margalit, Avraham
[2] Knott, Gary D.
来源
Margalit, Avraham | 1600年 / 13期
关键词
Computer Graphics;
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 50 条
  • [41] An Improved Algorithm for Computing the Area of Union of Circles
    Li, Xiu-juan
    Chen, Jian-xun
    INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY AND MANAGEMENT ENGINEERING (ITME 2014), 2014, : 31 - 38
  • [42] An Algorithm for Matching Two Simple Polygons with Free Rotation
    Liu X.
    Yong J.
    Yong, Junhai (yongjh@tsinghua.edu.cn), 1600, Institute of Computing Technology (32): : 486 - 492
  • [43] OR AND IT - UNION OR INTERSECTION
    RYAN, JD
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1986, 37 (12) : 1141 - 1141
  • [44] An algorithm for computing fundamental solutions of difference operators
    Brandén, H
    Sundqvist, P
    NUMERICAL ALGORITHMS, 2004, 36 (04) : 331 - 343
  • [45] An Algorithm for Computing Fundamental Solutions of Difference Operators
    Henrik Brandén
    Per Sundqvist
    Numerical Algorithms, 2004, 36 : 331 - 343
  • [47] A heuristic resource scheduling algorithm of cloud computing based on polygons correlation calculation
    Tang, Jing-Mian
    Luo, Liang
    Wei, Kai-Ming
    Guo, Xun
    Ji, Xiao-Yu
    2015 IEEE 12TH INTERNATIONAL CONFERENCE ON E-BUSINESS ENGINEERING (ICEBE), 2015, : 365 - 370
  • [49] Quantum Algorithm for Searching of Two Sets Intersection
    Khadiev K.
    Krendeleva E.
    Russian Microelectronics, 2023, 52 (Suppl 1) : S379 - S383
  • [50] Computing Vision Points in Polygons
    S. Carlsson
    B. J. Nilsson
    Algorithmica, 1999, 24 : 50 - 75