Memory Optimization for Convex Hull Support Point Queries
Graphics
2025-09-05 v1 Computational Geometry
Robotics
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.
Cite
@article{arxiv.2509.03753,
title = {Memory Optimization for Convex Hull Support Point Queries},
author = {Michael Greer},
journal= {arXiv preprint arXiv:2509.03753},
year = {2025}
}
Comments
6 pages, 15 figures