Constant Storage for Storing Shortest Paths for a Polyhedron

5 pages•Published: March 21, 2024

Jindong Chen, Sraawya Chintala and Yijie Han

Abstract

We present a new scheme for storing shortest path information for a polyhedron. This scheme is obtained by applying the constant storage scheme of Han and Saxena [4] on the outward layout of Sharir and Schorr [8]. We achieve constant storage and O(log n + k) time for computing the shortest path from the source point to a query point on the polyhedron, where k is the number of polyhedron edges this shortest path passes through. This improves the result of Chen and Han [3] which uses O(n log n/d) storage and O(d log n/ log d + k) time, where d is an adjustable parameter.

Keyphrases: constant storage, polyhedron, shortest paths storing and retrieval

In: Ajay Bandi, Mohammad Hossain and Ying Jin (editors). Proceedings of 39th International Conference on Computers and Their Applications, vol 98, pages 56-60.

Links:	https://easychair.org/publications/paper/nDT9X
	https://doi.org/10.29007/65hn

BibTeX entry

@inproceedings{CATA2024:Constant_Storage_Storing_Shortest,
  author    = {Jindong Chen and Sraawya Chintala and Yijie Han},
  title     = {Constant Storage for Storing Shortest Paths for a Polyhedron},
  booktitle = {Proceedings of 39th International Conference on Computers and Their Applications},
  editor    = {Ajay Bandi and Mohammad Hossain and Ying Jin},
  series    = {EPiC Series in Computing},
  volume    = {98},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/nDT9X},
  doi       = {10.29007/65hn},
  pages     = {56-60},
  year      = {2024}}

Download PDF Open PDF in browser