Counting carambolas

From MaRDI portal




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 emph{convex polygons}, emph{star-shaped polygons} and emph{monotone paths}. We also consider related problems for emph{directed} planar straight-line graphs.









This page was built for publication: Counting carambolas

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293619)