An Omega(n^d) lower bound on the number of cell crossings for weighted shortest paths in d-dimensional polyhedral structures

Artikel › Journalartikel › 2022

Zitation

Bauernöppel, Frank; Maheshwari, Anil; Sack, Jörg-Rüdiger: An Omega(n^d) lower bound on the number of cell crossings for weighted shortest paths in d-dimensional polyhedral structures. In: Computational Geometry: Theory and Applications Volume 107, Issue C, Dec 2022 . (2022), S. 1-12.

ISSN

0925-7721

DOI / URN

10.1016/j.comgeo.2022.101897

Link

https://doi.org/10.1016/j.comgeo.2022.101897

Sprache

Englisch

Zitieren

BibTeX / RIS