15 citations · 22 across the 14 of their papers we have counts for
4 papers · 2 filters
Linear time Minimum Area All-flush Triangles Circumscribing a Convex Polygon
Kai Jin, Zhiyi Huang
We study the problem of computing the minimum area triangle that circumscribes a given -sided convex polygon touching edge-to-edge. In other words, we compute the minimum area t…
Finding all Maximal Area Parallelograms in a Convex Polygon
Kai Jin
Polygon inclusion problems have been studied extensively in geometric optimization. In this paper, we consider the variant of computing the maximum area parallelograms (MAPs) and a…
A technique for solving the polygon inclusion problems
Kai Jin, Taikun Zhu, Ruixi Luo
We propose a technique called Rotate-and-Kill for solving the polygon inclusion and circumscribing problems. By applying this technique, we obtain time algorithms for comput…
Linear Time Approximation Schemes for Geometric Maximum Coverage
Kai Jin, Jian Li, Haitao Wang +2
We study approximation algorithms for the following geometric version of the maximum coverage problem: Let be a set of weighted points in the plane. Let repre…