Convex Hull: Exploring Convex Hull in Computer Vision
About this ebook
The convex hull, convex envelope, or convex closure of a shape is the smallest convex set that contains the shape. This concept is used in the field of geometry. It is possible to define the convex hull in two different ways: either as the intersection of all convex sets that contain a particular subset of a Euclidean space, or, more precisely, as the set of all convex combinations of points that are contained within the subset. The convex hull of a bounded subset of the plane can be seen as the form that is encompassed by a rubber band that is stretched around the subset.
How you will benefit
(I) Insights, and validations about the following topics:
Chapter 1: Convex hull
Chapter 2: Convex set
Chapter 3: Polyhedron
Chapter 4: Polytope
Chapter 5: Minkowski addition
Chapter 6: Duality (mathematics)
Chapter 7: Carathéodory's theorem (convex hull)
Chapter 8: Curvilinear perspective
Chapter 9: Radon's theorem
Chapter 10: Convex polytope
(II) Answering the public top questions about convex hull.
(III) Real world examples for the usage of convex hull in many fields.
Who this book is for
Professionals, undergraduate and graduate students, enthusiasts, hobbyists, and those who want to go beyond basic knowledge or information for any kind of Convex Hull.
