Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
COMP, IPSJ-AL |
2017-05-13 14:30 |
Nagasaki |
|
Automatic Drawing for Metro Maps in Tokyo Masahiro Onda, Masaki Moriguchi, Keiko Imai (Chuo Univ.) COMP2017-10 |
Metro maps are useful tools for passengers of complex city transportation networks.It is hrad to draw complex metro maps... [more] |
COMP2017-10 pp.69-76 |
COMP |
2016-10-21 15:50 |
Miyagi |
Tohoku University |
On label size maximization for rotating maps Yusuke Yokosuka, Keiko Imai (Chuo Univ.) COMP2016-30 |
[more] |
COMP2016-30 pp.47-52 |
COMP |
2016-03-14 14:20 |
Fukuoka |
|
[Fellow Memorial Lecture]
Computational Geometry and its Applications to Geographic Information System Keiko Imai (Chuo Univ.) COMP2015-39 |
Geographic Information System (GIS) is one of the application areas of Computational Geometry. Maps are the most basic ... [more] |
COMP2015-39 p.21 |
COMP |
2015-12-01 16:10 |
Osaka |
|
Zometool Approximation of Non-Orientable Surfaces Koshiro Sakata, Masaki Moriguchi, Keiko Imai (Chuo Univ.) COMP2015-36 |
Zometool approximation algorithm has been presented by Zimmer et al.. Zometool is an intellectual toy building a 3D shap... [more] |
COMP2015-36 pp.29-34 |
COMP |
2014-03-10 16:05 |
Tokyo |
|
Flip-Based Computation of Reeb Graphs for Triangular Meshes Masaki Moriguchi, Keiko Imai (Chuo Univ.) COMP2013-72 |
The Reeb graph of a function defined over a triangular mesh encodes the topological evolution of the level-sets of the f... [more] |
COMP2013-72 pp.83-89 |
COMP |
2013-12-21 16:30 |
Okinawa |
Okinawa Industry Support Center |
Label Size Maximization for Square Labels on Rotating Maps Yusuke Yokosuka, Keiko Imai (Chuo Univ.) COMP2013-59 |
Map labeling is a problem of placing labels at corresponding graphical features on a map. There are two optimization pro... [more] |
COMP2013-59 pp.131-135 |
COMP, IPSJ-AL |
2013-05-18 16:30 |
Hokkaido |
Otaru University of Commerce |
Label Size Maximization for Rotating Maps Yusuke Yokosuka, Keiko Imai (Chuo Univ.) COMP2013-18 |
Map labeling is a problem of placing labels at the corresponding graphical features
in a map. There are two optimizati... [more] |
COMP2013-18 pp.157-162 |
COMP |
2011-12-16 17:15 |
Aichi |
Nagoya Univ. |
[Invited Talk]
Research Story on Distance Trisector Curves: How was it born and developed? Tetsuo Asano (JAIST), Takeshi Tokuyama (Tohoku Univ.), Keiko Imai (Chuo Univ.), Akitoshi Kawamura (Univ. of Tokyo) COMP2011-46 |
It is easy to draw a bisecting line for two points in the plane. Is it also easy to draw two curves between two points t... [more] |
COMP2011-46 p.71 |
COMP |
2010-01-25 10:55 |
Fukuoka |
Nishijin Plaza, Kyushu University |
Distance k-Sectors Exist Keiko Imai (Chuo Univ.), Akitoshi Kawamura (Univ. of Toronto.), Takeshi Tokuyama (Tohoku Univ.), Jiri Matousek (Charles Univ.), Daniel Reem (Technion - Israel Inst. of Tech.) COMP2009-41 |
The bisector of two nonempty sets P and Q in a metric space is the set of all points with equal distance to P and to Q. ... [more] |
COMP2009-41 pp.17-22 |
COMP |
2008-10-10 13:30 |
Miyagi |
Tohoku Univ. |
Computing the Tutte Polynomial of a Graph via BDD Revisited Hiroshi Imai (Univ. Tokyo), Keiko Imai (Chuo Univ.), Yoshitake Matsumoto, Sonoko Moriyama (Univ. Tokyo) COMP2008-39 |
The computation of the Tutte polynomial of a graph, even a planar one,
is \#P-complete, and yet more efficient exponent... [more] |
COMP2008-39 pp.41-46 |
COMP |
2006-06-23 15:35 |
Saitama |
Saitama Univ. |
Notes on Voronoi Diagrams for Pure Quantum States Kimikazu Kato (Nihon Unisys/Univ. of Tokyo), Mayumi Oto (Toshiba), Hiroshi Imai (Univ. of Tokyo), Keiko Imai (Chuo Univ.) |
We give a new geometric interpretation of quantum pure states. We reinterpret the structure of the space of pure states ... [more] |
COMP2006-24 pp.49-55 |
COMP |
2005-01-28 14:55 |
Aichi |
Nagoya University |
Guaranteed-Quality Anisotropic Mesh Generation for Parametric Surfaces Yusuke Yokosuka, Keiko Imai (Chuo Univ.) |
In this paper, we propose a method of generating guaranteed-quality meshes for parametric surfaces. Some applications de... [more] |
COMP2004-69 pp.77-82 |
COMP |
2004-10-15 15:55 |
Miyagi |
Tohoku University |
An algorithm for computing the Holevo capacity of 1-qubit channel with using computational gemetry Mayumi Oto, Hiroshi Imai (Univ. of Tokyo), Keiko Imai (Chuo Univ.) |
Let a parameter space of qubits be a quantum space.
In this space, computational-geometric problems can be treated for ... [more] |
COMP2004-51 pp.55-59 |