Search the dblp DataBase
Tetsuo Asano :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Tetsuo Asano , Takao Asano Minimum Partition of Polygonal Regions into Trapezoids [Citation Graph (3, 0)][DBLP ] FOCS, 1983, pp:233-241 [Conf ] Tetsuo Asano , Danny Z. Chen , Naoki Katoh , Takeshi Tokuyama Polynomial-Time Solutions to Image Segmentation. [Citation Graph (3, 0)][DBLP ] SODA, 1996, pp:104-113 [Conf ] Tetsuo Asano , Desh Ranjan , Thomas Roos , Emo Welzl , Peter Widmayer Space-Filling Curves and Their Use in the Design of Geometric Data Structures. [Citation Graph (1, 0)][DBLP ] Theor. Comput. Sci., 1997, v:181, n:1, pp:3-15 [Journal ] Tetsuo Asano , Yasuyuki Kawamura Computational comparison of voting-based and arrangement-based schema for digital line detection. [Citation Graph (0, 0)][DBLP ] CCCG, 1999, pp:- [Conf ] Tetsuo Asano , David G. Kirkpatrick , Chee-Keng Yap Minimizing the trace length of a rod endpoint in the presence of polygonal obstacles is NP-hard. [Citation Graph (0, 0)][DBLP ] CCCG, 2003, pp:10-13 [Conf ] Tetsuo Asano , Takeshi Tokuyama Topological Walk Revisited. [Citation Graph (0, 0)][DBLP ] CCCG, 1994, pp:1-6 [Conf ] Subhas C. Nandy , Tomohiro Harayama , Tetsuo Asano Dynamically Maintaining the Widest k -Dense Corridor. [Citation Graph (0, 0)][DBLP ] CIAC, 2000, pp:187-198 [Conf ] Tetsuo Asano , Naoki Katoh , Hisao Tamaki , Takeshi Tokuyama The Structure and Number of Global Roundings of a Graph. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:130-138 [Conf ] Tetsuo Asano , Mark de Berg , Otfried Cheong , Leonidas J. Guibas , Jack Snoeyink , Hisao Tamaki Spanning Trees Crossing Few Barriers. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1999, pp:41-48 [Conf ] Tetsuo Asano , Binay K. Bhattacharya , Mark Keil , F. Frances Yao Clustering Algorithms Based on Minimum and Maximum Spanning Trees. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1988, pp:252-257 [Conf ] Tetsuo Asano , Leonidas J. Guibas , Takeshi Tokuyama Walking on an Arrangement Topologically. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1991, pp:297-306 [Conf ] Tetsuo Asano , David G. Kirkpatrick , Chee-Keng Yap Pseudo approximation algorithms, with applications to optimal motion planning. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2002, pp:170-178 [Conf ] Tetsuo Asano , David G. Kirkpatrick , Chee-Keng Yap d 1 -Optimal Motion for a Rod (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:252-263 [Conf ] Tetsuo Asano , Naoki Katoh , Takeshi Tokuyama A Unified Scheme for Detecting Fundamental Curves in Binary Edge Images. [Citation Graph (0, 0)][DBLP ] ESA, 1994, pp:215-226 [Conf ] Takao Asano , Tetsuo Asano , Leonidas J. Guibas , John Hershberger , Hiroshi Imai Visibility-Polygon Search and Euclidean Shortest Paths [Citation Graph (0, 0)][DBLP ] FOCS, 1985, pp:155-164 [Conf ] Mitsuo Kurachi , Y. Matsui , Tetsuo Asano Network Planning for a Common Use Computer Communication Network. [Citation Graph (0, 0)][DBLP ] ICCC, 1976, pp:379-382 [Conf ] Tetsuo Asano , Peter Braß , Shinji Sasahara Disc Covering Problem with Application to Digital Halftoning. [Citation Graph (0, 0)][DBLP ] ICCSA (3), 2004, pp:11-21 [Conf ] Xuefeng Liang , Tetsuo Asano , Hui Zhang A Combined Radial Basis Function Model for Fingerprint Distortion. [Citation Graph (0, 0)][DBLP ] ICIAR (2), 2006, pp:286-296 [Conf ] Xuefeng Liang , Tetsuo Asano Fingerprint Matching Using Minutia Polygons. [Citation Graph (0, 0)][DBLP ] ICPR (1), 2006, pp:1046-1049 [Conf ] Naoyoshi Kanamaru , Takao Nishizeki , Tetsuo Asano Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming. [Citation Graph (0, 0)][DBLP ] IPCO, 1992, pp:61-71 [Conf ] Tetsuo Asano , Takeshi Tokuyama Circuit Partitioning Algorithms: Graph Model versus Geometry Model. [Citation Graph (0, 0)][DBLP ] ISA, 1991, pp:94-103 [Conf ] Tetsuo Asano , Takeshi Tokuyama How to Color a Checkerboard with a Given Distribution - Matrix Rounding Achieving Low 2×2-Discrepancy. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:636-648 [Conf ] Boris Aronov , Tetsuo Asano , Naoki Katoh , Kurt Mehlhorn , Takeshi Tokuyama Polyline Fitting of Planar Points Under Min-sum Criteria. [Citation Graph (0, 0)][DBLP ] ISAAC, 2004, pp:77-88 [Conf ] Boris Aronov , Tetsuo Asano , Yosuke Kikuchi , Subhas C. Nandy , Shinji Sasahara , Takeaki Uno A Generalization of Magic Squares with Applications to Digital Halftoning. [Citation Graph (0, 0)][DBLP ] ISAAC, 2004, pp:89-100 [Conf ] Tetsuo Asano Reporting and Counting Intersections of Lines within a Polygon. [Citation Graph (0, 0)][DBLP ] ISAAC, 1994, pp:652-659 [Conf ] Tetsuo Asano , Hiro Ito , Souichi Kimura , Shigeaki Shimazu Repairing Flaws in a Picture Based on a Geometric Representation of a Digital Image. [Citation Graph (0, 0)][DBLP ] ISAAC, 1998, pp:149-158 [Conf ] Tetsuo Asano , Naoki Katoh Number Theory Helps Line Detection in Digital Images. [Citation Graph (0, 0)][DBLP ] ISAAC, 1993, pp:313-322 [Conf ] Tetsuo Asano , Naoki Katoh , Kazuhiro Kawashima A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree. [Citation Graph (0, 0)][DBLP ] ISAAC, 1999, pp:317-326 [Conf ] Tetsuo Asano , Naoki Katoh , Hisao Tamaki , Takeshi Tokuyama Convertibility among Grid Filling Curves. [Citation Graph (0, 0)][DBLP ] ISAAC, 1998, pp:307-316 [Conf ] Xuefeng Liang , Arijit Bishnu , Tetsuo Asano A Near-Linear Time Algorithm for Binarization of Fingerprint Images Using Distance Transform. [Citation Graph (0, 0)][DBLP ] IWCIA, 2004, pp:197-208 [Conf ] Tetsuo Asano , Yasuyuki Kawamura , Reinhard Klette , Koji Obokata Minimum-Length Polygons in Approximation Sausages. [Citation Graph (0, 0)][DBLP ] IWVF, 2001, pp:103-112 [Conf ] Tetsuo Asano Effective Use of Geometric Properties for Clustering. [Citation Graph (0, 0)][DBLP ] JCDCG, 1998, pp:30-46 [Conf ] Tetsuo Asano , Desh Ranjan , Thomas Roos , Emo Welzl , Peter Widmayer Space Filling Curves and Their Use in the Design of Geometric Data Structures. [Citation Graph (0, 0)][DBLP ] LATIN, 1995, pp:36-48 [Conf ] Tetsuo Asano , Hiroshi Umeo Systolic Algorithms for Computing the Visibility Polygon and Triangulation of A Polygonal Region. [Citation Graph (0, 0)][DBLP ] Parallel Algorithms and Architectures, 1987, pp:77-85 [Conf ] Tetsuo Asano , Takeshi Tokuyama Algorithms for Projecting Points to Give the Most Uniform Distribution with Applications to Hashing. [Citation Graph (0, 0)][DBLP ] SIGAL International Symposium on Algorithms, 1990, pp:300-309 [Conf ] Tetsuo Asano , Naoki Katoh , Koji Obokata , Takeshi Tokuyama Matrix rounding under the Lp-discrepancy measure and its application to digital halftoning. [Citation Graph (0, 0)][DBLP ] SODA, 2002, pp:896-904 [Conf ] 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 . [Citation Graph (0, 0)][DBLP ] STOC, 1997, pp:275-283 [Conf ] Tetsuo Asano , Jirí Matousek , Takeshi Tokuyama The distance trisector curve. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:336-343 [Conf ] Tetsuo Asano , Naoki Katoh , Hisao Tamaki , Takeshi Tokuyama On Geometric Structure of Global Roundings for Graphs and Range Spaces. [Citation Graph (0, 0)][DBLP ] SWAT, 2004, pp:455-467 [Conf ] Tetsuo Asano , Tomomi Matsui , Takeshi Tokuyama On the Complexities of the Optimal Rounding Problems of Sequences and Matrices. [Citation Graph (0, 0)][DBLP ] SWAT, 2000, pp:476-489 [Conf ] Tetsuo Asano , Naoki Katoh , Koji Obokata , Takeshi Tokuyama Combinatorial and Geometric Problems Related to Digital Halftoning. [Citation Graph (0, 0)][DBLP ] Theoretical Foundations of Computer Vision, 2002, pp:58-71 [Conf ] Takao Asano , Tetsuo Asano , Leonidas J. Guibas , John Hershberger , Hiroshi Imai Visibility of Disjoint Polygons. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1986, v:1, n:1, pp:49-63 [Journal ] Tetsuo Asano , Takeshi Tokuyama Algorithms for Projecting Points To Give the Most Uniform Distribution with Applications to Hashing. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1993, v:9, n:6, pp:572-590 [Journal ] Tetsuo Asano , Mark de Berg , Otfried Cheong , Hazel Everett , Herman J. Haverkort , Naoki Katoh , Alexander Wolff Optimal spanners for axis-aligned rectangles. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 2005, v:30, n:1, pp:59-77 [Journal ] Tetsuo Asano , Antonio Hernández-Barrera , Subhas C. Nandy Translating a convex polyhedron over monotone polyhedra. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 2002, v:23, n:3, pp:257-269 [Journal ] Tetsuo Asano , Naoki Katoh Variants for the Hough Transform for Line Detection. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1996, v:6, n:, pp:231-252 [Journal ] Tetsuo Asano , Naoki Katoh , Takeshi Tokuyama A unified scheme for detecting fundamental curves in binary edge images. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 2001, v:18, n:2, pp:73-93 [Journal ] Subhas C. Nandy , Tetsuo Asano , Tomohiro Harayama Shattering a set of objects in 2D. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2002, v:122, n:1-3, pp:183-194 [Journal ] Tetsuo Asano , Mark de Berg , Otfried Cheong , Leonidas J. Guibas , Jack Snoeyink , Hisao Tamaki Spanning Trees Crossing Few Barriers. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 2003, v:30, n:4, pp:591-606 [Journal ] Tetsuo Asano , David G. Kirkpatrick , Chee-Keng Yap Pseudo Approximation Algorithms with Applications to Optimal Motion Planning. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 2004, v:31, n:1, pp:139-171 [Journal ] Boris Aronov , Tetsuo Asano , Naoki Katoh , Kurt Mehlhorn , Takeshi Tokuyama Polyline Fitting of Planar Points under Min-sum Criteria. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 2006, v:16, n:2-3, pp:97-116 [Journal ] Tetsuo Asano , Danny Z. Chen , Naoki Katoh , Takeshi Tokuyama Efficient Algorithms for Optimization-Based Image Segmentation. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 2001, v:11, n:2, pp:145-166 [Journal ] Tetsuo Asano , Leonidas J. Guibas , Takeshi Tokuyama Walking on an arrangement topologically. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 1994, v:4, n:2, pp:123-151 [Journal ] Naoyoshi Kanamaru , Takao Nishizeki , Tetsuo Asano Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 1994, v:4, n:1, pp:69-85 [Journal ] Takao Asano , Tetsuo Asano , Hiroshi Imai Shortest Path Between Two Simple Polygons. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1987, v:24, n:5, pp:285-288 [Journal ] Takao Asano , Tetsuo Asano , Hiroshi Imai Partitioning a polygonal region into trapezoids. [Citation Graph (0, 0)][DBLP ] J. ACM, 1986, v:33, n:2, pp:290-312 [Journal ] Takao Asano , Tetsuo Asano , Ron Y. Pinter Polygon Triangulation: Efficiency and Minimality. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1986, v:7, n:2, pp:221-231 [Journal ] Tetsuo Asano , Naoki Katoh , Kazuhiro Kawashima A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree. [Citation Graph (0, 0)][DBLP ] J. Comb. Optim., 2001, v:5, n:2, pp:213-231 [Journal ] Tetsuo Asano , Tomomi Matsui , Takeshi Tokuyama Optimal Roundings of Sequences and Matrices. [Citation Graph (0, 0)][DBLP ] Nord. J. Comput., 2000, v:7, n:3, pp:241-0 [Journal ] Tetsuo Asano , Naokazu Yokoya Image segmentation schema for low-level computer vision. [Citation Graph (0, 0)][DBLP ] Pattern Recognition, 1981, v:14, n:1-6, pp:267-273 [Journal ] Tetsuo Asano , Yasuyuki Kawamura Algorithmic considerations on the computational complexities of digital line extraction problem. [Citation Graph (0, 0)][DBLP ] Systems and Computers in Japan, 2000, v:31, n:14, pp:29-37 [Journal ] Tetsuo Asano , Naoki Katoh , Koji Obokata , Takeshi Tokuyama Matrix Rounding under the Lp -Discrepancy Measure and Its Application to Digital Halftoning. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2003, v:32, n:6, pp:1423-1435 [Journal ] Tetsuo Asano , Tadahiro Kitahashi , Kokichi Tanaka , Hiroshi Horino , Nobutaka Amano A Wire-Routing Scheme Based on Trunk-Division Methods. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 1977, v:26, n:8, pp:764-772 [Journal ] Wayne Wei-Ming Dai , Tetsuo Asano , Ernest S. Kuh Routing Region Definition and Ordering Scheme for Building-Block Layout. [Citation Graph (0, 0)][DBLP ] IEEE Trans. on CAD of Integrated Circuits and Systems, 1985, v:4, n:3, pp:189-197 [Journal ] Tetsuo Asano , Naoki Katoh , Hisao Tamaki , Takeshi Tokuyama The structure and number of global roundings of a graph. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2004, v:325, n:3, pp:425-437 [Journal ] Subhas C. Nandy , Tomohiro Harayama , Tetsuo Asano Dynamically maintaining the widest k-dense corridor. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2001, v:255, n:1-2, pp:627-639 [Journal ] Tetsuo Asano , Prosenjit Bose , Paz Carmi , Anil Maheshwari , Chang Shu , Michiel H. M. Smid , Stefanie Wuhrer Linear-Space Algorithms for Distance Preserving Embedding. [Citation Graph (0, 0)][DBLP ] CCCG, 2007, pp:185-188 [Conf ] Tetsuo Asano , Jirí Matousek , Takeshi Tokuyama Zone diagrams: existence, uniqueness and algorithmic challenge. [Citation Graph (0, 0)][DBLP ] SODA, 2007, pp:756-765 [Conf ] Tetsuo Asano , Naoki Katoh , Hisao Tamaki , Takeshi Tokuyama Voronoi Diagram with Respect to Criteria on Vision Information. [Citation Graph (0, 0)][DBLP ] ISVD, 2007, pp:25-32 [Conf ] Hee-Kap Ahn , Helmut Alt , Tetsuo Asano , Sang Won Bae , Peter Brass , Otfried Cheong , Christian Knauer , Hyeon-Suk Na , Chan-Su Shin , Alexander Wolff Constructing Optimal Highways [Citation Graph (0, 0)][DBLP ] CoRR, 2007, v:0, n:, pp:- [Journal ] Finding Nearest Larger Neighbors. [Citation Graph (, )][DBLP ] Computational Geometric and Combinatorial Approaches to Digital Halftoning. [Citation Graph (, )][DBLP ] Constructing Optimal Highways. [Citation Graph (, )][DBLP ] Constant-Working-Space Algorithms for Geometric Problems. [Citation Graph (, )][DBLP ] Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks. [Citation Graph (, )][DBLP ] In-Place Algorithm for Image Rotation. [Citation Graph (, )][DBLP ] Optimal Triangulation with Steiner Points. [Citation Graph (, )][DBLP ] Constant-Working-Space Algorithms: How Fast Can We Solve Problems without Using Any Extra Array?. [Citation Graph (, )][DBLP ] Linear Boundary and Corner Detection Using Limited Number of Sensor Rows. [Citation Graph (, )][DBLP ] Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon. [Citation Graph (, )][DBLP ] Do We Need a Stack to Erase a Component in a Binary Image? [Citation Graph (, )][DBLP ] Kaboozle Is NP-complete, Even in a Strip. [Citation Graph (, )][DBLP ] Distance Trisector Curves in Regular Convex Distance Me. [Citation Graph (, )][DBLP ] Angular Voronoi Diagram with Applications. [Citation Graph (, )][DBLP ] Aspect-Ratio Voronoi Diagram with Applications. [Citation Graph (, )][DBLP ] Distorted Fingerprint Indexing Using Minutia Detail and Delaunay Triangle. [Citation Graph (, )][DBLP ] Constant-Working-Space Algorithms for Image Processing. [Citation Graph (, )][DBLP ] Editorial. [Citation Graph (, )][DBLP ] A linear-space algorithm for distance preserving graph embedding. [Citation Graph (, )][DBLP ] Some theoretical challenges in digital geometry: A perspective. [Citation Graph (, )][DBLP ] Search in 0.013secs, Finished in 0.019secs