| Paper Abstract and Keywords |
| Presentation |
2010-10-15 10:05
Constant-Work-Space Algorithms for Geometric Problems(2) Tetsuo Asano (JAIST), Wolfgang Mulzer (Princeton Univ.), Gunter Rote (Free Univ.), Yajun Wang (Microsoft) COMP2010-32 |
| Abstract |
(in Japanese) |
(See Japanese page) |
| (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~\cite{tantau}, this constrained problem can be solved in quadratic time using only constant work space. |
| Keyword |
(in Japanese) |
(See Japanese page) |
| (in English) |
constant-work-space algorithm / shortest path / simple polygon / simple path in a tree / / / / |
| Reference Info. |
IEICE Tech. Rep., vol. 110, no. 232, COMP2010-32, pp. 9-15, Oct. 2010. |
| Paper # |
COMP2010-32 |
| Date of Issue |
2010-10-08 (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 |
COMP2010-32 |
| Conference Information |
| Committee |
COMP |
| Conference Date |
2010-10-15 - 2010-10-15 |
| Place (in Japanese) |
(See Japanese page) |
| Place (in English) |
Tohoku Univ. |
| Topics (in Japanese) |
(See Japanese page) |
| Topics (in English) |
|
| Paper Information |
| Registration To |
COMP |
| Conference Code |
2010-10-COMP |
| Language |
English (Japanese title is available) |
| 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 |
| Keyword(5) |
|
| Keyword(6) |
|
| Keyword(7) |
|
| Keyword(8) |
|
| 1st Author's Name |
Tetsuo Asano |
| 1st Author's Affiliation |
JAIST (JAIST) |
| 2nd Author's Name |
Wolfgang Mulzer |
| 2nd Author's Affiliation |
Princeton University (Princeton Univ.) |
| 3rd Author's Name |
Gunter Rote |
| 3rd Author's Affiliation |
Free University (Free Univ.) |
| 4th Author's Name |
Yajun Wang |
| 4th Author's Affiliation |
Microsoft Research (Microsoft) |
| 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 |
() |
| 21st Author's Name |
|
| 21st Author's Affiliation |
() |
| 22nd Author's Name |
|
| 22nd Author's Affiliation |
() |
| 23rd Author's Name |
|
| 23rd Author's Affiliation |
() |
| 24th Author's Name |
|
| 24th Author's Affiliation |
() |
| 25th Author's Name |
|
| 25th Author's Affiliation |
() |
| 26th Author's Name |
/ / |
| 26th Author's Affiliation |
()
() |
| 27th Author's Name |
/ / |
| 27th Author's Affiliation |
()
() |
| 28th Author's Name |
/ / |
| 28th Author's Affiliation |
()
() |
| 29th Author's Name |
/ / |
| 29th Author's Affiliation |
()
() |
| 30th Author's Name |
/ / |
| 30th Author's Affiliation |
()
() |
| 31st Author's Name |
/ / |
| 31st Author's Affiliation |
()
() |
| 32nd Author's Name |
/ / |
| 32nd Author's Affiliation |
()
() |
| 33rd Author's Name |
/ / |
| 33rd Author's Affiliation |
()
() |
| 34th Author's Name |
/ / |
| 34th Author's Affiliation |
()
() |
| 35th Author's Name |
/ / |
| 35th Author's Affiliation |
()
() |
| 36th Author's Name |
/ / |
| 36th Author's Affiliation |
()
() |
| Speaker |
Author-1 |
| Date Time |
2010-10-15 10:05:00 |
| Presentation Time |
35 minutes |
| Registration for |
COMP |
| Paper # |
COMP2010-32 |
| Volume (vol) |
vol.110 |
| Number (no) |
no.232 |
| Page |
pp.9-15 |
| #Pages |
7 |
| Date of Issue |
2010-10-08 (COMP) |