A convex polygon as a discrete plane curve.
A survey of Sylvester's problem and its generalizations.
A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets.
An Upper Bound for the Minimum Diameter of Integral Point Sets.
Another abstraction of the Erdős-Szekeres happy end theorem.
Answer to one of Fishburn's questions: ``Isosceles planar subsets'' [Discrete Comput. Geom. 19 (1998), no. 3, 391--398]
Our short note gives the affirmative answer to one of Fishburn’s questions.