Given a set S of n points in the plane and a fixed angle 0 < < , we show how to find all triangles of minimum area with angle that enclose S in O(n log n) time.
Given a set of n points in the plane, we show how to compute various enclosing isosceles triangles where different parameters such as area or perimeter are optimized. We then stud...
Given a set P of n points in the plane, we wish to find a set Q P of k points for which the convex hull conv(Q) has the minimum area. We solve this, and the related problem of fi...
A Texture Atlas is an efficient color representation for 3D Paint Systems. The model to be textured is decomposed into charts homeomorphic to discs, each chart is parameterized, a...