An Efficient Algorithm for Shortest Path in Three Dimensions with Polyhedral Obstacles | NobleID

Main

Mint Work Search Explore Works Knowledge Graph Citation Graph Bibliometrics Receipts

v1

An Efficient Algorithm for Shortest Path in Three Dimensions with Polyhedral Obstacles

NobleID: NI5P75W42R67S43
Persistent link: https://nobleid.org/ark:/48914/w1/20260515/FDACA479

Type:Conference Paper

0 views

Support unavailableClaim Your Authorship

Embeddable Badge

[![NobleID](https://www.nobleid.org/api/badge/FDACA479.svg?ark=w1%2F20260515%2FFDACA479&value=id)](https://nobleid.org/work/w1/20260515/FDACA479)

ARK Inflections

Metadata Policy

Metadata Formats

Bibliometric Analysis

Impact metrics, research fronts, co-authorship networks →

Authors & Claims

Paper Authors

Claim authorship of this work

info@nobleid.org

About FAQ Terms Policy Persistence & Resolver Service Policy