25gsVector<unsigned> uniformSampleCount (
const gsVector<T>& lower,
26 const gsVector<T>& upper,
27 int numPoints = 1000);
30void uniformIntervals(
const gsVector<T>& lower,
const gsVector<T>& upper,
31 std::vector< std::vector<T> >& intervals,
int numIntervals = 1000);
53gsMatrix<T>
gsPointGrid( gsVector<T>
const & a, gsVector<T>
const & b,
54 gsVector<unsigned>
const & np );
57template<
class T>
inline
58gsMatrix<T>
gsPointGrid( T
const & t1, T
const & t2,
unsigned const & n = 100)
60 gsMatrix<T,1,2> ab(1,2); ab << t1, t2;
61 gsGridIterator<T,CUBE,1> pt(ab,n);
62 gsMatrix<T> rvo(ab.rows(), pt.numPoints() );
63 for(
index_t c = 0; pt; ++pt, ++c)
74 const gsVector<T>& upper,
75 int numPoints = 1000);
83template<
class T>
inline
86 gsGridIterator<T,CUBE> pt(ab,numPoints);
88 for(
index_t c = 0; pt; ++pt, ++c)
99template<
class T,
class CwiseContainer>
inline
102 gsGridIterator<T,CWISE> pt(cwise);
103 res.resize(cwise.size(), pt.numPoints() );
104 for(
index_t c = 0; pt; ++pt, ++c)
109template<
class T,
class CwiseContainer>
inline
121#ifndef GISMO_BUILD_LIB
122#include GISMO_HPP_HEADER(gsPointGrid.hpp)
A matrix with arbitrary coefficient type and fixed or dynamic size.
Definition gsMatrix.h:41
gsMatrix< T > gsPointGrid(gsVector< T > const &a, gsVector< T > const &b, gsVector< unsigned > const &np)
Construct a Cartesian grid of uniform points in a hypercube, using np[i] points in direction i.
Definition gsPointGrid.hpp:82
#define index_t
Definition gsConfig.h:32
Provides iteration over integer or numeric points in a (hyper-)cube.
This is the main header file that collects wrappers of Eigen for linear algebra.
The G+Smo namespace, containing all definitions for the library.
gsMatrix< T > uniformPointGrid(const gsVector< T > &lower, const gsVector< T > &upper, int numPoints=1000)
Definition gsPointGrid.hpp:94