A simple and relatively efficient triangulation of then-cube

descriptionPublicationkeyboard_double_arrow_right Article 01 Sep 1991 Germany English Publisher:Springer Science and Business Media LLCJournal:Discrete & Computational Geometry, volume 6, pages 287-289 (issn: 0179-5376, eissn: 1432-0444,

Copyright policy )

Authors: Haiman, M.;

doi: 10.1007/bf02574690

A simple and relatively efficient triangulation of then-cube

- Summary
- Subjects
- Metrics

Abstract

By means of simple construction it is shown that there exists a triangulation of the n-cube with \(O(\rho^\wedge nn!)\) simplices, \(\rho <1\). This improves previous estimates.

Country

Germany

Related Organizations

Massachusetts Institute of Technology
United States
DigiZeitschriften
Germany

Keywords

510.mathematics, Analysis of algorithms and problem complexity, Combinatorial aspects of tessellation and tiling problems, Tilings in \(n\) dimensions (aspects of discrete geometry), n-cube, triangulation, Article

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	39
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%