2 papers
cs.DS2022
String Rearrangement Inequalities and a Total Order Between Primitive Words
Ruixi Luo, Taikun Zhu, Kai Jin
We study the following rearrangement problem: Given words, rearrange and concatenate them so that the obtained string is lexicographically smallest (or largest, respectively).…
cs.CG2017
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…