Field Detail

• pt

  protected final HashMap<PointMatch,Tile<M extends AbstractModel<M>>> pt

  Tiles are a collection of PointMatches that share a common transformation model. In this implementation, each tile has the size of the whole mesh. By this means, all tiles initially share the same reference frame/ coordinate system. PointMatches are used for two completely different things: 1. Being the vertices which span the mesh and are thus required to find the affine transform inside each of the triangles. The PointMatches in a, l and pt are meant to be these vertices of the mesh. 2. Being actual point correspondences that define the local rigid transformations of each "tile".

• error

  protected double error

• modelClass

  protected final Class<M extends AbstractModel<M>> modelClass

Constructor Detail

• MovingLeastSquaresMesh

  public MovingLeastSquaresMesh(Class<M> modelClass,
                                int numX,
                                int numY,
                                double width,
                                double height)

• MovingLeastSquaresMesh

  public MovingLeastSquaresMesh(Class<M> modelClass,
                                int numX,
                                double width,
                                double height)

Method Detail

• getVerticeModelMap

  public final HashMap<PointMatch,Tile<M>> getVerticeModelMap()

• getVertices

  public final Set<PointMatch> getVertices()

• numVertices

  public final int numVertices()

• getError

  public final double getError()

• getModelClass

  public final Class<M> getModelClass()

• weigh

  protected final double weigh(double d,
                               double alpha)

• findClosest

  public final Tile<M> findClosest(double[] there)

  What to use this method for: If you want to add a PointMatch between two Tiles t and o do the following. Tile t is a tile in pt, Tile o is whatever you want it to be. The PointMatch has p1 in Tile t and p2 in Tile o. To find Tile t being closest to some world coordinate double[] (x,y) search pt with findClosest(double[]). Then say t.addMatch(PointMatch) and o.add(PointMatch.flip())

• addMatchWeightedByDistance

  public final void addMatchWeightedByDistance(PointMatch pm,
                                               double alpha)

  Add a PointMatch to all Tiles weighted by its distance to the corresponding vertex. The distance weight is defined by 1/(|m.p1.l - vertex.p1.l|^2*alpha)

  Parameters:

  pm -

  alpha -

• updateModels

  public final void updateModels()
                          throws NotEnoughDataPointsException,
                                 IllDefinedDataPointsException

  Updates each vertex' transformation model by means of moving least squares.

  Throws:

  NotEnoughDataPointsException

  IllDefinedDataPointsException

• apply

  public final void apply(CoordinateTransform t)

  Apply an arbitrary coordinate transformation to each Tile's PointMatches. This coordinate transformation is not supposed to be compatible to modelClass. This method is intended to be used for initializing the mesh in case that further operations estimate a refined configuration.

  Parameters:

  t -