RISC JKU

at.jku.risc.stout.urauc.algo

Class Contour

  • All Implemented Interfaces:
    Cloneable


    public class Contour
    extends Object
    implements Cloneable
    A list of contour elements. This data structure is designed to do fast filter operations which are needed for subsequence determination. It uses a two dimensional cache of rectangular clippings of this contour. If the caching mechanism is used, then it has cubic worst case space complexity.
    (Remark: This could be done in a much more efficient way with only using two pairs of indexes instead of copying all the elements of the clipping into a new Contour object. Feel free to improve this!)
    Author:
    Alexander Baumgartner
    • Constructor Detail

      • Contour

        public Contour()
    • Method Detail

      • clear

        public void clear()
      • clip

        public Contour clip(Contour.ContourAtom cElem)
        Computes a rectangular clip which contains all the elements of this contour inside the rectangle (0,0), (Contour.ContourAtom.i-1, Contour.ContourAtom.j-1). The computed clip will be cached, so that this computation is only performed once.
        If iterAll is "false" then an admissibility test between the given Contour.ContourAtom and all the elements in the clip will be performed and the clip may be empty if there is no admissible combination.
      • size

        public int size()