![]() | ![]() |
Ask others: ACM DL/Guide -
- CSB - MetaPress - Google - Bing - Yahoo
| 116 | Eishi Chiba, Tetsuo Asano, Takeshi Miura, Naoki Katoh, Ikuo Mitsuka: Collision Probability in an In-Line Machines Model. Transactions on Computational Science 13: 1-12 (2011) | |
| 93 | Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama: Voronoi Diagram with Respect to Criteria on Vision Information. ISVD 2007: 25-32 | |
| 85 | Tetsuo Asano, Hisao Tamaki, Naoki Katoh, Takeshi Tokuyama: Angular Voronoi Diagram with Applications. ISVD 2006: 18-24 | |
| 81 | Sachio Teramoto, Tetsuo Asano, Naoki Katoh, Benjamin Doerr: Inserting Points Uniformly at Every Instance. IEICE Transactions 89-D(8): 2348-2356 (2006) | |
| 78 | Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama: Polyline Fitting of Planar Points under Min-sum Criteria. Int. J. Comput. Geometry Appl. 16(2-3): 97-116 (2006) | |
| 74 | Tetsuo Asano, Mark de Berg, Otfried Cheong, Hazel Everett, Herman J. Haverkort, Naoki Katoh, Alexander Wolff: Optimal spanners for axis-aligned rectangles. Comput. Geom. 30(1): 59-77 (2005) | |
| 71 | Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama: Polyline Fitting of Planar Points Under Min-sum Criteria. ISAAC 2004: 77-88 | |
| 70 | Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama: On Geometric Structure of Global Roundings for Graphs and Range Spaces. SWAT 2004: 455-467 | |
| 69 | Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama: The structure and number of global roundings of a graph. Theor. Comput. Sci. 325(3): 425-437 (2004) | |
| 66 | Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama: The Structure and Number of Global Roundings of a Graph. COCOON 2003: 130-138 | |
| 63 | Tetsuo Asano, Naoki Katoh, Koji Obokata, Takeshi Tokuyama: Matrix Rounding under the Lp-Discrepancy Measure and Its Application to Digital Halftoning. SIAM J. Comput. 32(6): 1423-1435 (2003) | |
| 61 | Tetsuo Asano, Naoki Katoh, Koji Obokata, Takeshi Tokuyama: Matrix rounding under the Lp-discrepancy measure and its application to digital halftoning. SODA 2002: 896-904 | |
| 60 | Tetsuo Asano, Naoki Katoh, Koji Obokata, Takeshi Tokuyama: Combinatorial and Geometric Problems Related to Digital Halftoning. Theoretical Foundations of Computer Vision 2002: 58-71 | |
| 53 | Tetsuo Asano, Naoki Katoh, Takeshi Tokuyama: A unified scheme for detecting fundamental curves in binary edge images. Comput. Geom. 18(2): 73-93 (2001) | |
| 52 | Tetsuo Asano, Danny Z. Chen, Naoki Katoh, Takeshi Tokuyama: Efficient Algorithms for Optimization-Based Image Segmentation. Int. J. Comput. Geometry Appl. 11(2): 145-166 (2001) | |
| 51 | Tetsuo Asano, Naoki Katoh, Kazuhiro Kawashima: A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree. J. Comb. Optim. 5(2): 213-231 (2001) | |
| 43 | Tetsuo Asano, Naoki Katoh, Kazuhiro Kawashima: A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree. ISAAC 1999: 317-326 | |
| 38 | Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama: Convertibility among Grid Filling Curves. ISAAC 1998: 307-316 | |
| 35 | Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama: Covering Points in the Plane by k-Tours: Towards a Polynomial Time Approximation Scheme for General k. STOC 1997: 275-283 | |
| 32 | Tetsuo Asano, Danny Z. Chen, Naoki Katoh, Takeshi Tokuyama: Polynomial-Time Solutions to Image Segmentation. SODA 1996: 104-113 | |
| 30 | Tetsuo Asano, Naoki Katoh: Variants for the Hough Transform for Line Detection. Comput. Geom. 6: 231-252 (1996) | |
| 23 | Tetsuo Asano, Naoki Katoh, Takeshi Tokuyama: A Unified Scheme for Detecting Fundamental Curves in Binary Edge Images. ESA 1994: 215-226 | |
| 21 | Tetsuo Asano, Naoki Katoh: Number Theory Helps Line Detection in Digital Images. ISAAC 1993: 313-322 |
Selection of 23 from 123 records - Naoki Katoh has 84 coauthors
Last update 2012-09-10 CET by the DBLP Team —
Content released under the ODC-BY 1.0 license — See also our legal information page