Graph representation of n-dimensional space

• 作者: Tomasz Kosicki
• 来源期刊: 先进制造进展(英文版)
• 学科: 工学
• 关键词: 图形表示 n维空间 边缘连接 最优路径 表示空间 图表示 网状 算法
• 年，卷（期）: 2014,（1）
• 页码范围: 54-60
• 页数: 7页
• 分类号: TP391.41
• 语种: 中文

摘要

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.