Home
last modified time | relevance | path

Searched refs:on_boundary (Results 1 – 25 of 65) sorted by relevance

123

/dports/databases/postgis25/postgis-2.5.5/liblwgeom/cunit/
H A Dcu_tree.c52 int rv, on_boundary; in test_tree_circ_pip() local
62 rv = circ_tree_contains_point(c, &pt, &pt_outside, &on_boundary); in test_tree_circ_pip()
68 rv = circ_tree_contains_point(c, &pt, &pt_outside, &on_boundary); in test_tree_circ_pip()
81 rv = circ_tree_contains_point(c, &pt, &pt_outside, &on_boundary); in test_tree_circ_pip()
87 rv = circ_tree_contains_point(c, &pt, &pt_outside, &on_boundary); in test_tree_circ_pip()
100 rv = circ_tree_contains_point(c, &pt, &pt_outside, &on_boundary); in test_tree_circ_pip()
107 rv = circ_tree_contains_point(c, &pt, &pt_outside, &on_boundary); in test_tree_circ_pip()
122 int rv_classic, rv_tree, on_boundary; in test_tree_circ_pip2() local
137 rv_tree = circ_tree_contains_point(c, &pt, &pt_outside, &on_boundary); in test_tree_circ_pip2()
151 rv_tree = circ_tree_contains_point(c, &pt, &pt_outside, &on_boundary); in test_tree_circ_pip2()
[all …]
/dports/cad/PrusaSlicer/PrusaSlicer-version_2.3.3/src/libigl/igl/
H A Don_boundary.cpp17 IGL_INLINE void igl::on_boundary( in on_boundary() function in igl
116 IGL_INLINE void igl::on_boundary( in on_boundary() function in igl
129 on_boundary(vT,vI,vC); in on_boundary()
138 template void igl::on_boundary<Eigen::Matrix<int, -1, -1, 0, -1, -1>, Eigen::Array<bool, -1, 1, 0, …
139 template void igl::on_boundary<Eigen::Matrix<int, -1, -1, 0, -1, -1>, Eigen::Matrix<int, -1, -1, 0,…
140 template void igl::on_boundary<Eigen::Matrix<int, -1, -1, 0, -1, -1>, Eigen::Array<bool, -1, 1, 0, …
H A Don_boundary.h30 IGL_INLINE void on_boundary(
39 IGL_INLINE void on_boundary(
/dports/graphics/wings/libigl-2.1.0/include/igl/
H A Don_boundary.cpp17 IGL_INLINE void igl::on_boundary( in on_boundary() function in igl
116 IGL_INLINE void igl::on_boundary( in on_boundary() function in igl
129 on_boundary(vT,vI,vC); in on_boundary()
138 template void igl::on_boundary<Eigen::Matrix<int, -1, -1, 0, -1, -1>, Eigen::Array<bool, -1, 1, 0, …
139 template void igl::on_boundary<Eigen::Matrix<int, -1, -1, 0, -1, -1>, Eigen::Matrix<int, -1, -1, 0,…
140 template void igl::on_boundary<Eigen::Matrix<int, -1, -1, 0, -1, -1>, Eigen::Array<bool, -1, 1, 0, …
H A Don_boundary.h30 IGL_INLINE void on_boundary(
39 IGL_INLINE void on_boundary(
/dports/databases/postgis31/postgis-3.1.4/liblwgeom/cunit/
H A Dcu_tree.c52 int rv, on_boundary; in test_tree_circ_pip() local
62 rv = circ_tree_contains_point(c, &pt, &pt_outside, 0, &on_boundary); in test_tree_circ_pip()
68 rv = circ_tree_contains_point(c, &pt, &pt_outside, 0, &on_boundary); in test_tree_circ_pip()
81 rv = circ_tree_contains_point(c, &pt, &pt_outside, 0, &on_boundary); in test_tree_circ_pip()
87 rv = circ_tree_contains_point(c, &pt, &pt_outside, 0, &on_boundary); in test_tree_circ_pip()
100 rv = circ_tree_contains_point(c, &pt, &pt_outside, 0, &on_boundary); in test_tree_circ_pip()
107 rv = circ_tree_contains_point(c, &pt, &pt_outside, 0, &on_boundary); in test_tree_circ_pip()
122 int rv_classic, rv_tree, on_boundary; in test_tree_circ_pip2() local
137 rv_tree = circ_tree_contains_point(c, &pt, &pt_outside, 0, &on_boundary); in test_tree_circ_pip2()
151 rv_tree = circ_tree_contains_point(c, &pt, &pt_outside, 0, &on_boundary); in test_tree_circ_pip2()
[all …]
/dports/databases/postgis30/postgis-3.0.4/liblwgeom/cunit/
H A Dcu_tree.c52 int rv, on_boundary; in test_tree_circ_pip() local
62 rv = circ_tree_contains_point(c, &pt, &pt_outside, 0, &on_boundary); in test_tree_circ_pip()
68 rv = circ_tree_contains_point(c, &pt, &pt_outside, 0, &on_boundary); in test_tree_circ_pip()
81 rv = circ_tree_contains_point(c, &pt, &pt_outside, 0, &on_boundary); in test_tree_circ_pip()
87 rv = circ_tree_contains_point(c, &pt, &pt_outside, 0, &on_boundary); in test_tree_circ_pip()
100 rv = circ_tree_contains_point(c, &pt, &pt_outside, 0, &on_boundary); in test_tree_circ_pip()
107 rv = circ_tree_contains_point(c, &pt, &pt_outside, 0, &on_boundary); in test_tree_circ_pip()
122 int rv_classic, rv_tree, on_boundary; in test_tree_circ_pip2() local
137 rv_tree = circ_tree_contains_point(c, &pt, &pt_outside, 0, &on_boundary); in test_tree_circ_pip2()
151 rv_tree = circ_tree_contains_point(c, &pt, &pt_outside, 0, &on_boundary); in test_tree_circ_pip2()
[all …]
/dports/databases/postgis32/postgis-3.2.0/liblwgeom/cunit/
H A Dcu_tree.c52 int rv, on_boundary; in test_tree_circ_pip() local
62 rv = circ_tree_contains_point(c, &pt, &pt_outside, 0, &on_boundary); in test_tree_circ_pip()
68 rv = circ_tree_contains_point(c, &pt, &pt_outside, 0, &on_boundary); in test_tree_circ_pip()
81 rv = circ_tree_contains_point(c, &pt, &pt_outside, 0, &on_boundary); in test_tree_circ_pip()
87 rv = circ_tree_contains_point(c, &pt, &pt_outside, 0, &on_boundary); in test_tree_circ_pip()
100 rv = circ_tree_contains_point(c, &pt, &pt_outside, 0, &on_boundary); in test_tree_circ_pip()
107 rv = circ_tree_contains_point(c, &pt, &pt_outside, 0, &on_boundary); in test_tree_circ_pip()
122 int rv_classic, rv_tree, on_boundary; in test_tree_circ_pip2() local
137 rv_tree = circ_tree_contains_point(c, &pt, &pt_outside, 0, &on_boundary); in test_tree_circ_pip2()
151 rv_tree = circ_tree_contains_point(c, &pt, &pt_outside, 0, &on_boundary); in test_tree_circ_pip2()
[all …]
/dports/math/libmesh/libmesh-1.6.2/src/mesh/
H A Dmesh_smoother_laplace.C53 auto on_boundary = MeshTools::find_boundary_nodes(_mesh); in smooth() local
59 on_boundary.insert(on_block_boundary.begin(), on_block_boundary.end()); in smooth()
77 if (!on_boundary.count(node->id()) && (_graph[node->id()].size() > 0)) in smooth()
101 if (!on_boundary.count(node->id()) && (_graph[node->id()].size() > 0)) in smooth()
131 if (!on_boundary.count(elem->node_id(son))) in smooth()
/dports/archivers/draco/draco-1.4.3/docs/spec/
H A Dedgebreaker.traversal.md127 on_boundary = IsOnPositionBoundary(vert_id);
130 if (!on_boundary) {
195 on_boundary = (on_seam) ? on_seam : IsOnPositionBoundary(pos_vert_id);
198 if (!on_boundary) {
/dports/devel/librttopo/librttopo-1.1.0/src/
H A Drttree.c60 …tree_contains_point(const RTCTX *ctx, const RECT_NODE *node, const RTPOINT2D *pt, int *on_boundary) in rect_tree_contains_point() argument
68 *on_boundary = RT_TRUE; in rect_tree_contains_point()
73 return rect_tree_contains_point(ctx, node->left_node, pt, on_boundary) + in rect_tree_contains_point()
74 rect_tree_contains_point(ctx, node->right_node, pt, on_boundary); in rect_tree_contains_point()
/dports/devel/universal-ctags/ctags-p5.9.20211128.0/parsers/
H A Dlua.c184 bool on_boundary = false; in extract_prev_token() local
198 on_boundary = true; in extract_prev_token()
202 if(on_boundary) in extract_prev_token()
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/muq2/modules/Modeling/test/
H A DPDEModPieceTests.py36 def boundary(x, on_boundary): argument
37 return on_boundary and x[0]<dfn.DOLFIN_EPS
/dports/math/cgal/CGAL-5.3/include/CGAL/Nef_S2/
H A DSM_checker.h219 CGAL::Hash_map< Halfedge_const_iterator, bool> on_boundary(false); in check_is_triangulation()
227 on_boundary[hit]=true; in check_is_triangulation()
231 if (on_boundary[eit]) continue; in check_is_triangulation()
/dports/graphics/blender/blender-2.91.0/extern/draco/dracoenc/src/draco/compression/mesh/traverser/
H A Ddepth_first_traverser.h102 const bool on_boundary = this->corner_table()->IsOnBoundary(vert_id); in TraverseFromCorner() local
105 if (!on_boundary) { in TraverseFromCorner()
/dports/archivers/draco/draco-1.4.3/src/draco/compression/mesh/traverser/
H A Ddepth_first_traverser.h105 const bool on_boundary = this->corner_table()->IsOnBoundary(vert_id); in TraverseFromCorner() local
108 if (!on_boundary) { in TraverseFromCorner()
/dports/multimedia/assimp/assimp-5.1.3/contrib/draco/src/draco/compression/mesh/traverser/
H A Ddepth_first_traverser.h105 const bool on_boundary = this->corner_table()->IsOnBoundary(vert_id); in TraverseFromCorner() local
108 if (!on_boundary) { in TraverseFromCorner()
/dports/math/cgal/CGAL-5.3/demo/Polyhedron/Plugins/PMP/
H A DPoint_inside_polyhedron_plugin.cpp95 bool on_boundary = ui_widget.On_boundary_check_box->isChecked(); in on_Select_button() local
98 if(!(inside || on_boundary || outside)) { in on_Select_button()
156 (on_boundary && res == CGAL::ON_BOUNDARY) || in on_Select_button()
/dports/databases/postgis31/postgis-3.1.4/liblwgeom/
H A Dlwtree.c199 rect_leaf_node_segment_side(RECT_NODE_LEAF *node, const POINT2D *q, int *on_boundary) in rect_leaf_node_segment_side() argument
215 *on_boundary = LW_TRUE; in rect_leaf_node_segment_side()
251 *on_boundary = LW_TRUE; in rect_leaf_node_segment_side()
314 rect_tree_ring_contains_point(RECT_NODE *node, const POINT2D *pt, int *on_boundary) in rect_tree_ring_contains_point() argument
322 return rect_leaf_node_segment_side(&node->l, pt, on_boundary); in rect_tree_ring_contains_point()
329 r += rect_tree_ring_contains_point(node->i.nodes[i], pt, on_boundary); in rect_tree_ring_contains_point()
361 int on_boundary = 0; in rect_tree_area_contains_point() local
362 int edge_crossing_count = rect_tree_ring_contains_point(node, pt, &on_boundary); in rect_tree_area_contains_point()
370 return on_boundary ? 0 : -1 * contained; in rect_tree_area_contains_point()
374 return contained || on_boundary; in rect_tree_area_contains_point()
/dports/databases/postgis32/postgis-3.2.0/liblwgeom/
H A Dlwtree.c199 rect_leaf_node_segment_side(RECT_NODE_LEAF *node, const POINT2D *q, int *on_boundary) in rect_leaf_node_segment_side() argument
215 *on_boundary = LW_TRUE; in rect_leaf_node_segment_side()
251 *on_boundary = LW_TRUE; in rect_leaf_node_segment_side()
314 rect_tree_ring_contains_point(RECT_NODE *node, const POINT2D *pt, int *on_boundary) in rect_tree_ring_contains_point() argument
322 return rect_leaf_node_segment_side(&node->l, pt, on_boundary); in rect_tree_ring_contains_point()
329 r += rect_tree_ring_contains_point(node->i.nodes[i], pt, on_boundary); in rect_tree_ring_contains_point()
361 int on_boundary = 0; in rect_tree_area_contains_point() local
362 int edge_crossing_count = rect_tree_ring_contains_point(node, pt, &on_boundary); in rect_tree_area_contains_point()
370 return on_boundary ? 0 : -1 * contained; in rect_tree_area_contains_point()
374 return contained || on_boundary; in rect_tree_area_contains_point()
/dports/databases/postgis30/postgis-3.0.4/liblwgeom/
H A Dlwtree.c199 rect_leaf_node_segment_side(RECT_NODE_LEAF *node, const POINT2D *q, int *on_boundary) in rect_leaf_node_segment_side() argument
215 *on_boundary = LW_TRUE; in rect_leaf_node_segment_side()
251 *on_boundary = LW_TRUE; in rect_leaf_node_segment_side()
314 rect_tree_ring_contains_point(RECT_NODE *node, const POINT2D *pt, int *on_boundary) in rect_tree_ring_contains_point() argument
322 return rect_leaf_node_segment_side(&node->l, pt, on_boundary); in rect_tree_ring_contains_point()
329 r += rect_tree_ring_contains_point(node->i.nodes[i], pt, on_boundary); in rect_tree_ring_contains_point()
361 int on_boundary = 0; in rect_tree_area_contains_point() local
362 int edge_crossing_count = rect_tree_ring_contains_point(node, pt, &on_boundary); in rect_tree_area_contains_point()
370 return on_boundary ? 0 : -1 * contained; in rect_tree_area_contains_point()
374 return contained || on_boundary; in rect_tree_area_contains_point()
/dports/databases/postgis25/postgis-2.5.5/liblwgeom/
H A Dlwtree.c199 rect_leaf_node_segment_side(RECT_NODE_LEAF *node, const POINT2D *q, int *on_boundary) in rect_leaf_node_segment_side() argument
215 *on_boundary = LW_TRUE; in rect_leaf_node_segment_side()
251 *on_boundary = LW_TRUE; in rect_leaf_node_segment_side()
314 rect_tree_ring_contains_point(RECT_NODE *node, const POINT2D *pt, int *on_boundary) in rect_tree_ring_contains_point() argument
322 return rect_leaf_node_segment_side(&node->l, pt, on_boundary); in rect_tree_ring_contains_point()
329 r += rect_tree_ring_contains_point(node->i.nodes[i], pt, on_boundary); in rect_tree_ring_contains_point()
361 int on_boundary = 0; in rect_tree_area_contains_point() local
362 int edge_crossing_count = rect_tree_ring_contains_point(node, pt, &on_boundary); in rect_tree_area_contains_point()
370 return on_boundary ? 0 : -1 * contained; in rect_tree_area_contains_point()
374 return contained || on_boundary; in rect_tree_area_contains_point()
/dports/math/cgal/CGAL-5.3/include/CGAL/Arrangement_2/
H A DArrangement_zone_2_impl.h1050 _leftmost_intersection(Ccb_halfedge_circulator he_curr, bool on_boundary, in _leftmost_intersection() argument
1079 if (on_boundary) { in _leftmost_intersection()
1162 _leftmost_intersection_with_face_boundary(Face_handle face, bool on_boundary) in _leftmost_intersection_with_face_boundary() argument
1184 do _leftmost_intersection(he_curr, on_boundary, leftmost_on_right_boundary); in _leftmost_intersection_with_face_boundary()
1195 do _leftmost_intersection(he_curr, on_boundary, leftmost_on_right_boundary); in _leftmost_intersection_with_face_boundary()
1243 _zone_in_face(Face_handle face, bool on_boundary) in _zone_in_face() argument
1248 CGAL_precondition((! on_boundary && in _zone_in_face()
1252 (on_boundary && (m_left_he != m_invalid_he))); in _zone_in_face()
1255 _leftmost_intersection_with_face_boundary(face, on_boundary); in _zone_in_face()
/dports/math/cgal/CGAL-5.3/include/CGAL/Nef_2/
H A DPM_checker.h251 CGAL::Unique_hash_map< Halfedge_const_iterator, bool> on_boundary(false); in check_is_triangulation()
259 on_boundary[hit]=true; in check_is_triangulation()
263 if (on_boundary[eit]) continue; in check_is_triangulation()
/dports/math/polymake/polymake-4.5/apps/topaz/src/
H A Dbs2quotient.cc73 if (on_boundary(*lit, VIF)) { in identify_labels()
94 if (on_boundary(*lit, VIF)) { in identify_labels()
123 if (on_boundary(*lit, VIF)) { in identify_labels_by_equivalence()

123