Memory Optimization for Convex Hull Support Point Queries
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866916932086661120 |
|---|---|
| author | Greer, Michael |
| author_facet | Greer, Michael |
| contents | This paper evaluates several improvements to the memory layout of convex hulls to improve computation times for support point queries. The support point query is a fundamental part of common collision algorithms, and the work presented achieves a significant speedup depending on the number of vertices of the convex hull. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_03753 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Memory Optimization for Convex Hull Support Point Queries Greer, Michael Graphics Computational Geometry Robotics 68U05 I.3.5 This paper evaluates several improvements to the memory layout of convex hulls to improve computation times for support point queries. The support point query is a fundamental part of common collision algorithms, and the work presented achieves a significant speedup depending on the number of vertices of the convex hull. |
| title | Memory Optimization for Convex Hull Support Point Queries |
| topic | Graphics Computational Geometry Robotics 68U05 I.3.5 |
| url | https://arxiv.org/abs/2509.03753 |