By submitting the following form, you agree to Club Z!'s Terms of Use and Privacy Policy
concavity
A set in R^d is concave if it does not contain all the line segments connecting any pair of its points. If the set does contain all the line segments, it is called convex.
concave polygon | connected set | convex function | convex hull | convex optimization theory | convex polygon | Delaunay triangulation | simply connected
Back to List | POWERED BY THE WOLFRAM LANGUAGE