Note on the number of triangulations of planar point sets
type: Item
instance of: scholarly article
title: Note on the number of triangulations of planar point sets
zbMATH Open document ID: 0920.52005
DOI: 10.1007/PL00009823
author: Raimund Seidel
published in: Combinatorica
publication date: 1999-05-18T00:00:00Z
review text: \(n\) points in the plane determine a triangulation (a maximal subset of straight line segments without intersections except possibly at end points). Using ideas about encoding triangulations in a binary string, an upper bound is given for the maximum number \(g(n)\) of different triangulations.
Mathematics Subject Classification ID: 52C10
zbMATH DE Number: 1288341
zbMATH Keywords: triangulations
zbMATH Keywords: planar point sets
reviewed by: András Recski
MaRDI profile type: Publication
full work available at URL: pl00009823
OpenAlex ID: W2089078292
description: scientific article; zbMATH DE number 1288341