{"ID":2875199,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2509.03753","arxiv_id":"2509.03753","title":"Memory Optimization for Convex Hull Support Point Queries","abstract":"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.","short_abstract":"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 hul...","url_abs":"https://arxiv.org/abs/2509.03753","url_pdf":"https://arxiv.org/pdf/2509.03753v1","authors":"[\"Michael Greer\"]","published":"2025-09-03T22:45:50Z","proceeding":"cs.GR","tasks":"[\"cs.GR\",\"cs.CG\",\"cs.RO\"]","methods":"[]","has_code":false}