Author of the publication

A Small-Space Algorithm for Removing Small Connected Components from a Binary Image.

, and . IEICE Transactions, 96-A (6): 1044-1050 (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Asano, Tetsuo
add a person with the name Asano, Tetsuo
 

Other publications of authors with the same name

Visibility of Disjoint Polygons., , , , and . Algorithmica, 1 (1): 49-63 (1986)Dynamically maintaining the widest k-dense corridor., , and . Theor. Comput. Sci., 255 (1-2): 627-639 (2001)Some theoretical challenges in digital geometry: A perspective., , and . Discrete Applied Mathematics, 157 (16): 3362-3371 (2009)Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming., , and . Int. J. Comput. Geometry Appl., 4 (1): 69-85 (1994)Translating a convex polyhedron over monotone polyhedra., , and . Comput. Geom., 23 (3): 257-269 (2002)Distance Trisector Curves in Regular Convex Distance Me., and . ISVD, page 8-17. IEEE Computer Society, (2006)A linear-space algorithm for distance preserving graph embedding., , , , , , and . Comput. Geom., 42 (4): 289-304 (2009)O(sqrt(n))-Space and Polynomial-time Algorithm for the Planar Directed Graph Reachability Problem., , , and . Electronic Colloquium on Computational Complexity (ECCC), (2014)Polyline Fitting of Planar Points under Min-sum Criteria., , , , and . Int. J. Comput. Geometry Appl., 16 (2-3): 97-116 (2006)A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree., , and . ISAAC, volume 1741 of Lecture Notes in Computer Science, page 317-326. Springer, (1999)