| /dports/science/py-ase/ase-3.22.0/ase/io/ |
| H A D | utils.py | 39 cell_vertices = np.empty((2, 2, 2, 3))
43 cell_vertices[c1, c2, c3] = np.dot([c1, c2, c3],
45 cell_vertices.shape = (8, 3)
46 cell_vertices = np.dot(cell_vertices, rotation)
51 cell_vertices = None
74 X1 = np.minimum(X1, cell_vertices.min(0))
75 X2 = np.maximum(X2, cell_vertices.max(0))
100 if cell_vertices is not None:
101 cell_vertices *= scale
102 cell_vertices -= offset
[all …]
|
| H A D | pov.py | 123 def __init__(self, cell, cell_vertices, positions, diameters, colors, argument
234 if cell_vertices is not None:
235 self.cell_vertices = cell_vertices - self.offset
236 self.cell_vertices.shape = (2, 2, 2, 3)
238 self.cell_vertices = None
272 cell_vertices = pvars.cell_vertices
282 return cls(cell=cell, cell_vertices=cell_vertices, colors=colors,
343 cell_vertices = ''
344 if self.cell_vertices is not None:
357 cell_vertices = cell_vertices.strip('\n')
[all …]
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/examples/step-27/ |
| H A D | step-27.cc | 555 cell_vertices = {{{0, 1, 5, 6}}, in create_coarse_grid() local
568 const unsigned int n_cells = cell_vertices.size(); in create_coarse_grid()
573 for (unsigned int j = 0; j < cell_vertices[i].size(); ++j) in create_coarse_grid()
574 cells[i].vertices[j] = cell_vertices[i][j]; in create_coarse_grid()
|
| /dports/databases/mongodb36/mongodb-src-r3.6.23/src/third_party/s2/ |
| H A D | s2polyline.cc | 298 S2Point cell_vertices[4]; in MayIntersect() local
300 cell_vertices[i] = cell.GetVertex(i); in MayIntersect()
303 S2EdgeUtil::EdgeCrosser crosser(&cell_vertices[j], &cell_vertices[(j+1)&3], in MayIntersect()
|
| /dports/benchmarks/glmark2/glmark2-2021.12/src/scene-terrain/ |
| H A D | terrain-renderer.cpp | 193 PlaneMeshVertex cell_vertices[] = {
223 PlaneMeshVertex& vertex = cell_vertices[vertex_index[i]];
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/contrib/python-bindings/tests/ |
| H A D | triangulation_wrapper.py | 70 cell_vertices = [[0, 1, 2, 3]]
76 cell_vertices = [[0, 1, 2, 3, 4, 5, 6, 7]]
77 triangulation.create_triangulation(vertices, cell_vertices)
79 self.assertEqual(n_cells, len(cell_vertices))
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/angle/third_party/glmark2/src/src/scene-terrain/ |
| H A D | terrain-renderer.cpp | 194 PlaneMeshVertex cell_vertices[] = { in grid_conf() local
224 PlaneMeshVertex& vertex = cell_vertices[vertex_index[i]]; in grid_conf()
|
| /dports/graphics/R-cran-s2/s2/src/s2/ |
| H A D | s2polyline.cc | 329 S2Point cell_vertices[4]; in MayIntersect() local
331 cell_vertices[i] = cell.GetVertex(i); in MayIntersect()
334 S2EdgeCrosser crosser(&cell_vertices[j], &cell_vertices[(j+1)&3], in MayIntersect()
|
| /dports/graphics/s2/s2geometry-0.9.0/src/s2/ |
| H A D | s2polyline.cc | 329 S2Point cell_vertices[4]; in MayIntersect() local
331 cell_vertices[i] = cell.GetVertex(i); in MayIntersect()
334 S2EdgeCrosser crosser(&cell_vertices[j], &cell_vertices[(j+1)&3], in MayIntersect()
|
| /dports/graphics/py-s2/s2geometry-0.9.0/src/s2/ |
| H A D | s2polyline.cc | 329 S2Point cell_vertices[4]; in MayIntersect() local
331 cell_vertices[i] = cell.GetVertex(i); in MayIntersect()
334 S2EdgeCrosser crosser(&cell_vertices[j], &cell_vertices[(j+1)&3], in MayIntersect()
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/include/deal.II/grid/ |
| H A D | connectivity.h | 1112 const std::vector<unsigned int> &cell_vertices = crs.col; in build_entity_templated() local
1165 cell_vertices.data() + cell_ptr[c], cell_ptr[c + 1] - cell_ptr[c]); in build_entity_templated()
1600 std::vector<T> cell_vertices; in build_connectivity() local
1601 cell_vertices.reserve( in build_connectivity()
1636 cell_vertices.push_back(vertex); in build_connectivity()
1638 cell_vertices_ptr.push_back(cell_vertices.size()); in build_connectivity()
1645 {cell_vertices_ptr, cell_vertices}); in build_connectivity()
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/source/grid/ |
| H A D | grid_generator.cc | 4015 cells[i].vertices[j] = cell_vertices[i][j]; in hyper_cube_slit()
4052 cell_vertices[0][i] = i; in truncated_cone()
4057 cells[0].vertices[i] = cell_vertices[0][i]; in truncated_cone()
4095 cells[i].vertices[j] = cell_vertices[i][j]; in hyper_L()
4217 const int cell_vertices[5][4] = { in hyper_ball() local
4225 cells[i].vertices[j] = cell_vertices[i][j]; in hyper_ball()
4435 cells[i].vertices[j] = cell_vertices[i][j]; in quarter_hyper_ball()
4491 const int cell_vertices[5][4] = {{0, 1, 2, 3}, in half_hyper_ball() local
4965 const int cell_vertices[n_cells][8] = { in hyper_ball() local
5063 cell_vertices[i + 5][j] = cell_vertices[i][j] + 8; in cylinder()
[all …]
|
| H A D | grid_tools.cc | 1602 const auto cell_vertices = mapping.get_vertices(current_cell); in find_active_cell_around_point() local
1607 vertex_to_point = p - cell_vertices[closest_vertex]; in find_active_cell_around_point()
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/examples/step-19/ |
| H A D | step-19.cc | 274 const std::vector<unsigned int> cell_vertices[(nx - 1) * (ny - 1)] = { in make_grid() local
297 cells[i].vertices = cell_vertices[i]; in make_grid()
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/examples/step-14/ |
| H A D | step-14.cc | 1272 cell_vertices = {{{0, 1, 5, 6}}, in create_coarse_grid() local
1285 const unsigned int n_cells = cell_vertices.size(); in create_coarse_grid()
1293 for (unsigned int j = 0; j < cell_vertices[i].size(); ++j) in create_coarse_grid()
1294 cells[i].vertices[j] = cell_vertices[i][j]; in create_coarse_grid()
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/include/deal.II/base/ |
| H A D | geometry_info.h | 3356 constexpr unsigned int cell_vertices[4][2] = {{0, 2}, {1, 3}, {0, 1}, {2, 3}};
3357 return cell_vertices[line][vertex];
|