M
- the transformation model of the tile.public class Tile<M extends Model<M>> extends Object implements Serializable
Modifier and Type | Field and Description |
---|---|
protected Set<Tile<?>> |
connectedTiles
|
protected double |
cost
The transfer error of this
Tile's AbstractModel as
estimated from weighted square point correspondence displacement. |
protected Set<PointMatch> |
matches
|
protected M |
model
The transformation
AbstractModel of the Tile . |
Modifier and Type | Method and Description |
---|---|
boolean |
addConnectedTile(Tile<?> t)
Add a
Tile to the set of connected tiles. |
boolean |
addMatch(PointMatch match)
Add one
PointMatch . |
boolean |
addMatches(Collection<PointMatch> more)
Add more
PointMatches . |
void |
apply()
Apply the current
AbstractModel to all local point coordinates. |
void |
apply(double amount)
Apply the current
AbstractModel to all local point coordinates. |
void |
connect(Tile<?> o,
Collection<PointMatch> m)
Connect two tiles by a set of point correspondences
|
Tile<?> |
findConnectedTile(PointMatch match)
Try to find the tile which is connected by a particular
PointMatch . |
void |
fitModel()
Update the transformation
AbstractModel . |
Set<Tile<?>> |
getConnectedTiles() |
double |
getCost() |
double |
getDistance() |
Set<PointMatch> |
getMatches() |
M |
getModel() |
static ArrayList<Set<Tile<?>>> |
identifyConnectedGraphs(Collection<? extends Tile<?>> tiles)
Identify the set of connected graphs that contains all given tiles.
|
boolean |
removeConnectedTile(Tile<?> t)
|
boolean |
removeMatch(PointMatch match)
Remove a
PointMatch . |
void |
setModel(M model) |
protected void |
traceConnectedGraph(Set<Tile<?>> graph)
Find all
Tile s that represent one connectivity graph by
recursively tracing the connectedTiles . |
void |
update()
Apply the current
AbstractModel to all local point coordinates. |
void |
update(double amount)
Apply the current
AbstractModel to all local point coordinates by weight. |
void |
updateCost()
|
protected M extends Model<M> model
AbstractModel
of the Tile
. All local
Points
in the Tile
share (and thus determine)
this common AbstractModel
.protected final Set<PointMatch> matches
protected double cost
Tile's
AbstractModel
as
estimated from weighted square point correspondence displacement.public Tile(M model)
model
- the transformation AbstractModel
of the Tile
.public final M getModel()
public final void setModel(M model)
public final Set<PointMatch> getMatches()
public final boolean addMatches(Collection<PointMatch> more)
PointMatches
.more
- the PointMatches
to be addedpublic final boolean addMatch(PointMatch match)
PointMatch
.match
- the PointMatch
to be addedpublic final boolean removeMatch(PointMatch match)
PointMatch
.match
- the PointMatch
to be removedpublic final boolean addConnectedTile(Tile<?> t)
t
- the new Tile
.public final boolean removeConnectedTile(Tile<?> t)
t
- the Tile
to be removed.public Tile<?> findConnectedTile(PointMatch match)
PointMatch
.
Note that this method searches only the known connected tiles to limit
the cost of that anyway expensive search.match
- public final double getCost()
public final double getDistance()
public final void apply()
AbstractModel
to all local point coordinates.
This method does not recalculate the cost of the tile.public final void apply(double amount)
AbstractModel
to all local point coordinates.
This method does not recalculate the cost of the tile.public final void updateCost()
public final void update()
public final void update(double amount)
public final void fitModel() throws NotEnoughDataPointsException, IllDefinedDataPointsException
AbstractModel
. That is, fit it to the
current set of PointMatches
.protected final void traceConnectedGraph(Set<Tile<?>> graph)
Tile
s that represent one connectivity graph by
recursively tracing the connectedTiles
.graph
- public final void connect(Tile<?> o, Collection<PointMatch> m)
o
- m
- public static final ArrayList<Set<Tile<?>>> identifyConnectedGraphs(Collection<? extends Tile<?>> tiles)
tiles
- Copyright © 2015–2021 Fiji. All rights reserved.