Tetsuo Asano

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2011
50Constant-Work-Space Algorithms for Geometric Problems. Tetsuo Asano, Wolfgang Mulzer, Günter Rote, Yajun Wang. JoCG (2): 46-68 (2011). Web SearchBibTeXDownload
2010
49Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks. Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente. CPM 2010, 190-201. Web SearchBibTeXDownload
48Kaboozle Is NP-complete, Even in a Strip. Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara. FUN 2010, 28-36. Web SearchBibTeXDownload
47In-Place Linear-Time Algorithms for Euclidean Distance Transform. Tetsuo Asano, Hiroshi Tanaka. Transactions on Computational Science (8): 103-113 (2010). Web SearchBibTeXDownload
46Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon. Tetsuo Asano, Wolfgang Mulzer, Yajun Wang. WALCOM 2010, 9-20. Web SearchBibTeXDownload
2009
45Finding Nearest Larger Neighbors. Tetsuo Asano, Sergey Bereg, David G. Kirkpatrick. Efficient Algorithms 2009, 249-260. Web SearchBibTeXDownload
44Guest Editor's Foreword. Sandip Das, Emden R. Gansner, Joe Kilian, Jon M. Kleinberg. Int. J. Comput. Geometry Appl. (19): 93 (2009). Web SearchBibTeXDownload
2007
43Voronoi Diagram with Respect to Criteria on Vision Information. Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama. ISVD 2007, 25-32. Web SearchBibTeXDownload
42Zone Diagrams: Existence, Uniqueness, and Algorithmic Challenge. Tetsuo Asano, Jirí Matousek, Takeshi Tokuyama. SIAM J. Comput. (37): 1182-1198 (2007). Web SearchBibTeXDownload
41Zone diagrams: existence, uniqueness and algorithmic challenge. Tetsuo Asano, Jirí Matousek, Takeshi Tokuyama. SODA 2007, 756-765. Web SearchBibTeXDownload
2006
40Polyline Fitting of Planar Points under Min-sum Criteria. Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama. Int. J. Comput. Geometry Appl. (16): 97-116 (2006). Web SearchBibTeXDownload
39Distance Trisector Curves in Regular Convex Distance Me. Tetsuo Asano, David G. Kirkpatrick. ISVD 2006, 8-17. Web SearchBibTeXDownload
38Angular Voronoi Diagram with Applications. Tetsuo Asano, Hisao Tamaki, Naoki Katoh, Takeshi Tokuyama. ISVD 2006, 18-24. Web SearchBibTeXDownload
37The distance trisector curve. Tetsuo Asano, Jirí Matousek, Takeshi Tokuyama. STOC 2006, 336-343. Web SearchBibTeXDownload
2005
36Optimal spanners for axis-aligned rectangles. Tetsuo Asano, Mark de Berg, Otfried Cheong, Hazel Everett, Herman J. Haverkort, Naoki Katoh, Alexander Wolff. Comput. Geom. (30): 59-77 (2005). Web SearchBibTeXDownload
2004
35Pseudo Approximation Algorithms with Applications to Optimal Motion Planning. Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap. Discrete & Computational Geometry (31): 139-171 (2004). Web SearchBibTeXDownload
34Polyline Fitting of Planar Points Under Min-sum Criteria. Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama. ISAAC 2004, 77-88. Web SearchBibTeXDownload
33On Geometric Structure of Global Roundings for Graphs and Range Spaces. Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama. SWAT 2004, 455-467. Web SearchBibTeXDownload
32The structure and number of global roundings of a graph. Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama. Theor. Comput. Sci. (325): 425-437 (2004). Web SearchBibTeXDownload
2003
31Minimizing the trace length of a rod endpoint in the presence of polygonal obstacles is NP-hard. Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap. CCCG 2003, 10-13. Web SearchBibTeX
30The Structure and Number of Global Roundings of a Graph. Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama. COCOON 2003, 130-138. Web SearchBibTeXDownload
29Spanning Trees Crossing Few Barriers. Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki. Discrete & Computational Geometry (30): 591-606 (2003). Web SearchBibTeXDownload
28Matrix Rounding under the Lp-Discrepancy Measure and Its Application to Digital Halftoning. Tetsuo Asano, Naoki Katoh, Koji Obokata, Takeshi Tokuyama. SIAM J. Comput. (32): 1423-1435 (2003). Web SearchBibTeXDownload
2002
27Matrix rounding under the Lp-discrepancy measure and its application to digital halftoning. Tetsuo Asano, Naoki Katoh, Koji Obokata, Takeshi Tokuyama. SODA 2002, 896-904. Web SearchBibTeXDownload
26Pseudo approximation algorithms, with applications to optimal motion planning. Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap. Symposium on Computational Geometry 2002, 170-178. Web SearchBibTeXDownload
25Combinatorial and Geometric Problems Related to Digital Halftoning. Tetsuo Asano, Naoki Katoh, Koji Obokata, Takeshi Tokuyama. Theoretical Foundations of Computer Vision 2002, 58-71. Web SearchBibTeXDownload
2001
24A unified scheme for detecting fundamental curves in binary edge images. Tetsuo Asano, Naoki Katoh, Takeshi Tokuyama. Comput. Geom. (18): 73-93 (2001). Web SearchBibTeXDownload
23Efficient Algorithms for Optimization-Based Image Segmentation. Tetsuo Asano, Danny Z. Chen, Naoki Katoh, Takeshi Tokuyama. Int. J. Comput. Geometry Appl. (11): 145-166 (2001). Web SearchBibTeX
22How to Color a Checkerboard with a Given Distribution - Matrix Rounding Achieving Low 2×2-Discrepancy. Tetsuo Asano, Takeshi Tokuyama. ISAAC 2001, 636-648. Web SearchBibTeXDownload
2000
21Optimal Roundings of Sequences and Matrices. Tetsuo Asano, Tomomi Matsui, Takeshi Tokuyama. Nord. J. Comput. (7): 241 (2000). Web SearchBibTeX
20On the Complexities of the Optimal Rounding Problems of Sequences and Matrices. Tetsuo Asano, Tomomi Matsui, Takeshi Tokuyama. SWAT 2000, 476-489. Web SearchBibTeXDownload
1999
19Spanning Trees Crossing Few Barriers. Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki. Symposium on Computational Geometry 1999, 41-48. Web SearchBibTeXDownload
1998
18Convertibility among Grid Filling Curves. Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama. ISAAC 1998, 307-316. Web SearchBibTeXDownload
1997
17Covering Points in the Plane by k-Tours: Towards a Polynomial Time Approximation Scheme for General k. Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama. STOC 1997, 275-283. Web SearchBibTeXDownload
16Space-Filling Curves and Their Use in the Design of Geometric Data Structures. Tetsuo Asano, Desh Ranjan, Thomas Roos, Emo Welzl, Peter Widmayer. Theor. Comput. Sci. (181): 3-15 (1997). Web SearchBibTeXDownload
1996
15Polynomial-Time Solutions to Image Segmentation. Tetsuo Asano, Danny Z. Chen, Naoki Katoh, Takeshi Tokuyama. SODA 1996, 104-113. Web SearchBibTeXDownload
14d1-Optimal Motion for a Rod (Extended Abstract). Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap. Symposium on Computational Geometry 1996, 252-263. Web SearchBibTeXDownload
1995
13Space Filling Curves and Their Use in the Design of Geometric Data Structures. Tetsuo Asano, Desh Ranjan, Thomas Roos, Emo Welzl, Peter Widmayer. LATIN 1995, 36-48. Web SearchBibTeXDownload
1994
12Topological Walk Revisited. Tetsuo Asano, Takeshi Tokuyama. CCCG 1994, 1-6. Web SearchBibTeX
11A Unified Scheme for Detecting Fundamental Curves in Binary Edge Images. Tetsuo Asano, Naoki Katoh, Takeshi Tokuyama. ESA 1994, 215-226. Web SearchBibTeXDownload
10Walking on an arrangement topologically. Tetsuo Asano, Leonidas J. Guibas, Takeshi Tokuyama. Int. J. Comput. Geometry Appl. (4): 123-151 (1994). Web SearchBibTeX
1993
9Algorithms for Projecting Points To Give the Most Uniform Distribution with Applications to Hashing. Tetsuo Asano, Takeshi Tokuyama. Algorithmica (9): 572-590 (1993). Web SearchBibTeXDownload
1991
8Circuit Partitioning Algorithms: Graph Model versus Geometry Model. Tetsuo Asano, Takeshi Tokuyama. ISA 1991, 94-103. Web SearchBibTeXDownload
7Walking on an Arrangement Topologically. Tetsuo Asano, Leonidas J. Guibas, Takeshi Tokuyama. Symposium on Computational Geometry 1991, 297-306. Web SearchBibTeXDownload
1990
6Algorithms for Projecting Points to Give the Most Uniform Distribution with Applications to Hashing. Tetsuo Asano, Takeshi Tokuyama. SIGAL International Symposium on Algorithms 1990, 300-309. Web SearchBibTeXDownload
1987
5Shortest Path Between Two Simple Polygons. Takao Asano, Tetsuo Asano, Hiroshi Imai. Inf. Process. Lett. (24): 285-288 (1987). Web SearchBibTeXDownload
1986
4Visibility of Disjoint Polygons. Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai. Algorithmica (1): 49-63 (1986). Web SearchBibTeXDownload
3Partitioning a polygonal region into trapezoids. Takao Asano, Tetsuo Asano, Hiroshi Imai. J. ACM (33): 290-312 (1986). Web SearchBibTeXDownload
1985
2Visibility-Polygon Search and Euclidean Shortest Paths. Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai. FOCS 1985, 155-164. Web SearchBibTeXDownload
1977
1A Wire-Routing Scheme Based on Trunk-Division Methods. Tetsuo Asano, Tadahiro Kitahashi, Kokichi Tanaka, Hiroshi Horino, Nobutaka Amano. IEEE Trans. Computers (26): 764-772 (1977). Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research