Graph representation of n-dimensional space AITranslate
Abstract AITranslate
This paper investigates how graph representation can be created for the mesh which is a discrete approximation of n-dimensional continuous space. The paper discusses the relationship between mesh dimensionality and the type and quantity of edges connecting each vertex with its neighbors. Basing on the analysis, a simple algorithm is also proposed to create such graph representation. The purpose of the graph is to search optimal paths and trajectories in the represented space.
KeyWords AITranslate
Basic Information:
DOI:https://doi.org/10.1007/s40436-014-0065-2
Chinese Library Classification Number:
Citation Information:
This paper investigates how graph representation can be created for the mesh which is a discrete approximation of n-dimensional continuous space. The paper discusses the relationship between mesh dimensionality and the type and quantity of edges connecting each vertex with its neighbors. Basing on the analysis, a simple algorithm is also proposed to create such graph representation. The purpose of the graph is to search optimal paths and trajectories in the represented space.
quote
| GB/T 7714-2015 | [1] Tomasz Kosicki. Advances in Manufacturing, 2014(2). DOI:10.1007/s40436-014-0065-2. |
| MLA | [1] Tomasz Kosicki. Advances in Manufacturing, no. 2, 2014, https://doi.org/10.1007/s40436-014-0065-2. |
| APA | [1] Tomasz Kosicki. (2014). Advances in Manufacturing(2). https://doi.org/10.1007/s40436-014-0065-2 |
| IEEE | [1] Tomasz Kosicki, Advances in Manufacturing, no. 2, 2014, doi: 10.1007/s40436-014-0065-2. keywords: {Trajectory optimization;Path optimization;Graph search algorithms} |
