Opening book details…
Can I read SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS on EtoBox?
SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS by JINDONG CHEN; YIJIE HAN is a Computer Science article available to read on EtoBox.
What is SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS about?
We present an algorithm for determining the shortest path between any two points along the surface of a polyhedron which need not be convex. This algorithm also computes for any source point on the surface of a polyhedron the inward layout and the subdivision of the polyhedron which can be used for processing queries of shortest paths between the source point and any destination point. Our algorithm uses a new approach which deviates from the conventional “continuous Dijkstra” technique. Our algorithm has time complexity O(n^2^) and space complexity Θ(n).
Who reads SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- JINDONG CHEN; YIJIE HAN
- Publisher
- World Scientific Publishing Company; World Scientific ; World Scientific Publishing Co; World Scientific Pub Co Pte Lt (ISSN 0218-1959)
- Published
- 1996
- Language
- EN
- Field
- Computer Science (Physical Sciences)