This problem may be generalized to a more challenging case: the N-D convex hull.
Make the vector [1 2 3 4 5 6 7 8 9 10]
Given two arrays, find the maximum overlap
How many trades represent all the profit?
MatCAT - Reconstruct X from Its X-rays
Beads on a Necklace (Convex Hulls)
Stuff the Board
Twins in a Window
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