Computational Technology Resources - CCP

S.H. Lo, H. Borouchaki, P. Laug, "Automatic Decomposition of Discretized Surfaces for Parallel Processing", in , (Editors), "Proceedings of the Second International Conference on Parallel, Distributed, Grid and Cloud Computing for Engineering", Civil-Comp Press, Stirlingshire, UK, Paper 14, 2011. doi:10.4203/ccp.95.14

Keywords: automatic decomposition, triangulated surfaces, parallel processing, parameterization.

Summary

In this paper, a generic surface decomposition algorithm is presented which could subdivide a general open or closed discretized surface into n pieces following any specified geometrical criteria. The cut lines are formed by taking unique lines (edges) on the discretized surface, so that only topological operations are involved, and hence individual partitioned surfaces could be processed independently before being put back together to recover the original surface. A surface marching process is proposed to balance the specified geometrical quantities of the cut surfaces following a distance map readily determined from the element adjacency relationship. The cut line can be further refined by a backward marching procedure within a potential cutting zone, so that other geometrical quantities such as sharp dihedral angles and deviation angles, etc. can also be taken into account. The time complexity of the surface decomposition process is basically linear as only the element adjacency relationship and the system of unique lines are referred to in all the steps for surface decomposition.

purchase the full-text of this paper (price £20)

go to the previous paper
go to the next paper
return to the table of contents
return to the book description
purchase this book (price £85 +P&P)

	Computational & Technology Resources an online resource for computational, engineering & technology publications
	not logged in - login
Front Page Browse CCP CSETS CTR IJRT Other Authors Search Purchase Guide FAQ Contact us	Civil-Comp Proceedings ISSN 1759-3433 CCP: 95 PROCEEDINGS OF THE SECOND INTERNATIONAL CONFERENCE ON PARALLEL, DISTRIBUTED, GRID AND CLOUD COMPUTING FOR ENGINEERING Edited by: Paper 14 Automatic Decomposition of Discretized Surfaces for Parallel Processing S.H. Lo¹, H. Borouchaki² and P. Laug² ¹Department of Civil Engineering, The University of Hong Kong, Hong Kong ²INRIA, Rocquencourt, Le Chesnay, France doi:10.4203/ccp.95.14 purchase the full-text of this paper Full Bibliographic Reference for this paper S.H. Lo, H. Borouchaki, P. Laug, "Automatic Decomposition of Discretized Surfaces for Parallel Processing", in , (Editors), "Proceedings of the Second International Conference on Parallel, Distributed, Grid and Cloud Computing for Engineering", Civil-Comp Press, Stirlingshire, UK, Paper 14, 2011. doi:10.4203/ccp.95.14 Keywords: automatic decomposition, triangulated surfaces, parallel processing, parameterization. Summary In this paper, a generic surface decomposition algorithm is presented which could subdivide a general open or closed discretized surface into n pieces following any specified geometrical criteria. The cut lines are formed by taking unique lines (edges) on the discretized surface, so that only topological operations are involved, and hence individual partitioned surfaces could be processed independently before being put back together to recover the original surface. A surface marching process is proposed to balance the specified geometrical quantities of the cut surfaces following a distance map readily determined from the element adjacency relationship. The cut line can be further refined by a backward marching procedure within a potential cutting zone, so that other geometrical quantities such as sharp dihedral angles and deviation angles, etc. can also be taken into account. The time complexity of the surface decomposition process is basically linear as only the element adjacency relationship and the system of unique lines are referred to in all the steps for surface decomposition. purchase the full-text of this paper (price £20) go to the previous paper go to the next paper return to the table of contents return to the book description purchase this book (price £85 +P&P)
Back to top	©Civil-Comp Limited 2023 - terms & conditions