Skip to main content
added 4 characters in body
Source Link
Chris
  • 1
  • 6
  • 35
  • 98

Here's a possible solution using Sverchok add-on:

Basically we can import the ponts directypoints directly from the cvs file with the Text input node and tranformtransform the coordinates in vertices with the Vector in node.

Then what's left is to provide a sequence of indexes based on the specific grid of acquisition. In this particular case, we are defining the first polygon (a quad) anand then repeating the process for every quadrlet with a combination of list managing and a int range.

enter image description here

The last segment of the algorithm is used to get rid of the faces built by the vertices of a row and the first of another. In this particular case is deleting one item of the list every 216.

Here's a possible solution using Sverchok add-on:

Basically we can import the ponts directy from the cvs file with the Text input node and tranform the coordinates in vertices with the Vector in node.

Then what's left is to provide a sequence of indexes based on the specific grid of acquisition. In this particular case, we are defining the first polygon (a quad) an then repeating the process for every quadrlet with a combination of list managing and a int range.

enter image description here

The last segment of the algorithm is used to get rid of the faces built by the vertices of a row and the first of another. In this particular case is deleting one item of the list every 216.

Here's a possible solution using Sverchok add-on:

Basically we can import the points directly from the cvs file with the Text input node and transform the coordinates in vertices with the Vector in node.

Then what's left is to provide a sequence of indexes based on the specific grid of acquisition. In this particular case, we are defining the first polygon (a quad) and then repeating the process for every quadrlet with a combination of list managing and a int range.

enter image description here

The last segment of the algorithm is used to get rid of the faces built by the vertices of a row and the first of another. In this particular case is deleting one item of the list every 216.

added 30 characters in body
Source Link
Carlo
  • 24.9k
  • 2
  • 50
  • 93

Here's a possible solution using Sverchok add-on:

Basically we can import the ponts directy from the cvs file with the Text input node and tranform the coordinates in vertices with the Vector in node.

Then what's left is to provide a sequence of indexes based on the specific grid of acquisition. In this particular case, we are defining the first polygon (a quad) an then repeating the process for every quadrlet with a combination of list managing and a int range.

enter image description here

The last segment is of the algorithm is used forto get rid of the faces built by the vertices of a row and the firtsfirst of another should not be take into account. In this particular case is deleting one item of the list every 216.

Here's a possible solution using Sverchok add-on:

Basically we can import the ponts directy from the cvs file with the Text input node and tranform the coordinates in vertices with the Vector in node.

Then what's left is to provide a sequence of indexes based on the specific grid of acquisition. In this particular case, we are defining the first polygon (a quad) an then repeating the process for every quadrlet with a combination of list managing and a int range.

enter image description here

The last segment is of the algorithm is used for get rid of the faces built by the vertices of a row and the firts of another should not be take into account.

Here's a possible solution using Sverchok add-on:

Basically we can import the ponts directy from the cvs file with the Text input node and tranform the coordinates in vertices with the Vector in node.

Then what's left is to provide a sequence of indexes based on the specific grid of acquisition. In this particular case, we are defining the first polygon (a quad) an then repeating the process for every quadrlet with a combination of list managing and a int range.

enter image description here

The last segment of the algorithm is used to get rid of the faces built by the vertices of a row and the first of another. In this particular case is deleting one item of the list every 216.

deleted 50 characters in body
Source Link
Carlo
  • 24.9k
  • 2
  • 50
  • 93

Here's a possible solution using Sverchok add-on:

Basically we can import the ponts directy from the cvs file with the Text input node and tranform the coordinates in vertices with the Vector in node.

Then what's left is to provide a sequence of indexes based on the specific grid of acquisition. In this particular case, we are defining the first polygon (a quad) an then repeating the process for every quadrlet with a combination of list managing and a int range.

enter image description hereenter image description here

Note: after the baking,The last segment is of the mesh has been cleaned up as with this basic algorithm we were not counting thatis used for get rid of the faces betweenbuilt by the lest vertices of a row and the firts of another should not be take into account.

Here's a possible solution using Sverchok add-on:

Basically we can import the ponts directy from the cvs file with the Text input node and tranform the coordinates in vertices with the Vector in node.

Then what's left is to provide a sequence of indexes based on the specific grid of acquisition. In this particular case, we are defining the first polygon (a quad) an then repeating the process for every quadrlet with a combination of list managing and a int range.

enter image description here

Note: after the baking, the mesh has been cleaned up as with this basic algorithm we were not counting that the faces between the lest vertices of a row and the firts of another should not be take into account.

Here's a possible solution using Sverchok add-on:

Basically we can import the ponts directy from the cvs file with the Text input node and tranform the coordinates in vertices with the Vector in node.

Then what's left is to provide a sequence of indexes based on the specific grid of acquisition. In this particular case, we are defining the first polygon (a quad) an then repeating the process for every quadrlet with a combination of list managing and a int range.

enter image description here

The last segment is of the algorithm is used for get rid of the faces built by the vertices of a row and the firts of another should not be take into account.

Source Link
Carlo
  • 24.9k
  • 2
  • 50
  • 93
Loading