I am sure there are other more subtle ways to go about it but this seems about as fast as I can make it for a general brute-force solution (0.11s)
This one seems to work for the large test case, too, although it is not a general solution [for size(p,1)>100 it only tests corner points].
Make a checkerboard matrix
Equal to their cube
CONVERT TAN TO SIN
Cubic Integer Constrained Solution
Create array of all Distances between two Sets of Points : No Neural Network Toolbox
USC Fall 2012 ACM : Find Largest Water Concentration
ICFP2021 Hole-In-Wall: Solve Score=0, where number of Figure Vertices = Hole Vertices + 1
USC Fall 2012 ACM Question A : Read Input File
Find the treasures in MATLAB Central and discover how the community can help you!
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office