Investigation of the Coarse Aggregate Texture Property Using an Improved Laplacian Smoothing Algorithm

2019 ◽  
Vol 49 (3) ◽  
pp. 20180626
Author(s):  
Dongqing Xu ◽  
Dong Zhang ◽  
Xinyi Zhuang
2020 ◽  
Vol 20 (6) ◽  
pp. 1989-1995
Author(s):  
Zhuo-ju Huang ◽  
Jie-min Ding ◽  
Sheng-yi Xiang

Author(s):  
Ron S. Gutfinger ◽  
Raj Abraham

Abstract Usually, a mesh created by an automatic mesh generator is of low quality. In order to improve the mesh quality, a smoothing algorithm is applied on the mesh. The result is a mesh ready for analysis. The smoothing is a CPU intensive iterative process. In some cases, smoothing may take longer than the initial mesh creation. In this work an optimized smoothing algorithm is presented. While iterating, the algorithm recognizes nodes that are sufficiently smoothed, and ignores them in subsequent iterations. Progressively, a smaller and smaller subset of nodes is smoothed. The result is less CPU time spent per iteration, and some decrease in the total number of iterations. This method, called subsmoothing, is applied on Laplacian smoothing of shell meshes. Examples show 30% CPU time savings and little change in mesh quality (¼%).


2014 ◽  
Vol 2 (1) ◽  
pp. 41-54 ◽  
Author(s):  
Damre Shraddha ◽  
Firake Hitali ◽  
Dode Pradeep ◽  
Shrikant Varpe

Author(s):  
A. C. Umare ◽  
Akshay Tak ◽  
Amrut Talekar ◽  
Akshay Waghmare ◽  
Ajinkya Todkar ◽  
...  

2020 ◽  
Vol 254 ◽  
pp. 119195 ◽  
Author(s):  
Matthew Zhi Yeon Ting ◽  
Kwong Soon Wong ◽  
Muhammad Ekhlasur Rahman ◽  
Meheron Selowara Joo

2021 ◽  
Vol 1770 (1) ◽  
pp. 012036
Author(s):  
B Priyadharshini ◽  
R Nirmala ◽  
Eshanthini ◽  
C Manoj Kumaar

Sign in / Sign up

Export Citation Format

Share Document