Publication IEICE TRANSACTIONS (1976-1990)Vol.E69No.9pp.988-995 Publication Date: 1986/09/25 Online ISSN: DOI: Print ISSN: 0000-0000 Type of Manuscript: PAPER Category: Algorithm, Computational Complexity Keyword:
Full Text: PDF>>
Summary: Let R1, , Rn be 3-dimensional iso-oriented objects. We formulate the contour of F=R1Rn, and describe an algorithm for finding the contour. Its computing time and space requirement are O(nlog2n+plogn) and O(n+p) respectively, where p is the number of intersecting pairs of the objects.