A Linear-Time Constant-Space Algorithm for Computing the Spanning Line Segments in Three Dimensions
碩士 === 國立臺灣科技大學 === 資訊工程研究所 === 87 === Owing to the properties of the completeness and inseparability, the set of spanning line segments (SLS) is a good representation for a three--dimensional (3-D) polyhedron and is useful in testing the intersection between a plane and that 3--D polyhed...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
1999
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/96179985990348703970 |
| Summary: | 碩士 === 國立臺灣科技大學 === 資訊工程研究所 === 87 === Owing to the properties of the completeness and inseparability, the set of spanning line segments (SLS) is a good representation for a three--dimensional (3-D) polyhedron and is useful in testing the intersection between a plane and that 3--D polyhedron. Given a3--D polyhedron with N vertices, this paper presents an incremental O(N)-time algorithm for constructing the SLS. The proposed algorithm has the same time complexity as the previous best result [4], but it reduces the working memory required in [4] from O(N) to O(1).
|
|---|