TOP Page >  Profile > Display All

Lectures and Presentations
Results per page:
Chronological sort:

 

 

Tetsuo Asano President

Results 1-19 of about 19

  • 1. Algorithmic Approaches to Digital Halftoning,T. Asano,15th Canadian Conference on Computational Geometry,Halifax, Canada,August 2003
  • 2. Similarity between image and terrain: Geometric approaches to computer vision,T. Asano,19th European Workshop on Computational Geometry,Bonn, Germany,March, 2003
  • 3. 「ディジタルハーフトーニング:ネットワークフローアルゴリズムによる最適化」,浅野哲夫,加藤直樹,松井知己,永持仁,小保方幸次,徳山豪,電子情報通信学会コンピュテーション研究会,COMP2001-18, pp.41-48,6月,2001.
  • 4. Digital Halftoning: Its Computational Complexity and Approximation Algorithms based on Network Flow,T. Asano, N. Fujikawa, N. Katoh, T. Matsui, H. Nagamochi, K. Obokata, T. Tokuyama,6th Korea-Japan Joint Workshop on Algorihtms and Computation,June 28-29, 2001
  • 5. Dynamically Maintainig the Widest k-dense Corridor,S.C. Nandy, T. Asano, and T. Harayama,4th Italian Conf. on Algorithms and Complexity,March 2000 (refereed)
  • 6. A New Approximation Scheme for Digital Objects and Curve Length Estimations,T. Asano, Y. Kawamura, R. Klette, amd K. Obokata,Image and Vision Computing New Zealand 2000,2000 (refereed)
  • 7. On the Complexities of the Optimal Rounding Problems of Sequences and Matrices,T. Asano, T. Matsui, and T. Tokuyama,7th Scandinavian Workshop on Algorithm Theory,July 2000 (refereed)
  • 8. On Detecting Digital Line Components in a Binary Image,T. Asano, K. Obokata, and T. Tokuyama,5th Japan-Korea Joint Workshop on Algorithms and Computation,July 2000 (refereed)
  • 9. "A New Approximation Algorithm for the Capacitated Vehicle Routing Problems on a Tree,T. Asano, N. Katoh and K. Kawashima,ISAAC'99,December 1999 (refereed)
  • 10. Spanning trees crossing few barriers,T. Asano, M. de Berg, O. Cheong, L. J. Guibas, J. Snoeyink and H. Tamaki,Annual Symposium on Computational Geometry,June 1999 (refereed)
  • 11. Computational Complexity of the Digital Line Extraction Problem,T. Asano and Y. Kawamura,Korea-Japan Joint Workshop on Algorithms and Computation,July 1999 (refereed)
  • 12. Computational Comparison of Voting-based and Arrangement-based Schema for Digital Line Extraction,T. Asano and Y. Kawamura,11th Canadian Conf. on Computational Geometry,August 1999 (refereed)
  • 13. The Minkowski sum of a convex polyhedron and a polyhedral terrain,A. Hernandez-Barrerra, S. C. Nandy, and T. Asano,15th European Workshop on Computational Geometry,March 1999 (refereed)
  • 14. Geometric Clustering Algorithms and Related Topics,T. Asano,Japan Conf. on Discrete and Computational Geometry,Dec-98
  • 15. A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree,T. Asano, N. Katoh, and K. Kawashima,International Symposium on Algorithms and Computation,December 1999(refereed)
  • 16. Comparison of Voting-based and Arrangement-based Schema for Digital Line Detection,T. Asano and Y. Kawamura,Canadian Conference on Computational Geometry,August 1999(refereed)
  • 17. Computational Complexity of the Digital Line Extraction Problem,T. Asano and Y. Kawamura,Korea-Japan Joint Workshop on Algorithms and Computation,July 1999(refereed)
  • 18. The Minkowski sum of a convex polyhedron and a polyhedral terrain,A. Hernandez-Barrera, S.C. Nandy, and T. Asano,15th European Workshop on Computational Geometry,March 1999(refereed)
  • 19. Spanning Trees Crossing Few Barriers,T. Asano, M. de Berg, O. Cheong, L.J. Guibas, J. Snoeyink, and H. Tamaki,15th ACM Symposium on Computational Geometry,1999(refereed)