liveBook · Manning

Convex hull

A convex hull is the smallest convex set containing a given set of points or geometric objects.

How 5 Manning books explain it

Optimization Algorithms: AI techniques for design, planning, and control problems

The convex hull problem is the computational problem of finding the smallest convex boundary containing a given set of points.

How it is used
Frames convex hull as a sequential combinatorial optimization task whose output selects points from a variable-length input.
How deep it goes
Explains geometric validity and a pointer-network implementation, including training and evaluation, but does not derive a classical geometric algorithm.
Examples
Uses rubber-band intuition, random two-dimensional datasets, index sequences, SciPy comparisons, and predicted-versus-true hull visualizations.
What you can do after
Apply it via PyTorch and SciPy by training, testing, visualizing, and measuring a pointer-network hull predictor.

Read how Optimization Algorithms: AI techniques for design, planning, and control problems explains convex hull →

Build AI Drug Discovery Pipelines

A convex hull is the smallest convex region containing a specified set of points.

How it is used
Assesses whether molecules lie within a model’s reliable applicability domain.
How deep it goes
Defines the enclosing convex region and explains dimensionality, empty-region, and inherited reliability limitations.
Examples
Contrasts convex-hull and bounding-box regions for descriptor-based solubility models.
What you can do after
Evaluate whether a molecule lies inside a descriptor-space applicability domain while recognizing the method’s limits.

Read how Build AI Drug Discovery Pipelines explains convex hull →

Advanced Algorithms and Data Structures

A convex hull is the smallest convex set containing a given set or geometric shape.

How it is used
Uses convex-hull overlap as an early filter for Bézier-curve intersection testing.
How deep it goes
Defines the hull and outlines recursive subdivision, but defers detailed Bézier clipping and formal derivations.
Examples
Uses quadratic and cubic Bézier curves whose control points define polygons for overlap comparison.
What you can do after
Apply Bézier subdivision to reject nonintersecting curves and reduce remaining cases to segment tests.

Read how Advanced Algorithms and Data Structures explains convex hull →

Sutskever's List

A convex hull is the smallest convex set containing a given set of points.

How it is used
Uses hull selection as a combinatorial task for comparing sequence-model architectures.
How deep it goes
Defines the point-selection task and its scaling challenge but does not explain geometric construction algorithms.
Examples
Compares model results on 50-point inputs and Pointer Network performance on 500-point tests.
What you can do after
Evaluate architecture performance using exact accuracy and geometric area measures.

Read how Sutskever's List explains convex hull →

Outlier Detection in Python

An iterative outlier-detection method that assigns scores according to the successive layers of a convex hull around the data points.

How it is used
Detects global outliers by repeatedly removing boundary points from a small-feature, single-cluster dataset.
How deep it goes
Explains iterative peeling, scoring, stopping, robustness, runtime, and dimensionality limits without deriving hull geometry.
Examples
Uses successive hull-layer figures and contrasts suitable single-cluster data with unsuitable multi-cluster data.
What you can do after
Apply it via SciPy's ConvexHull implementation to score boundary layers and select a preset number of outliers.

Read how Outlier Detection in Python explains convex hull →

What to know first

Related concepts

Questions about convex hull

What is convex hull?

A convex hull is the smallest convex set containing a given set of points or geometric objects.

Which Manning books explain convex hull?

Optimization Algorithms: AI techniques for design, planning, and control problems, Build AI Drug Discovery Pipelines, Advanced Algorithms and Data Structures, Sutskever's List and Outlier Detection in Python.

What should I know before learning convex hull?

Manning books that teach convex hull usually introduce LSTM first.

What is the difference between convex hull and bounding box method?

A convex hull is the smallest convex set containing a given set of points or geometric objects. The bounding box method defines a region by independently bounded minimum and maximum values along each descriptor dimension.

These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.