Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane
Home
Publications
An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane
An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane
Authors:
SK
S. Kapoor
S. Kapoor
SM
S. N. Maheshwari
S. N. Maheshwari
JM
J. S. B. Mitchell
J. S. B. Mitchell
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Download PDF
Download
Publisher website
Google Scholar
1 December 1997
journal article
research article
Published by
Springer Nature
in
Discrete & Computational Geometry
Vol. 18
(4)
,
377-383
DOI:
10.1007/pl00009323
Abstract
No abstract available
Keywords
SHORT PATH
EFFICIENT ALGORITHM
POLYGONAL OBSTACLE
EUCLIDEAN SHORT PATH
Cited
Cited by 101 articles
Scroll to top