13 citations · 36 across the 28 of their papers we have counts for
12 papers · 1 filter
Disjoint axis-parallel segments without a circumscribing polygon
Rain Jiang, Kai Jiang, Minghui Jiang
We construct a family of 17 disjoint axis-parallel line segments in the plane that do not admit a circumscribing polygon.
Linking disjoint axis-parallel segments into a simple polygon is hard too
Rain Jiang, Kai Jiang, Minghui Jiang
Deciding whether a family of disjoint axis-parallel line segments in the plane can be linked into a simple polygon (or a simple polygonal chain) by adding segments between their en…
Linking disjoint segments into a simple polygon is hard
Rain Jiang, Kai Jiang, Minghui Jiang
Deciding whether a family of disjoint line segments in the plane can be linked into a simple polygon (or a simple polygonal chain) by adding segments between their endpoints is NP-…
Moving intervals for packing and covering
Rain Jiang, Kai Jiang, Minghui Jiang
We study several problems on geometric packing and covering with movement. Given a family of intervals of distinct lengths, and another interval , can we p…
On universal covers for carpenter's rule folding
Rain Jiang, Kai Jiang, Minghui Jiang
We present improved universal covers for carpenter's rule folding in the plane.
On the approximability of covering points by lines and related problems
Adrian Dumitrescu, Minghui Jiang
Given a set of points in the plane, {\sc Covering Points by Lines} is the problem of finding a minimum-cardinality set of lines such that every point is incid…