Sciweavers

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

8

CCCG
2007

favoriteEmaildiscussreport

103views Computational Geometry» more CCCG 2007»

On the Number of Empty Pseudo-Triangles in Point Sets

13 years 5 months ago

On the Number of Empty Pseudo-Triangles in Point Sets

Download www.win.tue.nl

We analyze the minimum and maximum number of empty pseudo-triangles deﬁned by any planar point set. We consider the cases where the three convex vertices are ﬁxed and where they are not ﬁxed. Furthermore, the pseudo-triangles must either be star-shaped or can be arbitrary.

Marc J. van Kreveld, Bettina Speckmann

Real-time Traffic

CCCG 2007 | Computational Geometry | Convex Vertices | Maximum Number | Planar Point |

claim paper

Related Content

» Optimal Empty PseudoTriangles in a Point Set

» Decompositions Partitions and Coverings with Convex Polygons and PseudoTriangles

» On empty convex polygons in a planar point set

» maxcut and Containment Relations in Graphs

» Large Bichromatic Point Sets Admit Empty Monochromatic 4Gons

» Competitive Search for Longest Empty Intervals

» Analysis of approximate nearest neighbor searching with clustered point sets

» The Bichromatic Rectangle Problem in High Dimensions

» An Empirical Study of MultiPoint Constructive Search for ConstraintBased Scheduling

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2007
Where	CCCG
Authors	Marc J. van Kreveld, Bettina Speckmann

Comments (0)