Committee 
Date Time 
Place 
Paper Title / Authors 
Abstract 
Paper # 
COMP 
20131221 09:30 
Okinawa 
Okinawa Industry Support Center 
An Adjustable Work Space Algorithm for Finding a Shortest Path in a Simple Polygon Matsuo Konagaya, Tetsuo Asano (JAIST), Otfried Cheong (KAIST), Sang Won Bae (Kyonggi Univ.) COMP201348 
Given a simple polygon with $n$ vertices in a plane,
we compute the shortest path between two query points using less ... [more] 
COMP201348 pp.5962 
COMP 
20131221 09:55 
Okinawa 
Okinawa Industry Support Center 
An Algorithm for Finding the Point Minimizing the Distance Error to Given Points Shigeki Nakamura, Tetsuo Asano (JAIST), SiuWing Cheng (HKUST) COMP201349 
Given $n$ points in the plane, we want to insert a new point in the distance specified by the input from each existing p... [more] 
COMP201349 pp.6368 
COMP 
20131221 10:20 
Okinawa 
Okinawa Industry Support Center 
Adjustable Work Space Algorithm of Arrangement of Lines Takahiro Seii, Tetsuo Asano (JAIST) COMP201350 
This paper presents an adjustable work space algorithm for an arrangement of lines.
An arrangement of lines is the part... [more] 
COMP201350 pp.6972 
COMP, IPSJAL 
20130518 14:25 
Hokkaido 
Otaru University of Commerce 
A New Framework for Connected Components Labeling of Binary Images Tetsuo Asano (JAIST), Sergey Bereg (Univ. of Texas at Dallas) COMP201316 
Given a binary image of $n$ pixels, assign integral
labels to all pixels so that any background pixel
has label $0$ ... [more] 
COMP201316 pp.127134 
COMP 
20120427 15:20 
Osaka 
Osaka Prefecture University 
Algorithm for Reporting All Segment Intersections Using Work Space of Arbitrary Size Matsuo Konagaya, Tetsuo Asano (JAIST) COMP20127 
This paper presents an efficient algorithm for reporting all intersections
among $n$ given line segments in the plane u... [more] 
COMP20127 pp.4552 
COMP 
20111216 17:15 
Aichi 
Nagoya Univ. 
[Invited Talk]
Research Story on Distance Trisector Curves: How was it born and developed? Tetsuo Asano (JAIST), Takeshi Tokuyama (Tohoku Univ.), Keiko Imai (Chuo Univ.), Akitoshi Kawamura (Univ. of Tokyo) COMP201146 
It is easy to draw a bisecting line for two points in the plane. Is it also easy to draw two curves between two points t... [more] 
COMP201146 p.71 
COMP 
20111021 10:00 
Miyagi 
Tohoku Univ. 
MemoryConstrained Algorithms for Shortest Path Problem Tetsuo Asano (JAIST), Benjamin Doerr (MPI) COMP201128 
This paper presents a spaceefficient algorithm for finding a shortest
path in a grid graph whose size is $\sqrt{n}\tim... [more] 
COMP201128 pp.15 
COMP 
20110511 16:00 
Nagano 
Shinshu Univ. 
[Invited Talk]
MemoryConstrained Algorithms: From Design Techniques to Applications Tetsuo Asano (JAIST) 
[more] 

COMP 
20110309 15:10 
Tokyo 
Chuo Univ. 
Recognition of Basic Planar Objects Using Computational Geometry Methods Yoshihiro Hirashiki, Tetsuo Asano (JAIST) COMP201052 
Making computers recognize a planar object exactly is useful in developing of factory products. Positioning problem in f... [more] 
COMP201052 pp.3744 
COMP 
20101015 09:30 
Miyagi 
Tohoku Univ. 
ConstantWorkSpace Algorithms for Geometric Problems(1) Tetsuo Asano (JAIST), Wolfgang Mulzer (Princeton Univ.), Gunter Rote (Free Univ.), Yajun Wang (Microsoft) COMP201031 
We present spaceefficient algorithms for geometric
problems in a restricted computational model called ``constant wo... [more] 
COMP201031 pp.17 
COMP 
20101015 10:05 
Miyagi 
Tohoku Univ. 
ConstantWorkSpace Algorithms for Geometric Problems(2) Tetsuo Asano (JAIST), Wolfgang Mulzer (Princeton Univ.), Gunter Rote (Free Univ.), Yajun Wang (Microsoft) COMP201032 
We present spaceefficient algorithms for geometric problems in a restricted computational model called ``constant wor... [more] 
COMP201032 pp.915 
COMP 
20100929 11:10 
Niigata 
Nagaoka Univ. of Tech. 
Inplace algorithm for Erasing a Component in a Binary Image Tetsuo Asano (JAIST) COMP201026 
Removing noises in a given binary image is one of common
operations. A generalization of the operation is to erase
an... [more] 
COMP201026 pp.1723 
COMP 
20100625 16:00 
Tokyo 
Tokyo Tech 
A Constant Work Space Algorithm for Finding Nearest Larger Neighbors Tetsuo Asano (JAIST), Sergey Bereg (Univ. of Texas at Dallas), David Kirkpatrick (Univ. of British Columbia) COMP201022 
In this report we consider a problem of finding nearest
larger elements using only constant work space in addition
to ... [more] 
COMP201022 pp.4552 
COMP, IPSJAL 
20100519 15:05 
Ishikawa 
Japan Advanced Institute of Science and Technology 
Binary Image Processing with Limited Storage Tetsuo Asano (JAIST), Sergey Bereg (Univ. of Texas at Dallas, USA), Lilian Buzer (Univ. ParisEst/LABINFOIGM), David Kirkpatrick (Univ. of British Columbia) COMP201012 
Removing noises in a given binary image is one of common
operations. A generalization of the operation is to erase
an... [more] 
COMP201012 pp.3138 
PRMU, IE, MI 
20100514 10:15 
Aichi 
Chubu Univ. 
Detecting retinal layers and optic nerve head structure using optical coherence tomography images
 Automatic measurement of RNFL thickness and C/D ratio  Makoto Shohara, Tetsuo Asano (JAIST) IE201033 PRMU201021 MI201021 
The optical coherence tomography (OCT) is widely used for the diagnosis of the glaucoma recently. It is important to mea... [more] 
IE201033 PRMU201021 MI201021 pp.109113 
COMP 
20100312 11:00 
Tokyo 
National Institute of Informatics 
Deterministic ConstantWorkSpace Algorithms for two dimensional Linear Programming Tetsuo Asano (JAIST), Danny Chen (Univ. of Notre Dame), Takeshi Tokuyama (Tohoku Univ.) COMP200952 
[more] 
COMP200952 pp.1924 
COMP 
20080616 09:45 
Ishikawa 
JAIST 
Online Uniformity of Integer Points on a Line Tetsuo Asano (JAIST) COMP200815 
[more] 
COMP200815 pp.16 
COMP 
20080616 14:35 
Ishikawa 
JAIST 
ConstantWorkingSpace Image Scan with a Given Angle Tetsuo Asano (JAIST) COMP200819 
[more] 
COMP200819 pp.3136 
COMP 
20080418 10:00 
Osaka 
Osaka Prefecture University 
ConstantWorking Space Algorithm for Connected Components Labeling Tetsuo Asano, Hiroshi Tanaka (JAIST) COMP20081 
Connected components labeling of a binary image is one of the
most fundamental operations in image processing. This pa... [more] 
COMP20081 pp.18 
COMP 
20080418 10:35 
Osaka 
Osaka Prefecture University 
ConstantWorkingSpace Algorithm for Euclidean Distance Transform Tetsuo Asano, Hiroshi Tanaka (JAIST) COMP20082 
Given a binary image, Euclidean distance transform is to compute for each
pixel the Euclidean distance to the closest ... [more] 
COMP20082 pp.914 