TY - JOUR
T1 - New approach of a contact detection algorithm based on a Shortest Link method
AU - León, Roberto
AU - Velásquez, Jaime
AU - Gatica, Gustavo
AU - Vargas, Ximena
AU - Coronado, Jairo
N1 - Publisher Copyright:
© 2022 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (https://creativecommons.org/licenses/by-nc-nd/4.0) Peer-review under responsibility of the Conference Program Chairs.
PY - 2022
Y1 - 2022
N2 - Contact detection algorithms based on a Common Plane (CP) are among the most used and investigated, despite not being the most optimal when generating a CP and thus detecting the existence of contact between particles. The generation of the CP is quite expensive in computational terms, for which some algorithms seek to check a possibility of contact between them quickly; and then verify it. For these cases, there are algorithms such as the Shortest Link Method (SLM) that efficiently generate a CP and quickly verify the existence of contact between particles. However, this algorithm has some shortcomings. The main reason for this research is to create a new algorithm based on SLM that can work without its disadvantages.
AB - Contact detection algorithms based on a Common Plane (CP) are among the most used and investigated, despite not being the most optimal when generating a CP and thus detecting the existence of contact between particles. The generation of the CP is quite expensive in computational terms, for which some algorithms seek to check a possibility of contact between them quickly; and then verify it. For these cases, there are algorithms such as the Shortest Link Method (SLM) that efficiently generate a CP and quickly verify the existence of contact between particles. However, this algorithm has some shortcomings. The main reason for this research is to create a new algorithm based on SLM that can work without its disadvantages.
KW - Common Plane
KW - Contact Detection
KW - Shortest Link
UR - http://www.scopus.com/inward/record.url?scp=85141743621&partnerID=8YFLogxK
U2 - 10.1016/j.procs.2022.07.096
DO - 10.1016/j.procs.2022.07.096
M3 - Conference article
AN - SCOPUS:85141743621
SN - 1877-0509
VL - 203
SP - 655
EP - 660
JO - Procedia Computer Science
JF - Procedia Computer Science
T2 - 17th International Conference on Future Networks and Communications / 19th International Conference on Mobile Systems and Pervasive Computing / 12th International Conference on Sustainable Energy Information Technology, FNC/MobiSPC/SEIT 2022
Y2 - 9 August 2022 through 11 August 2022
ER -