Jun-ya Takahashi

According to our database, Jun-ya Takahashi authored at least 5 papers between 1992 and 1999.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

1999

Simple cellular automaton-based simulation of ink behaviour and its application to Suibokuga-like 3D rendering of trees.

Qing Zhang, Youetsu Sato, Jun-ya Takahashi, Kazunobu Muraoka, Norishige Chiba

Comput. Animat. Virtual Worlds, 1999

1997

Shortest Non-Crossing Rectilinear Paths in Plane Regions.

Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki

Int. J. Comput. Geom. Appl., 1997

1996

Shortest Noncrossing Paths in Plane Graphs.

Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki

Algorithmica, 1996

1993

Finding Shortest Non-Crossing Rectilinear Paths in Plane Regions.

Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki

Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

1992

Algorithms for Finding Non-Crossing Paths with Minimum Total Length in Plane Graphs.

Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki

Proceedings of the Algorithms and Computation, Third International Symposium, 1992