IEICE Technical Committee Submission System
Conference Paper's Information
Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2013-12-21 09:30
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.) COMP2013-48
Abstract (in Japanese) (See Japanese page) 
(in English) Given a simple polygon with $n$ vertices in a plane,
we compute the shortest path between two query points using less work space.
To solve the problem, in this paper,
we present an algorithm using only $O(s)$ work space, where $s$ is a parameter of the
size of the work space between $Omega(1)$ and $O(n)$.
Once the algorithm preprocesses an input of a simple polygon in $O(nlog n)$ time,
it can be compute with any size of the work space and can speed up as $s$ gets more work space.
Keyword (in Japanese) (See Japanese page) 
(in English) computational geometry / shortest path / adjustable work space / / / / /  
Reference Info. IEICE Tech. Rep., vol. 113, no. 371, COMP2013-48, pp. 59-62, Dec. 2013.
Paper # COMP2013-48 
Date of Issue 2013-12-13 (COMP) 
ISSN Print edition: ISSN 0913-5685    Online edition: ISSN 2432-6380
Copyright
and
reproduction
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF COMP2013-48

Conference Information
Committee COMP  
Conference Date 2013-12-20 - 2013-12-21 
Place (in Japanese) (See Japanese page) 
Place (in English) Okinawa Industry Support Center 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2013-12-COMP 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) An Adjustable Work Space Algorithm for Finding a Shortest Path in a Simple Polygon 
Sub Title (in English)  
Keyword(1) computational geometry  
Keyword(2) shortest path  
Keyword(3) adjustable work space  
Keyword(4)  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Matsuo Konagaya  
1st Author's Affiliation Japan Advanced Institute of Science and Technology (JAIST)
2nd Author's Name Tetsuo Asano  
2nd Author's Affiliation Japan Advanced Institute of Science and Technology (JAIST)
3rd Author's Name Otfried Cheong  
3rd Author's Affiliation Korea Advanced Institute of Science and Technology (KAIST)
4th Author's Name Sang Won Bae  
4th Author's Affiliation Kyonggi University (Kyonggi Univ.)
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
Speaker Author-1 
Date Time 2013-12-21 09:30:00 
Presentation Time 25 minutes 
Registration for COMP 
Paper # COMP2013-48 
Volume (vol) vol.113 
Number (no) no.371 
Page pp.59-62 
#Pages
Date of Issue 2013-12-13 (COMP) 


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan