Class CornerEdgePattern
- java.lang.Object
-
- gov.nih.mipav.view.renderer.WildMagic.Knees.PatternDetection
-
- gov.nih.mipav.view.renderer.WildMagic.Knees.CornerEdgePattern
-
- Direct Known Subclasses:
WeakConnectedEdgePatternHorizontal
public class CornerEdgePattern extends PatternDetection
-
-
Field Summary
-
Fields inherited from class gov.nih.mipav.view.renderer.WildMagic.Knees.PatternDetection
colNumber, rowNumber
-
-
Constructor Summary
Constructors Constructor Description CornerEdgePattern()
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description protected void
DFS_searchOnLeft(int[][] map, int x, int y, int xDim, int yDim, int[] x1, int[] x2, int[] y1, int[] y2, boolean[][] visited, int xDelimiter)
protected void
DFS_searchOnRight(int[][] map, int x, int y, int xDim, int yDim, int[] x1, int[] x2, int[] y1, int[] y2, boolean[][] visited, int xDelimiter)
int
findCornerEdge(int[][] map, int startX, int startY, int xDim, int yDim, int range)
protected boolean
isSafe_searchOnLeft(int[][] map, int x, int y, int xDim, int yDim, boolean[][] visited, int xDelimiter)
protected boolean
isSafe_searchOnRight(int[][] map, int x, int y, int xDim, int yDim, boolean[][] visited, int xDelimiter)
protected void
printMapOnLeft(int[][] map, int x, int y, int xDim, int yDim)
protected void
printMapOnRight(int[][] map, int x, int y, int xDim, int yDim)
protected void
printVisitedMapOnLeft(boolean[][] visited, int x, int y, int xDim, int yDim)
protected void
printVisitedMapOnRight(boolean[][] visited, int x, int y, int xDim, int yDim)
protected int
searchOnLeft(int[][] map, int x, int y, int xDim, int yDim, int[] x1, int[] x2, int[] y1, int[] y2)
protected int
searchOnRight(int[][] map, int x, int y, int xDim, int yDim, int[] x1, int[] x2, int[] y1, int[] y2)
int
test()
int
test1()
int
test2()
-
Methods inherited from class gov.nih.mipav.view.renderer.WildMagic.Knees.PatternDetection
DFS, isSafe, printMap, printVisitedMap
-
-
-
-
Method Detail
-
findCornerEdge
public int findCornerEdge(int[][] map, int startX, int startY, int xDim, int yDim, int range)
-
searchOnLeft
protected int searchOnLeft(int[][] map, int x, int y, int xDim, int yDim, int[] x1, int[] x2, int[] y1, int[] y2)
-
DFS_searchOnLeft
protected void DFS_searchOnLeft(int[][] map, int x, int y, int xDim, int yDim, int[] x1, int[] x2, int[] y1, int[] y2, boolean[][] visited, int xDelimiter)
-
isSafe_searchOnLeft
protected boolean isSafe_searchOnLeft(int[][] map, int x, int y, int xDim, int yDim, boolean[][] visited, int xDelimiter)
-
printMapOnLeft
protected void printMapOnLeft(int[][] map, int x, int y, int xDim, int yDim)
-
printMapOnRight
protected void printMapOnRight(int[][] map, int x, int y, int xDim, int yDim)
-
printVisitedMapOnLeft
protected void printVisitedMapOnLeft(boolean[][] visited, int x, int y, int xDim, int yDim)
-
printVisitedMapOnRight
protected void printVisitedMapOnRight(boolean[][] visited, int x, int y, int xDim, int yDim)
-
searchOnRight
protected int searchOnRight(int[][] map, int x, int y, int xDim, int yDim, int[] x1, int[] x2, int[] y1, int[] y2)
-
DFS_searchOnRight
protected void DFS_searchOnRight(int[][] map, int x, int y, int xDim, int yDim, int[] x1, int[] x2, int[] y1, int[] y2, boolean[][] visited, int xDelimiter)
-
isSafe_searchOnRight
protected boolean isSafe_searchOnRight(int[][] map, int x, int y, int xDim, int yDim, boolean[][] visited, int xDelimiter)
-
test
public int test()
-
test1
public int test1()
-
test2
public int test2()
-
-