Storing Shortest Paths for a Polyhedron

Jindong Chen, Yijie Han. Storing Shortest Paths for a Polyhedron. In Frank K. H. A. Dehne, Frantisek Fiala, Waldemar W. Koczkodaj, editors, Advances in Computing and Information - ICCI 91, International Conference on Computing and Information, Ottawa, Canada, May 27-29, 1991, Proceedings. Volume 497 of Lecture Notes in Computer Science, pages 169-180, Springer, 1991.

@inproceedings{ChenH91:3,
  title = {Storing Shortest Paths for a Polyhedron},
  author = {Jindong Chen and Yijie Han},
  year = {1991},
  researchr = {https://researchr.org/publication/ChenH91%3A3},
  cites = {0},
  citedby = {0},
  pages = {169-180},
  booktitle = {Advances in Computing and Information - ICCI 91, International Conference on Computing and Information, Ottawa, Canada, May 27-29, 1991, Proceedings},
  editor = {Frank K. H. A. Dehne and Frantisek Fiala and Waldemar W. Koczkodaj},
  volume = {497},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-54029-6},
}