REVIEW 1 cited by
Approximate Convex Hulls: sketching the convex hull using curvature
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Convex hulls are fundamental objects in computational geometry. In moderate dimensions or for large numbers of vertices, computing the convex hull can be impractical due to the computational complexity of convex hull algorithms. In this article we approximate the convex hull in using a scalable algorithm which finds high curvature vertices with high probability. The algorithm is particularly effective for approximating convex hulls which have a relatively small number of extreme points.
Forward citations
Cited by 1 Pith paper
-
Into the Void: Mapping the Unseen Gaps in High Dimensional Data
Empty-space search with a Lennard-Jones potential, guided by a human-in-the-loop visual interface and a trained neural network, finds configurations that outperform random sampling in several optimization tasks.
Discussion (0). Continue with ORCID to comment.