Home
last modified time | relevance | path

Searched refs:vertex_n (Results 1 – 25 of 67) sorted by relevance

123

/dports/games/residualvm/residualvm-0.3.1/graphics/tinygl/
H A Dvertex.cpp94 c->vertex_n = 0; in glopBegin()
197 n = c->vertex_n; in glopVertex()
250 c->vertex_n = n; in glopVertex()
H A Dzgl.h341 int vertex_n, vertex_cnt; member
H A Dzdirtyrect.cpp353 int n = c->vertex_n; in execute()
/dports/games/scummvm/scummvm-2.5.1/graphics/tinygl/
H A Dvertex.cpp97 c->vertex_n = 0; in glopBegin()
200 n = c->vertex_n; in glopVertex()
253 c->vertex_n = n; in glopVertex()
H A Dzgl.h347 int vertex_n, vertex_cnt; member
H A Dzdirtyrect.cpp353 int n = c->vertex_n; in execute()
/dports/archivers/draco/draco-1.4.3/docs/spec/
H A Dedgebreaker.decoder.md200 vertex_n = CornerToVert(curr_att_dec, corner_n);
202 vertex_valences_[vert] += vertex_valences_[vertex_n];
204 ReplaceVerts(vertex_n, vert);
213 vertex_corners_[vertex_n] = kInvalidCornerIndex;
/dports/cad/meshlab/meshlab-Meshlab-2020.05/src/meshlabplugins/filter_qhull/
H A Dqhull_tools.cpp436 int vertex_n, vertex_i; in compute_voronoi() local
582 int vertex_n, vertex_i; in compute_alpha_shapes() local
625 int vertex_n, vertex_i; in compute_alpha_shapes() local
647 int vertex_n, vertex_i; in compute_alpha_shapes() local
815 int vertex_n, vertex_i; in visible_points() local
832 int vertex_n, vertex_i; in visible_points() local
H A Dfilter_qhull.cpp262 int vertex_n, vertex_i; in applyFilter() local
/dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/include/deal.II/grid/
H A Dgrid_tools.h3684 for (unsigned int vertex_n = 0; vertex_n < n_vertices_per_cell; in project_to_object() local
3685 ++vertex_n) in project_to_object()
3686 vertices[vertex_n] = object->vertex(vertex_n); in project_to_object()
3700 for (unsigned int vertex_n = 0; vertex_n < n_vertices_per_cell; in project_to_object() local
3701 ++vertex_n) in project_to_object()
3704 vertices[vertex_n].distance(trial_point); in project_to_object()
3708 guess_weights[vertex_n] = 1.0; in project_to_object()
3714 guess_weights[vertex_n] = 1.0 / distance; in project_to_object()
3715 guess_weights_sum += guess_weights[vertex_n]; in project_to_object()
/dports/graphics/blender/blender-2.91.0/extern/draco/dracoenc/src/draco/compression/mesh/
H A Dmesh_edgebreaker_decoder_impl.cc657 const VertexIndex vertex_n = corner_table_->Vertex(corner_n); in DecodeConnectivity() local
658 traversal_decoder_.MergeVertices(vertex_p, vertex_n); in DecodeConnectivity()
661 corner_table_->LeftMostCorner(vertex_n)); in DecodeConnectivity()
671 corner_table_->MakeVertexIsolated(vertex_n); in DecodeConnectivity()
673 invalid_vertices.push_back(vertex_n); in DecodeConnectivity()
/dports/archivers/draco/draco-1.4.3/src/draco/compression/mesh/
H A Dmesh_edgebreaker_decoder_impl.cc708 const VertexIndex vertex_n = corner_table_->Vertex(corner_n); in DecodeConnectivity() local
709 traversal_decoder_.MergeVertices(vertex_p, vertex_n); in DecodeConnectivity()
712 corner_table_->LeftMostCorner(vertex_n)); in DecodeConnectivity()
722 corner_table_->MakeVertexIsolated(vertex_n); in DecodeConnectivity()
724 invalid_vertices.push_back(vertex_n); in DecodeConnectivity()
/dports/multimedia/assimp/assimp-5.1.3/contrib/draco/src/draco/compression/mesh/
H A Dmesh_edgebreaker_decoder_impl.cc708 const VertexIndex vertex_n = corner_table_->Vertex(corner_n); in DecodeConnectivity() local
709 traversal_decoder_.MergeVertices(vertex_p, vertex_n); in DecodeConnectivity()
712 corner_table_->LeftMostCorner(vertex_n)); in DecodeConnectivity()
722 corner_table_->MakeVertexIsolated(vertex_n); in DecodeConnectivity()
724 invalid_vertices.push_back(vertex_n); in DecodeConnectivity()
/dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/source/grid/
H A Dgrid_generator.cc3541 for (const unsigned int vertex_n : in channel_with_cylinder() local
3571 cell->vertex(vertex_n)[0] = -0.1; in channel_with_cylinder()
3573 cell->vertex(vertex_n)[0] = 0.1; in channel_with_cylinder()
5931 vertex_n += n_accumulated_vertices; in merge_triangulations()
6484 for (std::size_t vertex_n = 0; vertex_n < input.n_vertices(); in extrude_triangulation() local
6485 ++vertex_n) in extrude_triangulation()
6500 for (const unsigned int vertex_n : in extrude_triangulation() local
6503 this_cell.vertices[vertex_n] = in extrude_triangulation()
6507 cell->vertex_index(vertex_n) + in extrude_triangulation()
6841 for (unsigned int vertex_n = 0; in concentric_hyper_shells() local
[all …]
H A Dgrid_tools.cc363 for (unsigned int vertex_n = 0; vertex_n < face->n_vertices(); in insert_face_data() local
364 ++vertex_n) in insert_face_data()
365 face_cell_data.vertices[vertex_n] = face->vertex_index(vertex_n); in insert_face_data()
464 for (unsigned int vertex_n = 0; vertex_n < line->n_vertices(); in get_coarse_mesh_description() local
465 ++vertex_n) in get_coarse_mesh_description()
466 line_cell_data.vertices[vertex_n] = in get_coarse_mesh_description()
467 line->vertex_index(vertex_n); in get_coarse_mesh_description()
659 for (const unsigned int vertex_n : considered_vertices) in delete_duplicated_vertices() local
661 AssertIndexRange(vertex_n, vertices.size()); in delete_duplicated_vertices()
662 sorted_vertices.emplace_back(vertex_n, vertices[vertex_n]); in delete_duplicated_vertices()
H A Dmanifold_lib.cc2253 for (const unsigned int vertex_n : GeometryInfo<dim>::vertex_indices()) in get_possible_cells_around_points() local
2255 vertices[vertex_n] = cell->vertex(vertex_n); in get_possible_cells_around_points()
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/surface/include/pcl/surface/impl/
H A Dconcave_hull.hpp361 int vertex_n, vertex_i; in performReconstruction() local
441 int vertex_n, vertex_i; in performReconstruction() local
H A Dconvex_hull.hpp403 int vertex_n, vertex_i; in performReconstruction3D()
/dports/math/qhull8/qhull-8.0.2/src/libqhull/
H A Dpoly2.c35 int vertex_i= 0, vertex_n; in qh_addfacetvertex() local
1493 int vertex_i, vertex_n, nth; in qh_createsimplex() local
1499 newfacet->vertices= qh_setnew_delnthsorted(vertices, vertex_n, vertex_i, 0); in qh_createsimplex()
3335 int vertex_i, vertex_n= 0; in qh_replacefacetvertex() local
3359 new_i= vertex_n; in qh_replacefacetvertex()
H A Dgeom2.c2176 int k, vertex_i, vertex_n; in qh_vertex_bestdist2() local
2179 for (k= vertex_i+1; k < vertex_n; k++) { in qh_vertex_bestdist2()
/dports/math/qhull/qhull-7.3.2/src/libqhull/
H A Dpoly2.c35 int vertex_i= 0, vertex_n; in qh_addfacetvertex() local
1493 int vertex_i, vertex_n, nth; in qh_createsimplex() local
1499 newfacet->vertices= qh_setnew_delnthsorted(vertices, vertex_n, vertex_i, 0); in qh_createsimplex()
3307 int vertex_i, vertex_n= 0; in qh_replacefacetvertex() local
3331 new_i= vertex_n; in qh_replacefacetvertex()
H A Dgeom2.c2175 int k, vertex_i, vertex_n; in qh_vertex_bestdist2() local
2178 for (k= vertex_i+1; k < vertex_n; k++) { in qh_vertex_bestdist2()
/dports/science/py-scipy/scipy-1.7.1/scipy/spatial/qhull_src/src/
H A Dpoly2_r.c35 int vertex_i= 0, vertex_n; in qh_addfacetvertex() local
1494 int vertex_i, vertex_n, nth; in qh_createsimplex() local
1500 newfacet->vertices= qh_setnew_delnthsorted(qh, vertices, vertex_n, vertex_i, 0); in qh_createsimplex()
3309 int vertex_i, vertex_n= 0; in qh_replacefacetvertex() local
3333 new_i= vertex_n; in qh_replacefacetvertex()
/dports/math/qhull8/qhull-8.0.2/src/libqhull_r/
H A Dpoly2_r.c35 int vertex_i= 0, vertex_n; in encode()
1494 int vertex_i, vertex_n, nth;
1500 newfacet->vertices= qh_setnew_delnthsorted(qh, vertices, vertex_n, vertex_i, 0);
3337 int vertex_i, vertex_n= 0;
3361 new_i= vertex_n;
/dports/math/qhull/qhull-7.3.2/src/libqhull_r/
H A Dpoly2_r.c35 int vertex_i= 0, vertex_n; in qh_addfacetvertex() local
1494 int vertex_i, vertex_n, nth; in qh_createsimplex() local
1500 newfacet->vertices= qh_setnew_delnthsorted(qh, vertices, vertex_n, vertex_i, 0); in qh_createsimplex()
3309 int vertex_i, vertex_n= 0; in qh_replacefacetvertex() local
3333 new_i= vertex_n; in qh_replacefacetvertex()

123