Counting Carambolas

We give upper and lower bounds on the maximum and minimum number of certain geometric configurations hidden in a triangulation of n points in the plane. Configurations of interest include star-shaped polygons and monotone paths. We also consider related problems in directed planar straight-line graphs.

slides

Journal Article (peer-reviewed)

Conference Proceedings (peer-reviewed)

Archived Publication (not reviewed)

back to list