New approach of a contact detection algorithm based on a Shortest Link method
Cargando...
Fecha
2022
Profesor/a Guía
Facultad/escuela
Idioma
en
Título de la revista
ISSN de la revista
Título del volumen
Editor
Elsevier
Nombre de Curso
Licencia CC
Licencia CC
Resumen
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.
Notas
Palabras clave
Contact Detection, Shortest Link, Common Plane
Citación
Procedia Computer Science, Volume 203, 2022, Pages 655-660
DOI
https://doi.org/10.1016/j.procs.2022.07.096