15 citations · 22 across the 14 of their papers we have counts for
6 papers · 1 filter
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…
On 1-factorizations of Bipartite Kneser Graphs
Kai Jin
It is a challenging open problem to construct an explicit 1-factorization of the bipartite Kneser graph , which contains as vertices all -element and -element sub…
On the Turaev genus of torus knots
Kaitian Jin, Adam M. Lowrance, Eli Polston +1
The Turaev genus and dealternating number of a link are two invariants that measure how far away a link is from alternating. We determine the Turaev genus of a torus knot with five…
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…