Home › Geometry › The Decomposition of Figures Into Smaller Parts

The Decomposition of Figures Into Smaller Parts

by Vladimir Grigor'evich Boltyanskii

A rigorous entry point to planar combinatorial geometry

Regular price $36.25 USD
Regular price $36.25 USD Sale price $36.25 USD

Paperback New English

Delivery to your door
In stock·Dispatches in 1–2 business days
Standard shipping* from $4.35
Standard shipping transit* 5–8 business days after dispatch

Faster options are available.

Rates and delivery estimates depend on your destination and item quantity. Estimates are informational only; the final shipping method and rate are selected at checkout.

Secure checkout
American Express Apple Pay DiscoverGoogle Pay Mastercard PayPalVisa
30-day eligible returns Returns & refunds policy

AlbakiReads Editorial

A rigorous entry point to planar combinatorial geometry

Concentrating on two-dimensional problems, this compact mathematics text maps a section of combinatorial geometry through questions about constant-width figures, convexity, coverings, illumination, and geometric dissection. Its organizing problem asks how few smaller-diameter pieces are needed to partition a figure; the book develops the central theorem for both the Euclidean plane and Minkowski’s plane, then uses it as a foundation for further material. The stated restriction to the plane keeps the scope focused while preserving a rigorous treatment of the subject’s underlying ideas.

Good fit for readers who enjoy

  • High school students seeking rigorous geometry beyond standard Euclidean topics
  • Undergraduates interested in combinatorial and convex geometry
  • Mathematics readers interested in coverings, illumination, and partition problems

Themes

Combinatorial geometryConvex figuresGeometric coveringsIllumination problemsDecomposition into smaller-diameter pieces

Based on publisher information and book metadata.

Book overview

In contrast to the vast literature on Euclidean geometry as a whole, little has been published on the relatively recent developments in the field of combinatorial geometry. Boltyanskii and Gohberg's book investigates this area, which has undergone particularly rapid growth in the last thirty years. By restricting themselves to two dimensions, the authors make the book uniquely accessible to interested high school students while maintaining a high level of rigor. They discuss a variety of problems on figures of constant width, convex figures, coverings, and illumination. The book offers a thorough exposition of the problem of cutting figures into smaller pieces. The central theorem gives the minimum number of pieces into which a figure can be divided so that all the pieces are of smaller diameter than the original figure. This theorem, which serves as a basis for the rest of the material, is proved for both the Euclidean plane and Minkowski's plane.
Shipping & returnsShipping options, delivery timing, and our return policy.

In-stock items normally dispatch within 1–2 business days. The ZIP-code estimator on this page is informational only; the final shipping method, price, and availability are confirmed at checkout for your full order.

For the initial delivery estimate we use these transit windows after dispatch: Standard 5–8 business days, Expedited 2–4 business days, and Priority 1–2 business days. Holiday delays are not included.

Eligible items can be returned within 30 days in accordance with our return policy.

Customer reviews