On triangulations of the convex hull of n points

DOI10.1007/BF02579380zbMath0571.52002MaRDI QIDQ1062014

Ernst Gabor Straus, Bruce L. Rothschild

Publication date: 1985

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

triangulations of the convex hull of n points

Mathematics Subject Classification ID

Inequalities and extremum problems involving convexity in convex geometry (52A40) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Euclidean geometries (general) and generalizations (51M05)

Related Items (7)

Tetrahedrizing point sets in three dimensions ⋮ Bracketing numbers of convex and \(m\)-monotone functions on polytopes ⋮ Entropy of convex functions on \(\mathbb R^d\) ⋮ Empty monochromatic simplices ⋮ Ernst G. Straus (1922-1983) ⋮ A polytopal generalization of Sperner's lemma ⋮ Linear algorithm to find the largest intriangles of a planar convex polygon

Cites Work

• Unnamed Item
• On Heilbronn's Triangle Problem
• A Lower Bound for Heilbronn'S Problem
• The Upper Bound Conjecture and Cohen-Macaulay Rings
• A Characterization of Convex Surfaces Which are L-Sets
• On a problem in combinatorial geometry

This page was built for publication: On triangulations of the convex hull of n points