Change search
ReferencesLink to record
Permanent link

Direct link
On Minimal Triangulations of Products of Convex Polygons
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Mathematics (Div.).
2009 (English)In: Discrete & Computational Geometry, ISSN 0179-5376, E-ISSN 1432-0444, Vol. 41, no 2, 328-347 p.Article in journal (Refereed) Published
Abstract [en]

We give new lower bounds for the minimal number of simplices needed in a triangulation of the product of two convex polygons, improving the lower bounds in Bowen et al. (Topology 44:321-339, 2005).

Place, publisher, year, edition, pages
2009. Vol. 41, no 2, 328-347 p.
Keyword [en]
Minimal triangulations, Convex polytopes
URN: urn:nbn:se:kth:diva-18125DOI: 10.1007/s00454-008-9087-5ISI: 000262696300011ScopusID: 2-s2.0-65049086680OAI: diva2:336171
QC 20100525Available from: 2010-08-05 Created: 2010-08-05 Last updated: 2010-12-15Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Bucher-Karlsson, Michelle
By organisation
Mathematics (Div.)
In the same journal
Discrete & Computational Geometry

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 14 hits
ReferencesLink to record
Permanent link

Direct link