On triangulations of the convex hull of n points
From MaRDI portal
Publication:1062014
DOI10.1007/BF02579380zbMATH Open0571.52002MaRDI QIDQ1062014FDOQ1062014
Authors: Ernst Gabor Straus, Bruce Rothschild
Publication date: 1985
Published in: Combinatorica (Search for Journal in Brave)
Recommendations
Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Inequalities and extremum problems involving convexity in convex geometry (52A40) Euclidean geometries (general) and generalizations (51M05)
Cites Work
Cited In (23)
- Linear algorithm to find the largest intriangles of a planar convex polygon
- Empty monochromatic simplices
- Bracketing numbers of convex and \(m\)-monotone functions on polytopes
- Triangulations and a discrete Brunn-Minkowski inequality in the plane
- Tetrahedrizing point sets in three dimensions
- Constructing a polytope to approximate a convex body
- A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points
- On the volume of the convex hull of \(d+1\) segments in \({\mathbb R}^d\)
- Three convex hull theorems on triangles and circles
- Isoperimetric problems for polytopes with a given number of vertices
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the size of higher-dimensional triangulations
- On the optimal triangulation of convex hypersurfaces, whose vertices lie in ambient space
- Triangulating point sets in space
- On weighted sums of numbers of convex polygons in point sets
- Entropy of convex functions on \(\mathbb R^d\)
- Title not available (Why is that?)
- Ernst G. Straus (1922-1983)
- Title not available (Why is that?)
- Point Selections and Weak ε-Nets for Convex Hulls
- A polytopal generalization of Sperner's lemma
- Ducci iterates and similar ordering of visible points in convex regions
This page was built for publication: On triangulations of the convex hull of n points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1062014)