Memory Optimization for Convex Hull Support Point Queries
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.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Mathematical Programming Algorithms for Convex Hull Approximation with a Hyperplane Budget
We consider the following problem in computational geometry: given, in the d-dimensional real space, a set of points marked as positive and a set of points marked as negative, such that the convex hull of the positive se…
Support vector machines and Radon's theorem
A support vector machine (SVM) is an algorithm that finds a hyperplane which optimally separates labeled data points in $\mathbb{R}^n$ into positive and negative classes. The data points on the margin of this separating …
A Sketching Method for Finding the Closest Point on a Convex Hull
We develop a sketching algorithm to find the point on the convex hull of a dataset, closest to a query point outside it. Studying the convex hull of datasets can provide useful information about their geometric structure…
On the Exactness of Dantzig-Wolfe Relaxation for Rank Constrained Optimization Problems
In the rank-constrained optimization problem (RCOP), it minimizes a linear objective function over a prespecified closed rank-constrained domain set and $m$ generic two-sided linear matrix inequalities. Motivated by the …
Convex hull algorithms based on some variational models
Seeking the convex hull of an object is a very fundamental problem arising from various tasks. In this work, we propose two variational convex hull models using level set representation for 2-dimensional data. The first …