A PARALLEL ALGORITHM FOR CONSTRUCTING PROJECTION POLYHEDRA

被引：0
|
作者：
SHAH, NR
机构：
[1] Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL 61801
来源：
INFORMATION PROCESSING LETTERS | 1993年 / 48卷 / 03期
基金：
美国国家科学基金会;
关键词：
COMPUTATIONAL GEOMETRY; PARALLEL ALGORITHMS; PROJECTION POLYHEDRA; SIMPLE CELL COMPLEXES;
D O I：
10.1016/0020-0190(93)90252-5
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A cell decomposition C of R(d) is called polytopical if it can be obtained as the projection of the boundary complex of a convex polyhedron P subset-of R(d+1). In this paper, we present a local condition for recognizing simple polytopical cell decompositions. Based on this, we present a parallel algorithm for the CREW PRAM model to construct P if the given simple cell decomposition C is polytopical. Our algorithm runs in O(log m) time and uses O(m/log m) processors where m is the number of facets of C. This assumes the availability of a suitable data structure for navigating among the facets of C. Such a structure can be created for R2 and R3 without any added resource penalty.
引用
收藏
页码：113 / 119
页数：7
相关论文
共 50 条
  • [1] RECOGNIZING POLYTOPICAL CELL COMPLEXES AND CONSTRUCTING PROJECTION POLYHEDRA
    AURENHAMMER, F
    [J]. JOURNAL OF SYMBOLIC COMPUTATION, 1987, 3 (03) : 249 - 255
  • [2] Parallel algorithm for constructing a labeled tree
    Natl Taiwan Univ of Science and, Technology, Taipei, Taiwan
    [J]. IEEE Trans Parallel Distrib Syst, 12 (1236-1240):
  • [3] A parallel algorithm for constructing a labeled tree
    Wang, YL
    Chen, HC
    Liu, WK
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1997, 8 (12) : 1236 - 1240
  • [4] Nonlinear projection filter with parallel algorithm and parallel sensors
    Single-Liertz, Tama
    Kim, Jongrae
    Richardson, Robert
    [J]. 2015 54TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC), 2015, : 2432 - 2437
  • [5] A Parallel Algorithm of Constructing Gene Regulatory Networks
    Xiao, Mei
    Zhang, Luwen
    He, Bing
    Xie, Jiang
    Zhang, Wu
    [J]. OPTIMIZATION AND SYSTEMS BIOLOGY, 2009, 11 : 184 - 188
  • [6] A Parallel and Memory Efficient Algorithm for Constructing the Contour Tree
    Acharya, Aditya
    Natarajan, Vijay
    [J]. 2015 IEEE PACIFIC VISUALIZATION SYMPOSIUM (PACIFICVIS), 2015, : 271 - 278
  • [7] A work efficient parallel algorithm for constructing Huffman codes
    Milidiú, RL
    Laber, ES
    Pessoa, AA
    [J]. DCC '99 - DATA COMPRESSION CONFERENCE, PROCEEDINGS, 1999, : 277 - 286
  • [8] A parallel algorithm for constructing strongly convex superhulls of points
    Castanho, CD
    Chen, W
    Wada, K
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2000, E83A (04) : 722 - 732
  • [9] A parallel algorithm for constructing adjacency graphs of FEA data
    Ueng, SK
    Sikorski, K
    [J]. PDPTA'2001: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, 2001, : 549 - 555
  • [10] On fixed size projection of simplicial polyhedra
    Hasan, Masud
    [J]. INFORMATION PROCESSING LETTERS, 2013, 113 (22-24) : 882 - 887
12345