Package de.lmu.ifi.dbs.elki.data.spatial

Examples of de.lmu.ifi.dbs.elki.data.spatial.SpatialComparable

118
119
120
121
122
123
124
125
126
127
128
    List<byte[]> zValuesList = ZCurve.zValues(valuesList);

    // map z-values
    final Map<SpatialComparable, byte[]> zValues = new HashMap<SpatialComparable, byte[]>();
    for(int i = 0; i < spatialObjects.size(); i++) {
      SpatialComparable o = spatialObjects.get(i);
      byte[] zValue = zValuesList.get(i);
      zValues.put(o, zValue);
    }

    // create a comparator
View Full Code Here
126
127
128
129
130
131
132
133
134
135
136
137
138
139
        final SpatialComparator compMin = new SpatialComparator(i, SpatialComparator.MIN);
        Collections.sort(minSorting, compMin);
        final SpatialComparator compMax = new SpatialComparator(i, SpatialComparator.MAX);
        Collections.sort(maxSorting, compMax);

        SpatialComparable mbr_min_left = minSorting.get(0);
        SpatialComparable mbr_min_right = minSorting.get(minSorting.size() - 1);
        SpatialComparable mbr_max_left = maxSorting.get(0);
        SpatialComparable mbr_max_right = maxSorting.get(maxSorting.size() - 1);

        for(int k = 1; k < entries.size() - minEntries; k++) {
          mbr_min_left = SpatialUtil.union(mbr_min_left, minSorting.get(k));
          mbr_min_right = SpatialUtil.union(mbr_min_right, minSorting.get(minSorting.size() - 1 - k));
          mbr_max_left = SpatialUtil.union(mbr_max_left, maxSorting.get(k));
View Full Code Here
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
        min[d - 1] = entries.get(from).getMin(d);
        max[d - 1] = entries.get(from).getMax(d);
      }

      for(int i = from + 1; i < to; i++) {
        SpatialComparable currMBR = entries.get(i);
        for(int d = 1; d <= min.length; d++) {
          if(min[d - 1] > currMBR.getMin(d)) {
            min[d - 1] = currMBR.getMin(d);
          }
          if(max[d - 1] < currMBR.getMax(d)) {
            max[d - 1] = currMBR.getMax(d);
          }
        }
      }
      return new HyperBoundingBox(min, max);
    }
View Full Code Here
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
    // Note: we deliberately get a cloned copy here, since we will modify it.
    double[] min = SpatialUtil.getMin(firstEntry);
    double[] max = SpatialUtil.getMax(firstEntry);

    for(int i = 1; i < getNumEntries(); i++) {
      SpatialComparable mbr = getEntry(i);
      for(int d = 1; d <= dim; d++) {
        if(min[d - 1] > mbr.getMin(d)) {
          min[d - 1] = mbr.getMin(d);
        }
        if(max[d - 1] < mbr.getMax(d)) {
          max[d - 1] = mbr.getMax(d);
        }
      }
    }
    return new HyperBoundingBox(min, max);
  }
View Full Code Here
147
148
149
150
151
152
153
154
155
156
157
   * @param rtree Rtree to visualize
   * @param entry Current entry
   * @param depth Current depth
   */
  private void visualizeRTreeEntry(SVGPlot svgp, Element layer, Projection2D proj, AbstractRStarTree<? extends N, E> rtree, E entry, int depth) {
    SpatialComparable mbr = entry;

    if(fill) {
      Element r = SVGHyperCube.drawFilled(svgp, INDEX + depth, proj, new Vector(SpatialUtil.getMin(mbr)), new Vector(SpatialUtil.getMax(mbr)));
      layer.appendChild(r);
    }
View Full Code Here
143
144
145
146
147
148
149
150
151
152
153
   * @param rtree Rtree to visualize
   * @param entry Current entry
   * @param depth Current depth
   */
  private void visualizeRTreeEntry(SVGPlot svgp, Element layer, Projection2D proj, AbstractRStarTree<? extends N, E> rtree, E entry, int depth) {
    SpatialComparable mbr = entry;

    if(fill) {
      Element r = SVGHyperCube.drawFilled(svgp, INDEX + depth, proj, SpatialUtil.getMin(mbr), SpatialUtil.getMax(mbr));
      layer.appendChild(r);
    }
View Full Code Here
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
    // Heap of candidates
    TopBoundedHeap<DoubleIntPair> candidates = new TopBoundedHeap<DoubleIntPair>(numCandidates, Collections.reverseOrder());
    for(int i = 0; i < size; i++) {
      // Existing object and extended rectangle:
      SpatialComparable entry = getter.get(options, i);
      HyperBoundingBox mbr = SpatialUtil.union(entry, obj);
      // Area increase
      final double inc_area = SpatialUtil.volume(mbr) - SpatialUtil.volume(entry);
      candidates.add(new DoubleIntPair(inc_area, i));
    }

    // R*-Tree: overlap increase for leaves.
    int best = -1;
    double least_overlap = Double.POSITIVE_INFINITY;
    double least_areainc = Double.POSITIVE_INFINITY;
    double least_area = Double.POSITIVE_INFINITY;
    // least overlap increase, on reduced candidate set:
    while(!candidates.isEmpty()) {
      DoubleIntPair pair = candidates.poll();
      final double inc_area = pair.first;

      // Existing object and extended rectangle:
      SpatialComparable entry = getter.get(options, pair.second);
      HyperBoundingBox mbr = SpatialUtil.union(entry, obj);
      // Compute relative overlap increase.
      double overlap_wout = 0.0;
      double overlap_with = 0.0;
      for(int k = 0; k < size; k++) {
        if(pair.second != k) {
          SpatialComparable other = getter.get(options, k);
          overlap_wout += SpatialUtil.relativeOverlap(entry, other);
          overlap_with += SpatialUtil.relativeOverlap(mbr, other);
        }
      }
      double inc_overlap = overlap_with - overlap_wout;
View Full Code Here
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
    double least_areainc = Double.POSITIVE_INFINITY;
    double least_area = Double.POSITIVE_INFINITY;
    // least overlap increase, on reduced candidate set:
    for(int i = 0; i < size; i++) {
      // Existing object and extended rectangle:
      SpatialComparable entry = getter.get(options, i);
      HyperBoundingBox mbr = SpatialUtil.union(entry, obj);
      // Compute relative overlap increase.
      double overlap_wout = 0.0;
      double overlap_with = 0.0;
      for(int k = 0; k < size; k++) {
        if(i != k) {
          SpatialComparable other = getter.get(options, k);
          overlap_wout += SpatialUtil.relativeOverlap(entry, other);
          overlap_with += SpatialUtil.relativeOverlap(mbr, other);
        }
      }
      double inc_overlap = overlap_with - overlap_wout;
View Full Code Here
64
65
66
67
68
69
70
71
72
73
74
    // As in R-Tree, with a slight modification for ties
    double leastEnlargement = Double.POSITIVE_INFINITY;
    double minArea = -1;
    int best = -1;
    for(int i = 0; i < size; i++) {
      SpatialComparable entry = getter.get(options, i);
      double enlargement = SpatialUtil.enlargement(entry, obj);
      if(enlargement < leastEnlargement) {
        leastEnlargement = enlargement;
        best = i;
        minArea = SpatialUtil.volume(entry);
View Full Code Here
60
61
62
63
64
65
66
67
68
69
70
    final int size = getter.size(options);
    assert (size > 0) : "Choose from empty set?";
    double leastEnlargement = Double.POSITIVE_INFINITY;
    int best = -1;
    for(int i = 0; i < size; i++) {
      SpatialComparable entry = getter.get(options, i);
      double enlargement = SpatialUtil.enlargement(entry, obj);
      if(enlargement < leastEnlargement) {
        leastEnlargement = enlargement;
        best = i;
      }
View Full Code Here
TOP

Related Classes of de.lmu.ifi.dbs.elki.data.spatial.SpatialComparable

  • de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.AbstractRStarTreeNode
  • de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.bulk.ZCurveBulkSplit
  • de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.strategies.insert.ApproximativeLeastOverlapInsertionStrategy
  • de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.strategies.insert.LeastEnlargementInsertionStrategy
  • de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.strategies.insert.LeastEnlargementWithAreaInsertionStrategy
  • de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.strategies.insert.LeastOverlapInsertionStrategy
  • de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.util.TopologicalSplitter$Split
  • de.lmu.ifi.dbs.elki.math.spacefillingcurves.AbstractSpatialSorter
  • de.lmu.ifi.dbs.elki.visualization.visualizers.scatterplot.index.TreeMBRVisualization
  • de.lmu.ifi.dbs.elki.visualization.visualizers.vis2d.TreeMBRVisualization
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.