About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Conference paper
Dihedral bounds for mesh generation in high dimensions
Abstract
We show that any set of n points in Rd has a Steiner Delaunay triangulation with O(n[d/2]) simplices, none of which has an obtuse dihedral angle. This result improves a naive bound of O(nd). No bound depending only on n is possible if we require the maximum dihedral angle to measure at most 90° - ϵ or the minimum dihedral to measure at least e.