A drawing of a graph in the plane is called a thrackle if every pair of edges meets precisely once, either at a common vertex or at a proper crossing. Let t(n) denote the maximum ...
An open question in Exact Geometric Computation is whether there are transcendental computations that can be made “geometrically exact”. Perhaps the simplest such problem in c...
Touch screens are very convenient because one can directly point to where it is interesting. This paper presents an inexpensive technique to transform an ordinary screen into a to...
Given a convex region in the plane, and a sweep-line as a tool, what is best way to reduce the region to a single point by a sequence of sweeps? The problem of sweeping points by ...
According to a classical result of Gr¨unbaum, the transversal number τ(F) of any family F of pairwise-intersecting translates or homothets of a convex body C in Rd is bounded by...