New approach of a contact detection algorithm based on a Shortest Link method
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 som...
- Autores:
-
León, Roberto
Velásquez, Jaime
Gatica, Gustavo
Vargas, Ximena
Coronado, Jairo
- Tipo de recurso:
- Article of investigation
- Fecha de publicación:
- 2022
- Institución:
- Corporación Universidad de la Costa
- Repositorio:
- REDICUC - Repositorio CUC
- Idioma:
- eng
- OAI Identifier:
- oai:repositorio.cuc.edu.co:11323/10876
- Acceso en línea:
- https://hdl.handle.net/11323/10876
https://repositorio.cuc.edu.co/
- Palabra clave:
- Contact detection
Shortest kink
Common plane
- Rights
- openAccess
- License
- Atribución-NoComercial-SinDerivadas 4.0 Internacional (CC BY-NC-ND 4.0)
| Summary: | 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. |
|---|