Shortest path AMIDST disc obstacles is computable

Shortest path AMIDST disc obstacles is computable

International Journal of Computational Geometry and Applications

Saved in:
Bibliographic Details
Main Authors: Chang, E.-C., Choi, S.W., Kwon, D.Y., Park, H., Yap, C.K.
Other Authors: COMPUTER SCIENCE
Format: Conference or Workshop Item
Published: 2013
Subjects:
Computability
Disc obstacles
Exact geometric computation
Exponential complexity
Guaranteed precision computation
Real RAM model
Robust numerical algorithms
Shortest path
Transcendental number theory
Online Access:http://scholarbank.nus.edu.sg/handle/10635/41131
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: National University of Singapore
id sg-nus-scholar.10635-41131
record_format dspace
spelling sg-nus-scholar.10635-411312024-11-10T15:09:50Z Shortest path AMIDST disc obstacles is computable Chang, E.-C. Choi, S.W. Kwon, D.Y. Park, H. Yap, C.K. COMPUTER SCIENCE Computability Disc obstacles Exact geometric computation Exponential complexity Guaranteed precision computation Real RAM model Robust numerical algorithms Shortest path Transcendental number theory International Journal of Computational Geometry and Applications 16 5-6 567-590 2013-07-04T08:20:20Z 2013-07-04T08:20:20Z 2006 Conference Paper Chang, E.-C., Choi, S.W., Kwon, D.Y., Park, H., Yap, C.K. (2006). Shortest path AMIDST disc obstacles is computable. International Journal of Computational Geometry and Applications 16 (5-6) : 567-590. ScholarBank@NUS Repository. 02181959 http://scholarbank.nus.edu.sg/handle/10635/41131 NOT_IN_WOS Scopus
institution National University of Singapore
building NUS Library
continent Asia
country Singapore
Singapore
content_provider NUS Library
collection ScholarBank@NUS
topic Computability
Disc obstacles
Exact geometric computation
Exponential complexity
Guaranteed precision computation
Real RAM model
Robust numerical algorithms
Shortest path
Transcendental number theory
spellingShingle Computability
Disc obstacles
Exact geometric computation
Exponential complexity
Guaranteed precision computation
Real RAM model
Robust numerical algorithms
Shortest path
Transcendental number theory
Chang, E.-C.
Choi, S.W.
Kwon, D.Y.
Park, H.
Yap, C.K.
Shortest path AMIDST disc obstacles is computable
description International Journal of Computational Geometry and Applications
author2 COMPUTER SCIENCE
author_facet COMPUTER SCIENCE
Chang, E.-C.
Choi, S.W.
Kwon, D.Y.
Park, H.
Yap, C.K.
format Conference or Workshop Item
author Chang, E.-C.
Choi, S.W.
Kwon, D.Y.
Park, H.
Yap, C.K.
author_sort Chang, E.-C.
title Shortest path AMIDST disc obstacles is computable
title_short Shortest path AMIDST disc obstacles is computable
title_full Shortest path AMIDST disc obstacles is computable
title_fullStr Shortest path AMIDST disc obstacles is computable
title_full_unstemmed Shortest path AMIDST disc obstacles is computable
title_sort shortest path amidst disc obstacles is computable
publishDate 2013
url http://scholarbank.nus.edu.sg/handle/10635/41131
_version_ 1821184646944129024

Similar Items