請用此 Handle URI 來引用此文件: http://hdl.handle.net/11455/38362
標題: Parallel Geometric Algorithms on a Mesh Connected Computer
作者: C.S.Jeong
D.T.Lee
關鍵字: Parallel algorithms
Computational geometry
Mesh-connected computer,
Multipoint location
Voronoi diagrams.
出版社: Springer-Verlag
摘要: We show that a number of geometric problems can be solved on a x/~ • x/-ff mesh-connected computer (MCC) in O(,/-n) time, which is optimal to within a constant factor, since a nontrivial data movement on an MCC requires f~(-fff) time. The problems studied here include multipoint location, planar point location, trapezoidal decomposition, intersection detection, intersection of two convex polygons, Voronoi diagram, the largest empty circle, the smallest enclosing circle, etc. The O(~/-ff) algorithms for all of the above problems are based on the classical divide-and-conquer problem-solving strategy.
URI: http://hdl.handle.net/11455/38362
ISSN: 0178-4617
顯示於類別:資訊科學與工程學系所

文件中的檔案:
沒有與此文件相關的檔案。


在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。