Product
Help
Pricing
About
Jobs
Log in
Get started
Work
Add to collection
An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions
HTML
PDF
Details
Locations
Year:
2007
Type:
article
Source:
Discrete & Computational Geometry
DOI:
10.1007/s00454-007-9031-0
Authors:
Yevgeny Schreiber,
Micha Sharir
Institutions:
Tel Aviv University,
Courant Institute of Mathematical Sciences,
New York University
Language:
English
Topic:
Computational Geometry and Mesh Generation
Subfield:
Computer Graphics and Computer-Aided Design
Field:
Computer Science
Domain:
Physical Sciences
Keywords:
shortest path,
convex polytopes,
shortest path map
Open Access status:
bronze
Funders:
National Science Foundation,
Tel Aviv University
Awards:
Studies of Geometric Arrangements and their Algorithmic Applications,
Geometric Arrangements and their Algorithmic Applications
OpenAlex ID:
W2132432991
FWCI:
6.299
Cites:
42
Cited by:
59
Related to:
10