| /dports/math/polymake/polymake-4.5/apps/polytope/src/ |
| H A D | check_poly.cc | 41 simplicial, // k-simplicity or k-simpleness in check_inc()
96 for (simplicial = 0; in check_inc()
97 simplicial < d && c[d-1-simplicial] == simplicial+2; in check_inc()
98 simplicial++); in check_inc()
105 cout << simplicial << ( primal ? "-simplicial, " : "-simple, " ) in check_inc()
115 && simplicial > 0)) { in check_inc()
124 p.take("SIMPLICIAL") << (simplicial >= d-1); in check_inc()
126 p.take("SIMPLICIALITY") << simplicial; in check_inc()
130 p.take("SIMPLE") << (simplicial >= d-1); in check_inc()
132 p.take("SIMPLICITY") << simplicial; in check_inc()
|
| H A D | h_vector.cc | 27 Vector<Integer> h_from_f_vec(const Vector<Integer>& f, const bool simplicial) in h_from_f_vec() argument
35 *h_k += sign * Integer::binom(d-i,d-k) * (simplicial ? f[i-1] : f[d-i]); in h_from_f_vec()
42 Vector<Integer> f_from_h_vec(const Vector<Integer>& h, const bool simplicial) in f_from_h_vec() argument
51 if (simplicial) in f_from_h_vec()
128 void h_from_f_vector(BigObject p, bool simplicial) in h_from_f_vector() argument
131 Vector<Integer> h=h_from_f_vec(f,simplicial); in h_from_f_vector()
133 if (simplicial) in h_from_f_vector()
140 void f_from_h_vector(BigObject p, bool simplicial) in f_from_h_vector() argument
143 if (simplicial) { in f_from_h_vector()
151 p.take("F_VECTOR") << f_from_h_vec(h,simplicial); in f_from_h_vector()
|
| H A D | stack.cc | 88 const bool simplicial = p_in.give("SIMPLICIAL"),
90 if (!simplicial && !cubical)
107 const Int n_vertices_out = n_vertices + n_stack_facets * (simplicial ? 1 : 1L << dim-1),
108 n_facets_out = n_facets + n_stack_facets * (simplicial ? dim-1 : 2*(dim-1));
133 if (simplicial) {
192 p_out.take("SIMPLICIAL") << simplicial;
|
| /dports/math/R-cran-ddalpha/ddalpha/man/ |
| H A D | depth.space.simplicial.Rd | 1 \name{depth.space.simplicial}
2 \alias{depth.space.simplicial}
7 Calculates the representation of the training classes in depth space using simplicial depth.
10 depth.space.simplicial(data, cardinalities, exact = F, k = 0.05, seed = 0)
30 The depth representation is calculated in the same way as in \code{\link{depth.simplicial}}, see 'R…
43 …{ddalpha.classify}} for application, \code{\link{depth.simplicial}} for calculation of simplicial …
53 # Get depth space using simplicial depth
54 depth.space.simplicial(data, c(10, 10))
58 depth.space.simplicial(data[,1:2], cardinalities)
|
| H A D | depth.simplicial.Rd | 1 \name{depth.simplicial}
2 \alias{depth.simplicial}
7 Calculates the simplicial depth of points w.r.t. a multivariate data set.
10 depth.simplicial(x, data, exact = F, k = 0.05, seed = 0)
30 Calculates simplicial depth. Simplicial depth is counted as a probability that a point lies in a si…
49 \code{\link{depth.simplicialVolume}} for calculation of simplicial volume depth.
72 depths <- depth.simplicial(x, data, exact = TRUE)
76 depths <- depth.simplicial(x, data, exact = FALSE, k = 0.2)
|
| H A D | shape.fd.analysis.Rd | 6 method = c("halfspace", "simplicial"), approx = 0, title = "",
33 the halfspace depth, or \code{simplicial} for the simplicial depth.}
53 \item \code{Simpl_FD} the first order integrated depth based on the simplicial depth,
55 \item \code{Simpl_ID} the first order infimal depth based on the simplicial depth,
58 …pointwise univariate simplicial depths used for the computation of \code{Simpl_FD} and \code{Simpl…
67 \item \code{Simpl_FD} the second order integrated depth based on the simplicial depth,
69 \item \code{Simpl_ID} the second order infimal depth based on the simplicial depth,
72 …pointwise bivariate simplicial depths used for the computation of \code{Simpl_FD} and \code{Simpl_…
|
| H A D | depth..Rd | 30 ## simplicial depth
31 # depth.simplicial(x, data, exact = F, k = 0.05, seed = 0)
33 ## simplicial volume depth
77 \code{\link{depth.simplicial}}
|
| H A D | depth.sample.Rd | 21 Faster implementation of the halfspace and the simplicial depth. Computes the depth
25 The function returns vectors of sample halfspace and simplicial depth values.
46 \code{\link{depth.simplicial}}
|
| H A D | depth.zonoid.Rd | 43 \code{\link{depth.simplicial}} for calculation of simplicial depth.
45 \code{\link{depth.simplicialVolume}} for calculation of simplicial volume depth.
|
| /dports/math/gap/gap-4.11.0/pkg/SCO-2019.09.02/gap/ |
| H A D | SimplicialSet.gi | 28 ## The constructor for simplicial sets based on an orbifold triangulation <A>ot</A>.
36 ## <The simplicial set of the orbifold triangulation "Teardrop", computed up to d\
75 ## This returns the components of dimension <A>i</A> of the simplicial set <A>S</A>.
81 ## <The simplicial set of the orbifold triangulation "Teardrop", computed up to d\
91 ## <The simplicial set of the orbifold triangulation "Teardrop", computed up to d\
114 ## the simplicial set <A>S</A>. <A>S</A> is extended
118 ## <The simplicial set of the orbifold triangulation "Teardrop", computed up to d\
121 ## <The simplicial set of the orbifold triangulation "Teardrop", computed up to d\
168 ## This computes the components of the simplicial set <A>S</A>
174 ## <The simplicial set of the orbifold triangulation "Teardrop", computed up to d\
[all …]
|
| H A D | Matrices.gi | 17 ## element of a simplicial set. <A>mu</A> is the function <M>\mu</M> that
67 ## induced by the simplicial set <A>S</A>. If <A>d</A> is not given, the
71 ## <The simplicial set of the orbifold triangulation "Teardrop", computed up to d\
75 ## <The simplicial set of the orbifold triangulation "Teardrop", computed up to d\
133 ## induced by the simplicial set <A>S</A>. If <A>d</A> is not given, the
137 ## <The simplicial set of the orbifold triangulation "Teardrop", computed up to d\
141 ## <The simplicial set of the orbifold triangulation "Teardrop", computed up to d\
|
| /dports/math/gap/gap-4.11.0/pkg/simpcomp/lib/ |
| H A D | complex.gi | 5 ## GAP object type for simplicial complex
46 #print simplicial complex info (in compact format)
140 #simplicial complex -> string method
148 #print simplicial complex info
184 ## <Returns>the simplicial complex passed as argument upon success,
235 ## <Returns>the simplicial complex passed as argument upon success,
261 ## <Returns>the simplicial complex passed as argument upon success,
291 ## Forms the <Arg>value</Arg>-th simplicial cartesian power of
390 ## Forms the simplicial cartesian product of <Arg>complex1</Arg> and
453 ## Computes the union of two simplicial complexes by calling
[all …]
|
| H A D | operations.gd | 5 ## Operations on simplicial complexes.
13 ## <Heading>Operations on simplicial complexes</Heading>
15 ## The following functions perform operations on simplicial complexes. Most of them return simplic…
|
| H A D | operations.gi | 5 ## Operations on simplicial complexes.
82 ## <Returns>simplicial complex of type <C>SCSimplicialComplex</C> upon success, <K>fail</K> otherwi…
168 ## <Returns>simplicial complex of type <C>SCSimplicialComplex</C> upon success, <K>fail</K> otherwi…
256 ## <Returns>simplicial complex of type <C>SCSimplicialComplex</C> upon success, <K>fail</K> otherwi…
362 ## <Returns>simplicial complex of type <C>SCSimplicialComplex</C> upon success, <K>fail</K> otherwi…
484 ## <Returns>simplicial complex of type <C>SCSimplicialComplex</C> upon success, <K>fail</K> otherwi…
662 ## <Returns>simplicial complex of type <C>SCSimplicialComplex</C> upon success, <K>fail</K> otherwi…
713 ## <Returns>simplicial complex of type <C>SCSimplicialComplex</C> upon success, <K>fail</K> otherwi…
826 ## The Alexander dual of a simplicial complex <Arg>complex</Arg> with set of vertices <M>V</M> is t…
931 ## <Returns>simplicial complex of type <C>SCSimplicialComplex</C>, <K>fail</K> otherwise.</Returns>
[all …]
|
| H A D | blowups.gd | 14 ## In this chapter functions are provided to perform simplicial blowups as
28 ## For a very short introduction to simplicial blowups see
34 ## <Heading>Functions related to simplicial blowups</Heading>
|
| H A D | glprops.gi | 17 ## Computes a spanning tree of a connected simplicial complex <Arg>complex</Arg> using a greedy alg…
433 ## Returns the facets of a simplicial complex in the original vertex labeling.
697 ## Checks if a simplicial complex <Arg>complex</Arg> is pure.
1247 ## Checks if a simplicial complex <Arg>complex</Arg> is connected.
1359 Info(InfoSimpcomp,1,"SCIsStronglyConnected: argument must be a pure simplicial complex.");
1479 ## Computes the integral simplicial homology groups of a simplicial complex <Arg>complex</Arg>
1584 ## Computes the dual graph of the pure simplicial complex <Arg>complex</Arg>.
2206 ## Computes the generators of a simplicial complex in the standard vertex labeling.<P/>
2291 ## Computes the generators of a simplicial complex in the original vertex labeling.<P/>
2701 ## The boundary of a simplicial complex is defined as the simplicial complex consisting of all <M>d…
[all …]
|
| /dports/math/gap/gap-4.11.0/pkg/simpcomp/ |
| H A D | PackageInfo.g | 14 Subtitle := "A GAP toolbox for simplicial complexes",
74 …simplicial complexes. It allows the computation of many properties of simplicial complexes (such a…
76 Keywords := ["simplicial complexes","combinatorial topology", "combinatorial manifolds", "PL equiva…
90 LongTitle := "A GAP toolbox for simplicial complexes",
|
| /dports/math/polymake/polymake-4.5/apps/polytope/include/ |
| H A D | h_vector.h | 25 Vector<Integer> h_from_f_vec(const Vector<Integer>& f, bool simplicial);
26 Vector<Integer> f_from_h_vec(const Vector<Integer>& h, const bool simplicial);
|
| /dports/math/polymake/polymake-4.5/apps/topaz/rules/ |
| H A D | help.rules | 18 # @topic category functions/Producing a new simplicial complex from others
22 # With these clients you can create special examples of simplicial complexes and complexes belongin…
24 # @topic category functions/Producing a simplicial complex from other objects
|
| H A D | complex_properties.rules | 152 # Inclusion minimal non-faces (vertex subsets which are not faces of the simplicial complex).
176 # A simplicial complex is __pure__ if all its facets have the same dimension.
187 # The h-vector of the simplicial complex.
281 # Determines if this is a compact simplicial manifold with boundary.
289 # True if this is a [[PURE]] simplicial complex with the property that each ridge is
296 # True if this is a [[PURE]] simplicial complex with the property that each ridge is
488 # A geometric simplicial complex, i.e., a simplicial complex with a geometric realization.
494 # Coordinates for the vertices of the simplicial complex, such that the complex is
507 # Volume of a geometric simplicial complex.
517 # Count how many simplices of a geometric simplicial complex are unimodular.
[all …]
|
| /dports/math/gap/gap-4.11.0/pkg/simpcomp/doc/ |
| H A D | simpcomp.tex | 177 algorithm to collapse bounded simplicial complexes as well as the
208 user with a broad spectrum of functionality regarding simplicial
458 …{\small Figure 4. A simplicial complex (left) and a collection of simplices that does not form a s…
464 simplicial complex is said to be \emph{pure} if all facets are of the same dimension. A pure simpli…
3084 a simplicial complex upon success, \texttt{fail} otherwise.
4875 The boundary of a simplicial complex is defined as the simplicial complex
8383 This function computes the simplicial cohomology groups of a given simplicial
9094 …Checks if a simplicial complex \mbox{\texttt{\mdseries\slshape complex}} can be modified by bistel…
9225 a simplicial complex upon success, \texttt{fail} otherwise.
9456 a simplicial complex upon success, \texttt{fail} otherwise.
[all …]
|
| /dports/math/gfan/gfan0.6.2/src/ |
| H A D | bergman.h | 21 bool simplicial; variable
54 simplicial(false) in BergmanFan()
|
| /dports/math/gfanlib/gfan0.6.2/src/ |
| H A D | bergman.h | 21 bool simplicial; variable
54 simplicial(false) in BergmanFan()
|
| /dports/math/mfem/mfem-4.3/tests/unit/mesh/ |
| H A D | test_pmesh.cpp | 119 namespace simplicial namespace
185 simplicial::SolveDiffusionProblem(pmesh, x);
186 simplicial::SolveDiffusionProblem(pmesh_tet, x_tet);
|
| /dports/math/polymake/polymake-4.5/apps/polytope/scripts/ |
| H A D | analyze_this.pl | 84 my $simplicial = $poly->SIMPLICIAL ? "simplicial" : "not simplicial";
110 The polytope is $simplicial, $simple and $cubical.
|