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 条
  • [1] AN ALGORITHM FOR COMPUTING THE UNION, INTERSECTION OR DIFFERENCE OF 2 POLYGONS
    MARGALIT, A
    KNOTT, GD
    COMPUTERS & GRAPHICS, 1989, 13 (02) : 167 - 183
  • [2] Algorithms for computing intersection and union of toleranced polygons with applications
    Cazals, F
    Ramkumar, GD
    AI EDAM-ARTIFICIAL INTELLIGENCE FOR ENGINEERING DESIGN ANALYSIS AND MANUFACTURING, 1997, 11 (04): : 263 - 272
  • [4] ON SOME UNION AND INTERSECTION PROBLEMS FOR POLYGONS WITH FIXED ORIENTATIONS
    WIDMAYER, P
    WU, YF
    SCHLAG, MDF
    WONG, CK
    COMPUTING, 1986, 36 (03) : 183 - 197
  • [5] Two results on intersection graphs of polygons
    Kratochvíl, J
    Pergel, M
    GRAPH DRAWING, 2004, 2912 : 59 - 70
  • [6] ON SOME UNION AND INTERSECTION PROBLEMS FOR POLYGONS WITH FIXED ORIENTATIONS.
    Widmayer, P.
    Wu, Y.F.
    Schlag, M.D.F.
    Wong, C.K.
    Computing (Vienna/New York), 1986, 36 (03): : 183 - 197
  • [7] An optimal algorithm for the intersection radius of a set of convex polygons
    Jadhav, S
    Mukhopadhyay, A
    Bhattacharya, B
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1996, 20 (02): : 244 - 267
  • [8] AN OPTIMAL ALGORITHM FOR THE INTERSECTION RADIUS OF A SET OF CONVEX POLYGONS
    JADHAV, S
    MUKHOPADHYAY, A
    BHATTACHARYA, B
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 652 : 92 - 103
  • [9] A Novel Algorithm for Union between Complex Polygons
    Cui Can
    Shen Dingtao
    Wu Wenzhou
    Wang Jiechen
    SECOND INTERNATIONAL CONFERENCE ON COMPUTER AND ELECTRICAL ENGINEERING, VOL 1, PROCEEDINGS, 2009, : 8 - 11
  • [10] A new algorithm for computing Boolean operations on polygons
    Martinez, Francisco
    Jesus Rueda, Antonio
    Ramon Feito, Francisco
    COMPUTERS & GEOSCIENCES, 2009, 35 (06) : 1177 - 1185