Inserting Points Uniformly at Every Instance (2008)
Sachio Teramoto, Tetsuo Asano, Benjamin Doerr, Naoki Katoh
Abstract. A problem of arranging n points as uniformly as possible, which is equivalent to that of packing n equal and non-overlapping circles in a unit square, is frequently asked. In this paper we...
Computational Complexity of a Pop-up Book ∗ (2008)
Ryuhei Uehara, Sachio Teramoto
Origami is the centuries-old art of folding paper, and recently, it is investigated as computer science: Given an origami with creases, the problem to determine if it can be flat after folding all...
Longest Path Problems on Ptolemaic Graphs (2008)
TAKAHARA, Yoshihiro, TERAMOTO, Sachio, UEHARA, Ryuhei
Longest path problem is a problem for finding a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigated, there...
Inserting Points Uniformly at Every Instance (2006)
TERAMOTO, Sachio, ASANO, Tetsuo, KATOH, Naoki, DOERR, Benjamin
Arranging n points as uniformly as possible is a frequently occurring problem. It is equivalent to packing n equal and non-overlapping circles in a unit square. In this paper we generalize this...
Voronoi game on graphs and its complexity (2006)
Sachio Teramoto, Erik Demaine, Ryuhei Uehara
Abstract. The Voronoi game is a two-person game which is a model for a competitive facility location. The game is done on a continuous domain, and only two special cases (1-dimensional case and...
Inserting points uniformly at every instance (2006)
Teramoto, Sachio, Asano, Tetsuo, Katoh, Naoki, Doerr, Benjamin
Inserting Points Uniformly at Every Instance (2006)
Teramoto, Sachio, Asano, Tetsuo, Katoh, Naoki, Doerr, Benjamin
Arranging n points as uniformly as possible is a frequently occurring problem. It is equivalent to packing n equal and non-overlapping circles in a unit square. In this paper we generalize this...
Inserting Points Uniformly at Every Instance (2006)
TERAMOTO, Sachio, ASANO, Tetsuo, KATOH, Naoki, DOERR, Benjamin
Arranging n points as uniformly as possible is a frequently occurring problem. It is equivalent to packing n equal and non-overlapping circles in a unit square. In this paper we generalize this...