PRAM ALGORITHMS FOR IDENTIFYING POLYGON SIMILARITY

被引：0
|
作者：
ILIOPOULOS, CS
SMYTH, WF
机构：
来源：
OPTIMAL ALGORITHMS | 1989年 / 401卷
关键词：
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
引用
收藏
页码：25 / 32
页数：8
相关论文
共 50 条
  • [31] Polygon contour similarity and complexity measurement and application in simplification
    Cheng M.
    Sun Q.
    Xu L.
    Chen H.
    Cehui Xuebao/Acta Geodaetica et Cartographica Sinica, 2019, 48 (04): : 489 - 501
  • [32] PARALLEL ALGORITHMS FOR SOME DOMINANCE PROBLEMS BASED ON A CREW PRAM
    CHAN, IW
    FRIESEN, DK
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 557 : 375 - 384
  • [33] OPTIMAL PARALLEL HYPERCUBE ALGORITHMS FOR POLYGON PROBLEMS
    ATALLAH, MJ
    CHEN, DZ
    IEEE TRANSACTIONS ON COMPUTERS, 1995, 44 (07) : 914 - 922
  • [34] Algorithms for optimal area triangulations of a convex polygon
    Keil, J. Mark
    Vassilev, Tzvetalin S.
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2006, 35 (03): : 173 - 187
  • [35] Optimal parallel hypercube algorithms for polygon problems
    Atallah, Mikhail J., 1600, IEEE, Los Alamitos, CA, United States (44):
  • [36] Algorithms for packing two circles in a convex polygon
    Bose, P
    Czyzowicz, J
    Kranakis, E
    Maheshwari, A
    DISCRETE AND COMPUTATIONAL GEOMETRY, 2000, 1763 : 93 - 103
  • [37] On optimal OROW-PRAM algorithms for computing recursively defined functions
    Niedermeier, Rolf
    Rossmanith, Peter
    Parallel processing letters, 1995, 5 (02) : 299 - 309
  • [38] Work-time optimal k-merge algorithms on the PRAM
    Hayashi, T
    Nakano, K
    Olariu, S
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1998, 9 (03) : 275 - 282
  • [39] NEW CONNECTIVITY AND MSF ALGORITHMS FOR SHUFFLE-EXCHANGE NETWORK AND PRAM
    AWERBUCH, B
    SHILOACH, Y
    IEEE TRANSACTIONS ON COMPUTERS, 1987, 36 (10) : 1258 - 1263
  • [40] Work-time optimal k-merge algorithms on the PRAM
    Hayashi, T
    Nakano, K
    Olariu, S
    11TH INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM, PROCEEDINGS, 1997, : 298 - 302
12345