On the size of higher-dimensional triangulations

MaRDI QIDQ5290258zbMATH OpenFDO

Authors Peter Brass

Publication date 28 April 2006

Full work available at URL http://www.msri.org/communications/books/Book52/

zbMATH Keywords

minmax problemstriangulationupper and lower bounds

Mathematics Subject Classification ID

Convex sets in (3) dimensions (including convex surfaces) (52A15)

Recommendations

• On triangulations of the convex hull of n points
• On counting triangulations in d dimensions
• A tight bound for the Delaunay triangulation of points on a polyhedron
• Tetrahedrizing point sets in three dimensions
• A better upper bound on the number of triangulations of a planar point set

Cited in

(8)

• On triangulations of the convex hull of n points
• On counting triangulations in d dimensions
• Recent progress in log-concave density estimation
• Empty monochromatic simplices
• DIMENSIONS OF TRIANGLE SETS
• ON THE DIMENSION OF SIERPIŃSKI PEDAL TRIANGLES
• An Upper Bound for the d-Dimensional Analogue of Heilbronn's Triangle Problem
• Large triangles in the \(d\)-dimensional unit cube

This page was built for publication: On the size of higher-dimensional triangulations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5290258)