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...

Full description

Bibliographic Details
Main Authors:	Shyh-Ming Chang, 張世明
Other Authors:	Kuo-Liang Chung
Format:	Others
Language:	en_US
Published:	1999
Online Access:	http://ndltd.ncl.edu.tw/handle/96179985990348703970

id	ndltd-TW-087NTUST392006
record_format	oai_dc
spelling	ndltd-TW-087NTUST3920062016-02-01T04:12:44Z http://ndltd.ncl.edu.tw/handle/96179985990348703970 A Linear-Time Constant-Space Algorithm for Computing the Spanning Line Segments in Three Dimensions 一個在三維空間計算生成線段之線性時間及常數空間的演算法 Shyh-Ming Chang 張世明碩士國立臺灣科技大學資訊工程研究所 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). Kuo-Liang Chung 鍾國亮 1999 學位論文 ; thesis 28 en_US
collection	NDLTD
language	en_US
format	Others
sources	NDLTD
description	碩士 === 國立臺灣科技大學 === 資訊工程研究所 === 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).
author2	Kuo-Liang Chung
author_facet	Kuo-Liang Chung Shyh-Ming Chang 張世明
author	Shyh-Ming Chang 張世明
spellingShingle	Shyh-Ming Chang 張世明 A Linear-Time Constant-Space Algorithm for Computing the Spanning Line Segments in Three Dimensions
author_sort	Shyh-Ming Chang
title	A Linear-Time Constant-Space Algorithm for Computing the Spanning Line Segments in Three Dimensions
title_short	A Linear-Time Constant-Space Algorithm for Computing the Spanning Line Segments in Three Dimensions
title_full	A Linear-Time Constant-Space Algorithm for Computing the Spanning Line Segments in Three Dimensions
title_fullStr	A Linear-Time Constant-Space Algorithm for Computing the Spanning Line Segments in Three Dimensions
title_full_unstemmed	A Linear-Time Constant-Space Algorithm for Computing the Spanning Line Segments in Three Dimensions
title_sort	linear-time constant-space algorithm for computing the spanning line segments in three dimensions
publishDate	1999
url	http://ndltd.ncl.edu.tw/handle/96179985990348703970
work_keys_str_mv	AT shyhmingchang alineartimeconstantspacealgorithmforcomputingthespanninglinesegmentsinthreedimensions AT zhāngshìmíng alineartimeconstantspacealgorithmforcomputingthespanninglinesegmentsinthreedimensions AT shyhmingchang yīgèzàisānwéikōngjiānjìsuànshēngchéngxiànduànzhīxiànxìngshíjiānjíchángshùkōngjiāndeyǎnsuànfǎ AT zhāngshìmíng yīgèzàisānwéikōngjiānjìsuànshēngchéngxiànduànzhīxiànxìngshíjiānjíchángshùkōngjiāndeyǎnsuànfǎ AT shyhmingchang lineartimeconstantspacealgorithmforcomputingthespanninglinesegmentsinthreedimensions AT zhāngshìmíng lineartimeconstantspacealgorithmforcomputingthespanninglinesegmentsinthreedimensions
_version_	1718174979721265152

A Linear-Time Constant-Space Algorithm for Computing the Spanning Line Segments in Three Dimensions

Similar Items