en
de
BibSonomy
publication
tag
user
group
author
concept
BibTeX key
search:all
::
The blue social bookmark and publication sharing system.
sign in
home
groups
popular
posts
tags
authors
concepts
discussions
URL
DOI
TeX
publication post of
dblp
tags
(
dblp
's tags highlighted)
dblp
users
dblp
in citation format:
www
Harvard
Chicago
APA
DIN 1505
BibTeX
EndNote
all formats
Optimal Shortest Path and Minimum-Link Path Queries Between Two Convex Polygons Inside a Simple Polygonal Obstacle.
Yi-Jen Chiang
, and
Roberto Tamassia
.
Int. J. Comput. Geometry Appl.
7(1/2):85-121
(
1997
)
@article{journals/ijcga/ChiangT97, added-at = {2012-09-14T00:00:00.000+0200}, author = {Chiang, Yi-Jen and Tamassia, Roberto}, biburl = {http://www.bibsonomy.org/bibtex/24a5e5aad3f63f29dcc0bc42c0ac4457d/dblp}, ee = {http://dx.doi.org/10.1142/S0218195997000077}, interhash = {962c135fa521d6ca0e8a101ae7fd8c72}, intrahash = {4a5e5aad3f63f29dcc0bc42c0ac4457d}, journal = {Int. J. Comput. Geometry Appl.}, keywords = {dblp}, number = {1/2}, pages = {85-121}, timestamp = {2012-09-14T00:00:00.000+0200}, title = {Optimal Shortest Path and Minimum-Link Path Queries Between Two Convex Polygons Inside a Simple Polygonal Obstacle.}, url = {http://dblp.uni-trier.de/db/journals/ijcga/ijcga7.html#ChiangT97}, volume = 7, year = 1997 }
%0 Journal Article %1 journals/ijcga/ChiangT97 %A Chiang, Yi-Jen %A Tamassia, Roberto %D 1997 %J Int. J. Comput. Geometry Appl. %K %N 1/2 %P 85-121 %T Optimal Shortest Path and Minimum-Link Path Queries Between Two Convex Polygons Inside a Simple Polygonal Obstacle. %U http://dblp.uni-trier.de/db/journals/ijcga/ijcga7.html#ChiangT97 %V 7
discussion
(0)
resources (URL, PDF, ...)
URL:
http://dblp.uni-trier.de/db/journals/ijcga/ijcga7.html#ChiangT97
internal link:
?
You can use this internal link to create references to this post in your discussions. Just copy this internal link and paste it in your discussion text.
BibTeX key:
journals/ijcga/ChiangT97
BibSonomy is offered by the
KDE group
of the University of Kassel, the
DMIR group
of the University of Würzburg, and the
L3S Research Center
, Germany.
Privacy & Terms of Use
-
Contact