Lines Matching refs:vertex
34 2. Project the vertex data onto a plane. It does not need to be
53 We fit a plane to the vertex data, ignoring how they are connected
81 are many vertices which lie almost along a line, and one vertex V
100 ones), organized so that we can quickly extract the vertex with the
111 vertex. The processed portion of the mesh (left of the sweep line) is
112 a planar decomposition. As we cross each vertex, we update the mesh
116 A vertex can have any number of edges. Vertices with many edges can
119 edges are in no particular order around the vertex; for processed
122 The vertex processing happens in two phases: first we process are the
128 the event vertex matches the order in the dictionary;
132 When there are no left-going edges, and the event vertex is in an
134 monotone pieces). To do this we simply join the event vertex to the
145 the event vertex matches the order in the dictionary;
191 - If a vertex has any left-going edges, then these must be in the edge
192 dictionary at the time the vertex is processed.
195 its associated vertex. (This says that these edges exist only
223 changes to its vertex data because of further vertex merging.
