<p>In this work, we consider a decision problem on whether an overlapping order of all the squares of an m × n map is valid under a particular context called simple folding. This problem belongs to the field of map folding. It is a v...
Jia Yiyang   Mitani Jun   Uehara Ryuhei   
Journal of Information Processing 28(0) 806-815 2020年
<p>In this paper, we study a variation of the map folding problem. The input is a 2 × n map with a box-pleated crease pattern of size 2 × n. Precisely, viewing the crease pattern as a planar graph, its vertices and edges respectively...
Pengfei Yao   Bo Jiang   Yiyang Jia   
Proceedings of 2017 6th International Conference on Computer Science and Network Technology, ICCSNT 2017 2018-January 69-73 2018年4月
This paper focuses on studying the online strategies of evacuating problems in a gird network. First, we proved that the double strategy can work well for solving the single source point evacuating problem in the grid network, even the boundary of...
Advances in Intelligent Systems and Computing 691 308-318 2018年
In this paper, we present an algorithm to compute the minimum perimeter convex hull of a given set of disjoint segments, so that each segment is contained in the hull completely or intersects with the boundary of the hull. The problem discussed in...