LoopStructural 1.0.4__zip

Miniconda/envs/loop/Lib/site-packages/LoopStructural/interpolators/piecewiselinear_interpolator.py

@@ -0,0 +1,348 @@
+"""
+Piecewise linear interpolator
+"""
+import logging
+
+import numpy as np
+
+from LoopStructural.interpolators.discrete_interpolator import \
+    DiscreteInterpolator
+from LoopStructural.utils.helper import get_vectors
+
+logger = logging.getLogger(__name__)
+
+
+class PiecewiseLinearInterpolator(DiscreteInterpolator):
+    """
+
+    """
+    def __init__(self, mesh):
+        """
+        Piecewise Linear Interpolator
+        Approximates scalar field by finding coefficients to a piecewise linear
+        equation on a tetrahedral mesh. Uses constant gradient regularisation.
+
+        Parameters
+        ----------
+        mesh - TetMesh
+            interpolation support
+        """
+
+        self.shape = 'rectangular'
+        DiscreteInterpolator.__init__(self, mesh)
+        # whether to assemble a rectangular matrix or a square matrix
+        self.interpolator_type = 'PLI'
+        self.nx = len(self.support.nodes[self.region])
+        self.support = mesh
+
+        self.interpolation_weights = {'cgw': 0.1, 'cpw': 1., 'npw': 1.,
+                                      'gpw': 1., 'tpw': 1., 'ipw': 1.}
+        self.__str = 'Piecewise Linear Interpolator with %i unknowns. \n' % \
+                     self.nx
+
+    def __str__(self):
+        return self.__str
+
+    def copy(self):
+        return PiecewiseLinearInterpolator(self.support)
+
+    def _setup_interpolator(self, **kwargs):
+        """
+        Searches through kwargs for any interpolation weights and updates
+        the dictionary.
+        Then adds the constraints to the linear system using the
+        interpolation weights values
+        Parameters
+        ----------
+        kwargs -
+            interpolation weights
+
+        Returns
+        -------
+
+        """
+        # can't reset here, clears fold constraints
+        # self.reset()
+        logger.info("Setting up PLI interpolator for %s"%self.propertyname)
+        for key in kwargs:
+            if 'regularisation' in kwargs:
+                self.interpolation_weights['cgw'] = 0.1 * kwargs[
+                    'regularisation']
+            self.up_to_date = False
+            self.interpolation_weights[key] = kwargs[key]
+        if self.interpolation_weights['cgw'] > 0.:
+            self.up_to_date = False
+            self.add_constant_gradient(self.interpolation_weights['cgw'])
+            logger.info("Using constant gradient regularisation w = %f"
+                        %self.interpolation_weights['cgw'])
+        logger.info("Added %i gradient constraints, %i normal constraints,"
+                    "%i tangent constraints and %i value constraints"
+                    "to %s" % (self.n_g, self.n_n,
+                               self.n_t, self.n_i, self.propertyname))
+        self.add_gradient_ctr_pts(self.interpolation_weights['gpw'])
+        self.add_norm_ctr_pts(self.interpolation_weights['npw'])
+        self.add_ctr_pts(self.interpolation_weights['cpw'])
+        self.add_tangent_ctr_pts(self.interpolation_weights['tpw'])
+        self.add_interface_ctr_pts(self.interpolation_weights['ipw'])
+    def add_constant_gradient(self, w=0.1):
+        """
+        Add the constant gradient regularisation to the system
+
+        Parameters
+        ----------
+        w (double) - weighting of the cg parameter
+
+        Returns
+        -------
+
+        """
+        # iterate over all elements
+        A, idc, B = self.support.get_constant_gradient(region=self.region)
+        A = np.array(A)
+        B = np.array(B)
+        idc = np.array(idc)
+
+        gi = np.zeros(self.support.n_nodes)
+        gi[:] = -1
+        gi[self.region] = np.arange(0, self.nx)
+        idc = gi[idc]
+        outside = ~np.any(idc == -1, axis=1)
+
+        # w/=A.shape[0]
+        self.add_constraints_to_least_squares(A[outside, :] * w,
+                                              B[outside] * w, idc[outside, :],
+                                              name='regularisation')
+        return
+
+    def add_gradient_ctr_pts(self, w=1.0):
+        """
+        Adds gradient constraints to the least squares system with a weight
+        defined by w
+        Parameters
+        ----------
+        w : either numpy array of length number of
+
+        Returns
+        -------
+        Notes
+        -----
+        Gradient constraints add a constraint that the gradient of the
+        implicit function should
+        be orthogonal to the strike vector and the dip vector defined by the
+        normal.
+        This does not control the direction of the gradient and therefore
+        requires at least two other
+        value constraints OR a norm constraint for the interpolant to solve.
+        """
+
+        points = self.get_gradient_constraints()
+        if points.shape[0] > 0:
+            vertices, element_gradients, tetras, inside = self.support.get_tetra_gradient_for_location(points[:,:3])
+            #e, inside = self.support.elements_for_array(points[:, :3])
+            #nodes = self.support.nodes[self.support.elements[e]]
+            vecs = vertices[:, 1:, :] - vertices[:, 0, None, :]
+            vol = np.abs(np.linalg.det(vecs))  # / 6
+            # d_t = self.support.get_elements_gradients(e)
+            norm = np.linalg.norm(element_gradients, axis=2)
+            element_gradients /= norm[:, :, None]
+            # d_t *= vol[:,None,None]
+            strike_vector, dip_vector = get_vectors(points[:, 3:6])
+            A = np.einsum('ji,ijk->ik', strike_vector, element_gradients)
+
+            A *= vol[:, None]
+
+            gi = np.zeros(self.support.n_nodes).astype(int)
+            gi[:] = -1
+            gi[self.region] = np.arange(0, self.nx).astype(int)
+            w /= 3
+            idc = gi[tetras]
+            B = np.zeros(idc.shape[0])
+            outside = ~np.any(idc == -1, axis=1)
+            self.add_constraints_to_least_squares(A[outside, :] * w,
+                                                  B[outside], idc[outside, :],
+                                                  name = 'gradient')
+            A = np.einsum('ji,ijk->ik', dip_vector, element_gradients)
+            A *= vol[:, None]
+            # A+=A2
+            self.add_constraints_to_least_squares(A[outside, :] * w,
+                                          B[outside], idc[outside, :],
+                                                  name='gradient')
+            
+    def add_norm_ctr_pts(self, w=1.0):
+        """
+        Extracts the norm vectors from the interpolators p_n list and adds
+        these to the implicit
+        system
+
+        Parameters
+        ----------
+        w : double
+            weighting of the norm constraints in a least squares system
+
+        Returns
+        -------
+        Notes
+        -----
+        Controls the direction and magnitude of the norm of the scalar field
+        gradient.
+        This constraint can conflict with value constraints if the magnitude
+        of the vector doesn't
+        match with the value constraints added to the implicit system.
+        """
+
+        points = self.get_norm_constraints()
+        if points.shape[0] > 0:
+            vertices, element_gradients, tetras, inside = self.support.get_tetra_gradient_for_location(points[:, :3])
+            # e, inside = self.support.elements_for_array(points[:, :3])
+            # nodes = self.support.nodes[self.support.elements[e]]
+            vol = np.zeros(element_gradients.shape[0])
+            vecs = vertices[:, 1:, :] - vertices[:, 0, None, :]
+            vol = np.abs(np.linalg.det(vecs))  # / 6
+            # d_t = self.support.get_elements_gradients(e)
+            norm = np.zeros((element_gradients.shape[0],element_gradients.shape[1]))
+            norm[inside,:] = np.linalg.norm(element_gradients[inside,:,:], axis=2)
+            element_gradients /= norm[:, :, None]
+
+            d_t = element_gradients
+            d_t[inside,:,:] *= vol[inside, None, None]
+            # add in the element gradient matrix into the inte
+            idc = np.tile(tetras[:,:], (3, 1, 1))
+            idc = idc.swapaxes(0,1)
+            # idc = self.support.elements[e]
+            gi = np.zeros(self.support.n_nodes).astype(int)
+            gi[:] = -1
+            gi[self.region] = np.arange(0, self.nx).astype(int)
+            w /= 3
+            idc = gi[idc]
+            outside = ~np.any(idc == -1, axis=2)
+            outside = outside[:, 0]
+            w /= 3
+
+            self.add_constraints_to_least_squares(d_t[outside, :, :] * w,
+                                                  points[outside, 3:6] * w *
+                                                  vol[outside, None],
+                                                  idc[outside],
+                                                  name='norm')
+
+    def add_ctr_pts(self, w=1.0):  # for now weight all value points the same
+        """
+        Adds value constraints to the least squares system
+
+        Parameters
+        ----------
+        w : double
+            weight
+
+        Returns
+        -------
+
+        """
+
+        # get elements for points
+        points = self.get_value_constraints()
+        if points.shape[0] > 1:
+            vertices, c, tetras, inside = self.support.get_tetra_for_location(points[:,:3])
+            # calculate volume of tetras
+            vecs = vertices[inside, 1:, :] - vertices[inside, 0, None, :]
+            vol = np.abs(np.linalg.det(vecs)) / 6
+            A = c[inside]
+            A *= vol[:,None]
+            idc = tetras[inside,:]
+            # now map the index from global to region create array size of mesh
+            # initialise as np.nan, then map points inside region to 0->nx
+            gi = np.zeros(self.support.n_nodes).astype(int)
+            gi[:] = -1
+
+            gi[self.region] = np.arange(0, self.nx)
+            idc = gi[idc]
+            outside = ~np.any(idc == -1, axis=1)
+            self.add_constraints_to_least_squares(A[outside,:] * w,
+                                                  points[inside,:][outside, 3] * w * vol[outside],
+                                                  idc[outside, :], name='value')
+
+    def add_interface_ctr_pts(self, w=1.0):  # for now weight all value points the same
+        """
+        Adds a constraint that defines all points with the same 'id' to be the same value
+        Sets all P1-P2 = 0 for all pairs of points
+
+        Parameters
+        ----------
+        w : double
+            weight
+
+        Returns
+        -------
+
+        """
+
+        # get elements for points
+        points = self.get_interface_constraints()
+        if points.shape[0] > 1:
+            vertices, c, tetras, inside = self.support.get_tetra_for_location(points[:,:3])
+            # calculate volume of tetras
+            vecs = vertices[inside, 1:, :] - vertices[inside, 0, None, :]
+            vol = np.abs(np.linalg.det(vecs)) / 6
+            A = c[inside]
+            A *= vol[:,None]
+            idc = tetras[inside,:]
+            for id in np.unique(points[np.logical_and(~np.isnan(points[:,3]),inside),3]):
+                mask = points[inside,3] == id
+                interface_A = A[None,mask,:] - A[mask,None,:]
+                interface_A = np.sum(interface_A,axis=0)
+                # interface_A = interface_A.reshape((interface_A.shape[0]*interface_A.shape[0],A.shape[1]))
+                interface_idc = idc[mask,:]
+
+                # now map the index from global to region create array size of mesh
+                # initialise as np.nan, then map points inside region to 0->nx
+                gi = np.zeros(self.support.n_nodes).astype(int)
+                gi[:] = -1
+
+                gi[self.region] = np.arange(0, self.nx)
+                interface_idc = gi[interface_idc]
+                # interface_idc = np.tile(interface_idc,(interface_idc.shape[0],1)).reshape(interface_A.shape)#flatten()
+                outside = ~np.any(interface_idc == -1, axis=1)
+                self.add_constraints_to_least_squares(interface_A[outside,:] * w,
+                                                      np.zeros(interface_A[outside,:].shape[0]),
+                                                      interface_idc[outside, :], name='value')
+
+    def add_gradient_orthogonal_constraint(self, points, vector, w=1.0,
+                                           B=0):
+        """
+        constraints scalar field to be orthogonal to a given vector
+
+        Parameters
+        ----------
+        position
+        normals
+        w
+        B
+
+        Returns
+        -------
+
+        """
+        if points.shape[0] > 0:
+            vertices, element_gradients, tetras, inside = self.support.get_tetra_gradient_for_location(points[:,:3])
+            #e, inside = self.support.elements_for_array(points[:, :3])
+            #nodes = self.support.nodes[self.support.elements[e]]
+            vecs = vertices[:, 1:, :] - vertices[:, 0, None, :]
+            vol = np.abs(np.linalg.det(vecs))  # / 6
+            # d_t = self.support.get_elements_gradients(e)
+            norm = np.linalg.norm(element_gradients, axis=2)
+            element_gradients /= norm[:, :, None]
+
+            A = np.einsum('ij,ijk->ik', vector, element_gradients)
+
+            A *= vol[:, None]
+
+            gi = np.zeros(self.support.n_nodes).astype(int)
+            gi[:] = -1
+            gi[self.region] = np.arange(0, self.nx).astype(int)
+            w /= 3
+            idc = gi[tetras]
+            B = np.zeros(idc.shape[0])
+            outside = ~np.any(idc == -1, axis=1)
+            self.add_constraints_to_least_squares(A[outside, :] * w,
+                                                  B[outside], idc[outside, :])
+
+