JAIST Repository >
School of Information Science >
Articles >
Journal Articles >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10119/9513

Title: Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon
Authors: Asano, Tetsuo
Mulzer, Wolfgang
Wang, Yajun
Keywords: constant-work-space algorithm
shortest path
simple polygon
simple path in a tree
Issue Date: 2010-02-03
Publisher: Springer
Magazine name: Lecture Notes in Computer Science
Volume: 5942/2010
Start page: 9
End page: 20
DOI: 10.1007/978-3-642-11440-3_2
Abstract: We present two space-efficient algorithms. First, we show how to report a simple path between two arbitrary nodes in a given tree. Using a technique called “computing instead of storing”, we can design a naive quadratic-time algorithm for the problem using only constant work space, i.e., O(logn) bits in total for the work space, where n is the number of nodes in the tree. Then, another technique “controlled recursion” improves the time bound to O^(n 1 + ε ) for any positive constant ε. Second, we describe how to compute a shortest path between two points in a simple n-gon. Although the shortest path problem in general graphs is NL-complete, this constrained problem can be solved in quadratic time using only constant work space.
Rights: This is the author-created version of Springer, Tetsuo Asano, Wolfgang Mulzer and Yajun Wang, Lecture Notes in Computer Science, 5942/2010, 2010, 9-20. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/978-3-642-11440-3_2
URI: http://hdl.handle.net/10119/9513
Material Type: author
Appears in Collections:b10-1. 雑誌掲載論文 (Journal Articles)

Files in This Item:

File Description SizeFormat
15868-1.pdf169KbAdobe PDFView/Open

All items in DSpace are protected by copyright, with all rights reserved.


Contact : Library Information Section, Japan Advanced Institute of Science and Technology