Logo der Fakultät Logo LG Theoretische Informatik
 

Veröffentlichung

Titel:

Counting Carambolas

AutorInnen: Adrian Dumitrecu
Maarten Löffler
André Schulz
Csaba D. Tóth
Kategorie: Artikel in Zeitschriften
erschienen in: Graphs and Combinatorics, Volume 32, Issue 3, pp 923–942
Abstract:

We give upper and lower bounds on the maximum and minimum number of geometric configurations of various kinds present (as subgraphs) in a triangulation of n points in the plane. Configurations of interest include convex polygons, star-shaped polygons and monotone paths. We also consider related problems for directed planar straight-line graphs.

Download: Journal Website
BibTeX-Eintrag: @Article{DLST15, author="Dumitrescu, Adrian and L{\"o}ffler, Maarten and Schulz, Andr{\'e} and T{\'o}th, Csaba D.", title="Counting Carambolas", journal="Graphs and Combinatorics", year="2015", volume="32", number="3", pages="923--942", abstract="We give upper and lower bounds on the maximum and minimum number of geometric configurations of various kinds present (as subgraphs) in a triangulation of n points in the plane. Configurations of interest include convex polygons, star-shaped polygons and monotone paths. We also consider related problems for directed planar straight-line graphs.", issn="1435-5914", doi="10.1007/s00373-015-1621-7", url="http://dx.doi.org/10.1007/s00373-015-1621-7" }
FernUni-Logo FernUniversität in Hagen, LG Theoretische Informatik, 58084 Hagen