Home
last modified time | relevance | path

Searched refs:primal (Results 1 – 25 of 1206) sorted by relevance

12345678910>>...49

/dports/science/axom/axom-0.6.1/src/axom/primal/tests/
H A Dprimal_intersect_impl.cpp24 EXPECT_TRUE(primal::detail::isGt(1.15, 1.0, eps)); in TEST()
26 EXPECT_FALSE(primal::detail::isGt(1.05, 1.0, eps)); in TEST()
27 EXPECT_FALSE(primal::detail::isGt(1.0, 1.0, eps)); in TEST()
28 EXPECT_FALSE(primal::detail::isGt(0.95, 1.0, eps)); in TEST()
29 EXPECT_FALSE(primal::detail::isGt(0.85, 1.0, eps)); in TEST()
36 EXPECT_TRUE(primal::detail::isLeq(1.05, 1.0, eps)); in TEST()
37 EXPECT_TRUE(primal::detail::isLeq(1.0, 1.0, eps)); in TEST()
38 EXPECT_TRUE(primal::detail::isLeq(0.95, 1.0, eps)); in TEST()
39 EXPECT_TRUE(primal::detail::isLeq(0.85, 1.0, eps)); in TEST()
45 EXPECT_FALSE(primal::detail::isLt(1.0, 1.0, eps)); in TEST()
[all …]
H A Dprimal_squared_distance.cpp63 primal::Point<double, 2> A = primal::Point<double, 2>::make_point(0.0, 0.0); in TEST()
64 primal::Point<double, 2> B = primal::Point<double, 2>::make_point(1.5, 1.5); in TEST()
77 primal::Point<double, 3> A = in TEST()
79 primal::Point<double, 3> B = in TEST()
81 primal::Point<double, 3> C = in TEST()
98 primal::Point<double, 3> mid_of_AB = primal::Point<double, 3>::midpoint(A, B); in TEST()
102 primal::Point<double, 3> mid_of_BC = primal::Point<double, 3>::midpoint(B, C); in TEST()
106 primal::Point<double, 3> mid_of_AC = primal::Point<double, 3>::midpoint(A, C); in TEST()
112 primal::Point<double, 3> q = in TEST()
143 primal::Point<double, 2> q0 = primal::Point<double, 2>::make_point(0.5, 10); in TEST()
[all …]
H A Dprimal_plane.cpp15 namespace primal = axom::primal;
44 primal::Plane<double, NDIMS> p1(p2); in check_copy_constructor()
63 primal::Point<double, NDIMS> x(0.0); in check_assignment_operator()
143 primal::Plane<double, 3> P = primal::make_plane(x1, x2, x3); in TEST()
150 primal::Plane<double, 2> P2 = primal::make_plane(a, b); in TEST()
180 primal::Plane<double, 3> P = primal::make_plane(x1, x2, x3); in TEST()
202 primal::Plane<double, 2> P2 = primal::make_plane(a, b); in TEST()
234 primal::Plane<double, 3> P = primal::make_plane(x1, x2, x3); in TEST()
264 primal::Plane<double, 2> P2 = primal::make_plane(a, b); in TEST()
303 primal::Plane<double, 3> P = primal::make_plane(x1, x2, x3); in TEST()
[all …]
H A Dprimal_orientation.cpp19 primal::Point<double, 3> A = in TEST()
21 primal::Point<double, 3> B = in TEST()
23 primal::Point<double, 3> C = in TEST()
28 primal::Point<double, 3> q0 = in TEST()
30 primal::Point<double, 3> q1 = in TEST()
32 primal::Point<double, 3> q2 = in TEST()
50 primal::Point<double, 2> A(0.0); in TEST()
51 primal::Point<double, 2> B(1.0); in TEST()
55 primal::Point<double, 2> q0(0.5); in TEST()
56 primal::Point<double, 2> q1 = primal::Point<double, 2>::make_point(-0.5, 0.5); in TEST()
[all …]
H A Dprimal_intersect.cpp47 primal::Point<double, NDIMS> pt; in randomPt()
59 primal::Triangle<double, DIM> roll(const primal::Triangle<double, DIM>& t, in roll()
154 using PointType = primal::Point<double, 2>; in TEST()
157 using RayType = primal::Ray<double, 2>; in TEST()
232 using RayType = primal::Ray<double, DIM>; in TEST()
549 using Point2 = primal::Point<double, 2>;
550 using Bary = primal::Point<double, 3>;
610 typedef primal::Point<double, 2> Point2;
926 typedef primal::Point<double, 3> Point3; in makeTwoRandomIntersecting3DTriangles()
996 typedef primal::Point<double, 3> Point3;
[all …]
H A Dprimal_sphere.cpp10 namespace primal = axom::primal;
34 primal::Sphere<double, NDIMS> S0; in check_constructor()
38 primal::Sphere<double, NDIMS> S1(PRESCRIBED_RADIUS); in check_constructor()
42 primal::Sphere<double, NDIMS> S2(PRESCRIBED_CENTER); in check_constructor()
59 primal::Sphere<double, NDIMS> sphere; in check_signed_distance_and_orientation()
122 primal::Sphere<double, NDIMS> S0; in check_sphere_intersection()
127 primal::Sphere<double, NDIMS> S1(center); in check_sphere_intersection()
132 primal::Sphere<double, NDIMS> S2(center); in check_sphere_intersection()
137 primal::Sphere<double, NDIMS> S3(center); in check_sphere_intersection()
150 primal::Sphere<double, NDIMS> s2(s1); in check_copy_constructor()
[all …]
H A Dprimal_closest_point.cpp24 typedef primal::Point<CoordType, DIM> QPoint; in TEST()
25 typedef primal::Vector<CoordType, DIM> QVector; in TEST()
42 EXPECT_TRUE(primal::closest_point(pt1, obbox1) == pt1); in TEST()
50 typedef primal::Point<CoordType, DIM> QPoint; in TEST()
51 typedef primal::Vector<CoordType, DIM> QVector; in TEST()
79 typedef primal::Point<CoordType, DIM> QPoint; in TEST()
80 typedef primal::Vector<CoordType, DIM> QVector; in TEST()
99 QVector found(primal::closest_point(pt3, obbox1)); in TEST()
111 typedef primal::Point<CoordType, DIM> QPoint; in TEST()
112 typedef primal::Vector<CoordType, DIM> QVector; in TEST()
[all …]
H A Dprimal_compute_bounding_box.cpp23 typedef primal::Point<CoordType, DIM> QPoint; in TEST()
24 typedef primal::Vector<CoordType, DIM> QVector; in TEST()
71 typedef primal::Point<CoordType, DIM> QPoint; in TEST()
72 typedef primal::Vector<CoordType, DIM> QVector; in TEST()
110 typedef primal::Point<CoordType, DIM> QPoint; in TEST()
111 typedef primal::Vector<CoordType, DIM> QVector; in TEST()
112 typedef primal::BoundingBox<CoordType, DIM> QBBox; in TEST()
136 typedef primal::Point<CoordType, DIM> QPoint; in TEST()
138 typedef primal::Octahedron<CoordType, DIM> QOct; in TEST()
164 typedef primal::Point<CoordType, DIM> QPoint; in TEST()
[all …]
H A Dprimal_orientedboundingbox.cpp23 typedef primal::Point<CoordType, DIM> QPoint; in TEST()
39 typedef primal::Point<CoordType, DIM> QPoint; in TEST()
40 typedef primal::Vector<CoordType, DIM> QVector; in TEST()
89 typedef primal::Point<CoordType, DIM> QPoint; in TEST()
90 typedef primal::Vector<CoordType, DIM> QVector; in TEST()
127 typedef primal::Point<CoordType, DIM> QPoint; in TEST()
158 typedef primal::Point<CoordType, DIM> QPoint; in TEST()
174 primal::NumericArray<CoordType, DIM> v; in TEST()
196 typedef primal::Point<CoordType, DIM> QPoint; in TEST()
246 typedef primal::Point<CoordType, DIM> QPoint; in TEST()
[all …]
H A Dprimal_boundingbox.cpp24 using PointType = primal::Point<double, DIM>; in check_bb_policy()
25 using VectorType = primal::Vector<double, DIM>; in check_bb_policy()
52 typedef primal::Point<CoordType, DIM> QPoint; in TEST()
68 typedef primal::Point<CoordType, DIM> QPoint; in TEST()
96 typedef primal::Point<CoordType, DIM> QPoint; in TEST()
150 typedef primal::Point<CoordType, DIM> QPoint; in TEST()
183 typedef primal::Point<CoordType, DIM> QPoint; in TEST()
386 typedef primal::Point<double, DIM> PointD; in TEST()
389 typedef primal::Point<int, DIM> PointI; in TEST()
528 using namespace axom::primal; in TEST()
[all …]
H A Dprimal_bezier_curve.cpp15 namespace primal = axom::primal;
50 using PointType = primal::Point<CoordType, DIM>; in TEST()
85 using PointType = primal::Point<CoordType, DIM>; in TEST()
139 using PointType = primal::Point<CoordType, DIM>; in TEST()
173 using PointType = primal::Point<CoordType, DIM>; in TEST()
215 using PointType = primal::Point<CoordType, DIM>; in TEST()
241 using PointType = primal::Point<CoordType, DIM>; in TEST()
288 using PointType = primal::Point<CoordType, DIM>; in TEST()
342 using PointType = primal::Point<CoordType, DIM>; in TEST()
343 using VectorType = primal::Vector<CoordType, DIM>; in TEST()
[all …]
H A Dprimal_vector.cpp22 using VectorType = primal::Vector<double, DIM>; in check_vector_policy()
45 typedef primal::Vector<CoordType, DIM> QVec; in TEST()
130 typedef primal::Vector<CoordType, DIM> QVec; in TEST()
165 typedef primal::Vector<CoordType, DIM> QVec; in TEST()
188 typedef primal::Vector<CoordType, DIM> QVec; in TEST()
202 typedef primal::Vector<CoordType, DIM> QVec; in TEST()
288 typedef primal::Vector<double, DIM> QVec; in TEST()
304 using QPt = primal::Point<double, DIM>; in TEST()
305 using QVec = primal::Vector<double, DIM>; in TEST()
336 using QPt = primal::Point<double, DIM>; in TEST()
[all …]
/dports/math/SCIP/scip-7.0.3/src/scip/
H A Dprimal.c57 assert(primal->nsols <= primal->solssize); in ensureSolsSize()
80 assert(primal->npartialsols <= primal->partialsolssize); in ensurePartialsolsSize()
256 primal->sols[j] = primal->sols[j-1]; in sortPrimalSols()
734 primal->nsols = primal->nsols + 1; in primalAddSol()
740 primal->sols[pos] = primal->sols[pos-1]; in primalAddSol()
772 insertpos, primal->nsols, primal->nsolsfound); in primalAddSol()
860 primal->sols[pos] = primal->sols[pos-1]; in primalAddOrigSol()
871 insertpos, primal->nsols, primal->nsolsfound); in primalAddOrigSol()
901 primal->partialsols[primal->npartialsols] = sol; in primalAddOrigPartialSol()
1016 assert(primal->sols != NULL || primal->nsols == 0); in primalExistsSol()
[all …]
H A Dprimal.h67 SCIP_PRIMAL* primal, /**< primal data */
85 SCIP_PRIMAL* primal, /**< primal data */
100 SCIP_PRIMAL* primal, /**< primal data */
115 SCIP_PRIMAL* primal, /**< primal data */
130 SCIP_PRIMAL* primal, /**< primal data */
139 SCIP_PRIMAL* primal, /**< primal data */
147 SCIP_PRIMAL* primal /**< primal data */
152 SCIP_PRIMAL* primal, /**< primal data */
161 SCIP_PRIMAL* primal, /**< primal data */
179 SCIP_PRIMAL* primal, /**< primal data */
[all …]
/dports/math/cgal/CGAL-5.3/include/CGAL/boost/graph/
H A DDual.h330 const typename Dual<P>::Primal& primal = dual.primal();
339 const typename Dual<P>::Primal& primal = dual.primal();
340 return face(opposite(h,primal),primal);
349 const typename Dual<P>::Primal& primal = dual.primal();
350 return face(halfedge(h,primal),primal);
358 const typename Dual<P>::Primal& primal = dual.primal();
359 return face(opposite(halfedge(h,primal),primal),primal);
368 return opposite(halfedge(v, primal),primal);
425 return prev(opposite(h,primal),primal);
434 return opposite(next(h,primal),primal);
[all …]
/dports/devel/vcglib/vcglib-2020.09/vcg/complex/algorithms/
H A Ddual_meshing.h62 int indexF=vcg::tri::Index(primal,f); in ComposeFace()
77 VertMap.resize(primal.face.size(),-1); in CreateFaceVert()
79 VertFace.resize(primal.vert.size(),-1); in CreateFaceVert()
80 for (size_t i=0;i<primal.face.size();i++) in CreateFaceVert()
89 pos+=primal.face[i].P(j); in CreateFaceVert()
113 int indexV=vcg::tri::Index(primal,primal.face[i].V(j)); in CreateFaceVert()
121 static void MakeDual(PolyMeshType &primal,
127 vcg::tri::RequirePolygonalMesh(primal);
129 vcg::tri::RequireFFAdjacency(primal);
144 if (primal.vert[i].IsB())continue;
[all …]
/dports/science/axom/axom-0.6.1/src/axom/klee/
H A DGeometryOperators.hpp144 Translation(const primal::Vector3D &offset,
159 primal::Vector3D m_offset;
181 const primal::Point3D &center,
182 const primal::Vector3D &axis,
214 primal::Point3D m_center;
215 primal::Vector3D m_axis;
321 SliceOperator(const primal::Point3D &origin,
323 const primal::Vector3D &up,
358 primal::Point3D m_origin;
359 primal::Vector3D m_normal;
[all …]
/dports/math/openmesh/OpenMesh-8.1/src/OpenMesh/Tools/Dualizer/
H A DmeshDualT.hh88 PolyMesh_ArrayKernelT<MeshTraits>* MeshDual (PolyMesh_ArrayKernelT<MeshTraits> &primal) in MeshDual() argument
96 primal.add_property(primalToDual); in MeshDual()
99 …pename PolyMesh_ArrayKernelT<MeshTraits>::ConstFaceIter fit=primal.faces_begin(); fit!=primal.face… in MeshDual()
103 …for(typename PolyMesh_ArrayKernelT<MeshTraits>::ConstFaceVertexIter vit=primal.cfv_iter(*fit); vit… in MeshDual()
104 centerPoint += primal.point(*vit); in MeshDual()
107 primal.property(primalToDual, *fit) = dual->add_vertex(centerPoint); in MeshDual()
112 …me PolyMesh_ArrayKernelT<MeshTraits>::ConstVertexIter vit=primal.vertices_begin(); vit!=primal.ver… in MeshDual()
114 if(!primal.is_boundary(*vit)) in MeshDual()
117 …for(typename PolyMesh_ArrayKernelT<MeshTraits>::ConstVertexFaceIter fit=primal.cvf_iter(*vit); fit… in MeshDual()
118 face_vhandles.push_back(primal.property(primalToDual, *fit)); in MeshDual()
[all …]
/dports/science/afni/afni-AFNI_21.3.16/src/svm/
H A Dsvm_loqo.c33 double *primal=0,*dual=0; variable
101 (double *)primal,(double *)dual,
151 epsilon_loqo=primal[i]*2.0;
156 if(primal[i]<=(0+epsilon_loqo)) {
157 primal[i]=0;
160 primal[i]=qp->opt_up[i];
166 obj_after+=(qp->opt_g0[i]*primal[i]);
167 obj_after+=(0.5*primal[i]*primal[i]*qp->opt_g[i*qp->opt_n+i]);
169 obj_after+=(primal[j]*primal[i]*qp->opt_g[j*qp->opt_n+i]);
177 primal[i]=qp->opt_xinit[i];
[all …]
H A Dsvm_hideo.c43 double *primal=0,*dual=0; variable
100 primal[i]=0;
213 return(primal);
460 primal[i]=primal[j];
472 temp[i]=primal[i];
632 primal[i]=low[i];
635 primal[i]=up[i];
665 primal[i]=low[i];
668 primal[i]=up[i];
730 primal[i]=low[i];
[all …]
/dports/math/sdpa/sdpa-7.3.8/
H A Dsdpa_parts.cpp467 primal = 1.0; in MehrotraPredictor()
514 primal = param.gammaStar * primal; in MehrotraCorrector()
537 primal = 1.0; in MehrotraCorrector()
575 double thetaMax = max((1.0-primal)*theta.primal, in MehrotraCorrector()
586 primal = min(primal,alphaMax); in MehrotraCorrector()
588 thetaMax = max((1.0-primal)*theta.primal, in MehrotraCorrector()
843 primal = fabs((1.0-alpha.primal)*primal); in update()
929 double primal = theta.primal; in update() local
959 / ((primal+(1.0-primal)*omega)*etaDual + xMatzMat); in update()
996 double primal = theta.primal; in update() local
[all …]
/dports/math/cgal/CGAL-5.3/examples/BGL_surface_mesh/
H A Dsurface_mesh_dual.cpp42 Mesh primal; in main() local
43 if(!CGAL::IO::read_polygon_mesh(filename, primal)) in main()
49 Dual dual(primal); in main()
50 FiniteDual finite_dual(dual,noborder<Mesh>(primal)); in main()
61 …std::cout << e << " in primal: " << source(e,primal) << " -- " << target(e,primal) << … in main()
68 std::cout << e << " " << source(e,primal) << " " << source(e,finite_dual) << std::endl; in main()
73 fccmap = primal.add_property_map<face_descriptor,int>("f:CC").first; in main()
77 for(face_descriptor f : faces(primal)) { in main()
82 vccmap = primal.add_property_map<vertex_descriptor,int>("v:CC").first; in main()
83 num = connected_components(primal, vccmap); in main()
[all …]
/dports/science/axom/axom-0.6.1/src/axom/quest/tests/
H A Dquest_test_utilities.hpp31 namespace primal = axom::primal;
159 primal::Point<double, DIM> randomSpacePt(double beg, double end) in randomSpacePt()
161 primal::Point<double, DIM> pt; in randomSpacePt()
171 primal::Point<double, DIM> getCentroid(const primal::Point<double, DIM>& pt0, in getCentroid()
174 return primal::Point<double, DIM>((pt0.array() + pt1.array()) / 2.); in getCentroid()
181 primal::Point<double, DIM> getCentroid(const primal::Point<double, DIM>& pt0, in getCentroid()
193 primal::Point<double, DIM> getCentroid(const primal::Point<double, DIM>& pt0, in getCentroid()
198 return primal::Point<double, DIM>( in getCentroid()
210 using SpacePt = primal::Point<double, 3>; in make_octahedron_mesh()
211 using SpaceTriangle = primal::Triangle<double, 3>; in make_octahedron_mesh()
[all …]
/dports/math/cgal/CGAL-5.3/include/CGAL/Convex_hull_3/dual/
H A Dhalfspace_intersection_with_constructions_3.h40 build_dual_polyhedron(const Polyhedron & primal,
50 …:property_map<Polyhedron, vertex_point_t>::const_type vpm_primal = get(CGAL::vertex_point, primal);
56 for(face_descriptor fd : faces( primal)){
57 halfedge_descriptor h = halfedge(fd,primal);
58 Plane_3 p (get(vpm_primal, target(h, primal)),
59 get(vpm_primal, target(next(h, primal), primal)),
60 get(vpm_primal, target(next(next(h, primal), primal), primal)));
72 for(vertex_descriptor vd : vertices(primal)) {
76 for(face_descriptor fd : faces_around_target(halfedge(vd,primal),primal)){
/dports/math/SCIP/scip-7.0.3/check/coverage/settings/
H A Dheurlprows.set3 # frequency for calling primal heuristic <actconsdiving> (-1: never, 0: only at depth freqofs)
7 # frequency for calling primal heuristic <clique> (-1: never, 0: only at depth freqofs)
11 # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
23 # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
43 # frequency for calling primal heuristic <dins> (-1: never, 0: only at depth freqofs)
47 # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
87 # frequency for calling primal heuristic <zeroobj> (-1: never, 0: only at depth freqofs)
135 # frequency for calling primal heuristic <octane> (-1: never, 0: only at depth freqofs)
151 # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
163 # frequency for calling primal heuristic <rins> (-1: never, 0: only at depth freqofs)
[all …]

12345678910>>...49