Smooth Inter-Object Seams Use NiBSAnimationNode Flatten Skin Pad & Sort Bones Max Partition Bones Max Vertex Bones Force DDS Import Settings This section explains the import and export settings. Warning ( .hkx ) is a havok based animation file, not supported by the plugin. EGM File EGM files are a vertex morph animation file, most commonly used for facial animations and lip synch. Animation Animation combine vertices that contain the same x,y,z location and normal data into a single vertex. * Select this when vertex ordering is not critical, non animated objects or animated objects that use a skeleton

Smooth Inter-Object Seams Use NiBSAnimationNode Flatten Skin Pad & Sort Bones Max Partition Bones Max Vertex Bones Force DDS Import Settings This section explains the import and export settings. Warning ( .hkx ) is a havok based animation file, not supported by the plugin. EGM File EGM files are a vertex morph animation file, most commonly used for facial animations and lip synch. Animation Animation combine vertices that contain the same x,y,z location and normal data into a single vertex. * Select this when vertex ordering is not critical, non- animated objects or animated objects that use a skeleton

2 * BorderDist) Points = 50 type Vertex = ref object x, y: float friend: Vertex dist: float = Inf var vertices: seq[Vertex] forest: seq[Vertex] proc init = randomize() for i in in 0 ..< Points: vertices.add(Vertex(x: rand(DataRange) + BorderDist, y: rand(DataRange) + BorderDist)) proc createForest = var last = vertices.pop() # arbitrary start point, assume that we have forest.add(last) # add it to forest and vertices.del(pos) # delete it from the still unconnected vertex set init() let start = cpuTime() createForest() echo "elapsed: ", (cpuTime() - start) * 1e3, "

2 * BorderDist) Points = 50 type Vertex = ref object x, y: float friend: Vertex dist: float = Inf var vertices: seq[Vertex] forest: seq[Vertex] proc init = randomize() for i in in 0 ..< Points: vertices.add(Vertex(x: rand(DataRange) + BorderDist, y: rand(DataRange) + BorderDist)) proc createForest = var last = vertices.pop() # arbitrary start point, assume that we have forest.add(last) # add it to forest and vertices.del(pos) # delete it from the still unconnected vertex set init() let start = cpuTime() createForest() echo "elapsed: ", (cpuTime() - start) * 1e3, "

with a vertex list (SGCOORDS), a per-vertex normals // list (SGNORMALS), and a coordinate index (SGCOORDINDEX). One shape // is used to represent each face so that we may use per-vertex-per-face *tx1 ); // add a faceset; these contain coordinate lists, coordinate indices, // vertex lists, vertex indices, and may also contain color lists and // their indices. IFSG_FACESET* face deviations from the VRML2.0 analogue are as follows: 1. Normals are always per-vertex. 2. Colors are always per vertex. 3. The coordinate index set must describe triangular faces only. ifsg_faceset

with a vertex list (SGCOORDS), a per-vertex normals // list (SGNORMALS), and a coordinate index (SGCOORDINDEX). One shape // is used to represent each face so that we may use per-vertex-per-face *tx1 ); // add a faceset; these contain coordinate lists, coordinate indices, // vertex lists, vertex indices, and may also contain color lists and // their indices. IFSG_FACESET* face deviations from the VRML2.0 analogue are as follows: 1. normals are always per-vertex 2. colors are always per vertex 3. the coordinate index set must describe triangular faces only ifsg_faceset.h

>indexedFaceSet). Each SGFACESET is // 与顶点列表 (SGCOORDS) 关联，每顶点法线 // associated with a vertex list (SGCOORDS), a per-vertex normals // list(SGNORMALS) 和坐标索引 (SGCOORDINDEX)。一个形状 // list (SGNORMALS) shape // 用于表示每个面，以便我们可以使用逐顶点逐面 // is used to represent each face so that we may use per-vertex-per-face // 法线。 // normals. // // 四面体又是顶级 SCENEGRAPH(Tx0) 的子级 // The tetrahedron faceset; these contain coordinate lists, coordinate indices, // 顶点列表、顶点索引，还可能包含颜色列表和 // vertex lists, vertex indices, and may also contain color lists and // 它们的索引。 // their indices. IFSG_FACESET*

局部函数 Kotlin 支持局部函数，即一个函数在另一个函数内部： fun dfs(graph: Graph) { fun dfs(current: Vertex, visited: MutableSet<Vertex>) { if (!visited.add(current)) return for (v in current.neighbors) 量。在上例中， visited 可以 是局部变量： fun dfs(graph: Graph) { val visited = HashSet<Vertex>() fun dfs(current: Vertex) { if (!visited.add(current)) return for (v in current.neighbors) fun addVertex(vertex: Int) { _vertices.add(vertex) } fun addEdge(vertex1: Int, vertex2: Int) { _vertices.add(vertex1) _vertices.add(vertex2) _edges.getOrPut(vertex1)

区块验证通过后，区块上链。 3 重要流程 3.1 交易DAG构建 3.1.1 DAG数据结构 方案中所用到的DAG数据结构如下： ../../../_images/TxDAG.png 其中： 顶点（Vertex） inDegree用于存储顶点当前的入度; outEdge用于保存该顶点的出边信息，具体为所有出边所连顶点的ID 列表。 DAG： vtxs是用于存储DAG中所有节点的列表； topL solution is: ../../../../_images/TxDAG1.png Note: Vertex inDegree stores the current in-degree of Vertex; outEdge stores outedge information of the Vertex, containing ID list of all out-edge connected Vertexs vertexs; void init(uint32_t _maxSize)：initialize the maximum vertex to get maxSize DAG; void addEdge(ID from, ID to)：set a directed edge between vertex from and to; void generate()：build a DAG structure by the

BlockVerifier构造执行上下文，并行执行交易DAG； 区块验证通过后，区块上链。 3 重要流程 3.1 交易DAG构建 3.1.1 DAG数据结构 方案中所用到的DAG数据结构如下： 其中： 顶点（Vertex） inDegree用于存储顶点当前的入度; outEdge用于保存该顶点的出边信息，具体为所有出边所连顶点的ID 列表。 DAG： vtxs是用于存储DAG中所有节点的列表； topLe /_images/IMG_5178.PNG Vertex类为最基础里的类型，在交易DAG中，每一个Vertex实例都表征一笔 交易。Vertex类包含： inDegree：表示该顶点的入度 outEdges：用于存储该节点的出边信息，即所有出边所连顶点的ID列表 DAG类用于对DAG的顶点与边关系进行封装，并提供操作DAG的接口，其包 含： vtxs：Vertex数组 topLevel：包含所有入度 /_images/IMG_51781.PNG Vertex类为最基础里的类型，在交易DAG中，每一个Vertex实例都表征一笔 交易。Vertex类包含： inDegree：表示该顶点的入度 outEdges：用于存储该节点的出边信息，即所有出边所连顶点的ID列表 DAG类用于对DAG的顶点与边关系进行封装，并提供操作DAG的接口，其包 含： vtxs：Vertex数组 topLevel：包含所有入度