How Does One Cut a Triangle?

DOI10.1007/978-0-387-74652-4zbMath1180.52001OpenAlexW2140929589MaRDI QIDQ5423212

Alexander Soifer

Publication date: 23 October 2007

Full work available at URL: https://doi.org/10.1007/978-0-387-74652-4

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Erd?s problems and related topics of discrete geometry (52C10) Convex sets in (2) dimensions (including convex curves) (52A10) Elementary problems in Euclidean geometries (51M04) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Inequalities and extremum problems in real or complex geometry (51M16) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to geometry (51-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to convex and discrete geometry (52-01)

Related Items (2)

An upper bound of Heilbronn number for eight points in triangles ⋮ Unnamed Item

This page was built for publication: How Does One Cut a Triangle?