( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Polyline Fitting of Planar Points Under Min-sum Criteria.

, , , , и . ISAAC, том 3341 из Lecture Notes in Computer Science, стр. 77-88. Springer, (2004)

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.

Tetsuo Morino

Tetsuo Kishimoto

Naoko Asano

Dr. Igor A Asanov

Shoh Michael Asano

 

Другие публикации лиц с тем же именем

Reporting and Counting Intersections of Lines within a Polygon.. ISAAC, том 834 из Lecture Notes in Computer Science, стр. 652-659. Springer, (1994)In-Place Algorithm for Image Rotation., , , и . ISAAC, том 4835 из Lecture Notes in Computer Science, стр. 704-715. Springer, (2007)A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree., , и . ISAAC, том 1741 из Lecture Notes in Computer Science, стр. 317-326. Springer, (1999)A Combined Radial Basis Function Model for Fingerprint Distortion., , и . ICIAR (2), том 4142 из Lecture Notes in Computer Science, стр. 286-296. Springer, (2006)Designing Algorithms with Limited Work Space.. TAMC, том 6648 из Lecture Notes in Computer Science, стр. 1. Springer, (2011)Dynamically Maintaining the Widest k -Dense Corridor., , и . CIAC, том 1767 из Lecture Notes in Computer Science, стр. 187-198. Springer, (2000)Linear Boundary and Corner Detection Using Limited Number of Sensor Rows., , и . IWCIA, том 4958 из Lecture Notes in Computer Science, стр. 250-261. Springer, (2008)Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming., , и . Int. J. Comput. Geom. Appl., 4 (1): 69-85 (1994)Visibility of Disjoint Polygons., , , , и . Algorithmica, 1 (1): 49-63 (1986)Do We Need a Stack to Erase a Component in a Binary Image?. FUN, том 6099 из Lecture Notes in Computer Science, стр. 16-27. Springer, (2010)