Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

COMGEO
2004
ACM

favoriteEmaildiscussreport

110views Applied Computing» more COMGEO 2004»

A lower bound on the number of triangulations of planar point sets

13 years 4 months ago

A lower bound on the number of triangulations of planar point sets

Download www.ist.tugraz.at

We show that the number of straight-edge triangulations exhibited by any set of n points in general position in the plane is bounded from below by (2.33n). 2004 Elsevier B.V. All rights reserved.

Oswin Aichholzer, Ferran Hurtado, Marc Noy

Real-time Traffic

Applied Computing | COMGEO 2004 | Elsevier | General Position | Straight-edge Triangulations |

claim paper

Related Content

» On degrees in random triangulations of point sets

» Random triangulations of planar point sets

» An almost fourapproximation algorithm for maximum weight triangulation

» On the Number of Higher Order Delaunay Triangulations

» On the Number of PseudoTriangulations of Certain Point Sets

» The Number of Triangulations on Planar Point Sets

» Triangulations Intersect Nicely

» Degree Bounds for Constrained PseudoTriangulations

» Bounds on the maximum multiplicity of some common geometric graphs

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2004
Where	COMGEO
Authors	Oswin Aichholzer, Ferran Hurtado, Marc Noy

Comments (0)