On the number of empty pseudo-triangles in point sets

M.J. Kreveld, van, B. Speckmann

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

3 Citations (Scopus)

Abstract

We analyze the minimum and maximum number of empty pseudo-triangles defined by any planar point set. We consider the cases where the three convex vertices are fixed and where they are not fixed. Furthermore, the pseudo-triangles must either be star-shaped or can be arbitrary.
Original languageEnglish
Title of host publicationProceedings of the 19th Canadian Conference on Computational Geometry (CCCG 2007) 20-22 August 2007, Ottawa, Canada
PublisherThe CCCG Library
Pages37-40
ISBN (Print)978-0-7709-0520-0
Publication statusPublished - 2007
Eventconference; CCCG 2007, Ottawa, Canada; 2007-08-20; 2007-08-22 -
Duration: 20 Aug 200722 Aug 2007

Conference

Conferenceconference; CCCG 2007, Ottawa, Canada; 2007-08-20; 2007-08-22
Period20/08/0722/08/07
OtherCCCG 2007, Ottawa, Canada

Fingerprint Dive into the research topics of 'On the number of empty pseudo-triangles in point sets'. Together they form a unique fingerprint.

Cite this