Presentation 2010-10-15
Constant-Work-Space Algorithms for Geometric Problems (2)
Tetsuo ASANO, Wolfgang MULZER, Gunter ROTE, Yajun WANG,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We present space-efficient algorithms for geometric problems in a restricted computational model called "constant work space" or "log-space" computation. In this report we propose an efficient constant work space algorithm for finding 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.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) constant-work-space algorithm / shortest path / simple polygon / simple path in a tree
Paper # COMP2010-32
Date of Issue

Conference Information
Committee COMP
Conference Date 2010/10/8(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Constant-Work-Space Algorithms for Geometric Problems (2)
Sub Title (in English)
Keyword(1) constant-work-space algorithm
Keyword(2) shortest path
Keyword(3) simple polygon
Keyword(4) simple path in a tree
1st Author's Name Tetsuo ASANO
1st Author's Affiliation Graduate School of Information Sciences, JAIST()
2nd Author's Name Wolfgang MULZER
2nd Author's Affiliation Department of Computer Science, Princeton University
3rd Author's Name Gunter ROTE
3rd Author's Affiliation Institut fur Infomatik, Freie Universitat Berlin
4th Author's Name Yajun WANG
4th Author's Affiliation Theory Group, Microsoft Research Asia
Date 2010-10-15
Paper # COMP2010-32
Volume (vol) vol.110
Number (no) 232
Page pp.pp.-
#Pages 7
Date of Issue