Package me.uits.aiphial.imaging

Examples of me.uits.aiphial.imaging.LuvPoint

65
66
67
68
69
70
71
72
73
74
75
        System.out.println("startedted");

        Set<LuvPoint> unprocesed = new HashSet<LuvPoint>(unorderedBoundary.size());
        unprocesed.addAll(unorderedBoundary);
        Path path = new Path();
        LuvPoint elem = null;
        while (!unprocesed.isEmpty())
        {
            if (elem == null)
            {
                elem = unprocesed.iterator().next();
View Full Code Here
255
256
257
258
259
260
261
262
263
264
265
            cunsumeNode();
            System.out.println("\t:Node " + node.number + " merged: branch expected but wasn't found!");
            return getReservedBranch(unprocessed);
        } else
        {
            LuvPoint result = nearest.iterator().next();

            if (node.b1.isEmpty())
            {
                node.lead = node.b1.listIterator();
                System.out.println("in " + node.number + " changed to 1");
View Full Code Here
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
        while (!unprocesed.isEmpty())
        {
            List<LuvPoint> resultCountour = new ArrayList(boundary.size());
            countuors.add(resultCountour);
            LuvPoint onboundary = unprocesed.iterator().next();

            LuvPoint firstPoint = onboundary;

            resultCountour.add(firstPoint);
            unprocesed.remove(firstPoint);

            LuvPoint prevprev = null;
            LuvPoint prev = firstPoint;
            while (true)
            {
                LuvPoint next = getNextPoint(prev, prevprev);

                if (next == null)
                {
                    break;
                }
View Full Code Here
127
128
129
130
131
132
133
134
135
136
137
    }


    private LuvPoint getNextPoint(LuvPoint cur, LuvPoint prev)
    {
        LuvPoint result = null;
     
            result = getStepFromQeury(clustersMap.getPointsMap().get8CouterClockwise(cur), cur, prev);
        return result;
View Full Code Here
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
    }

    private LuvPoint getStepFromQeury(CircleList<LuvPoint> cc4, LuvPoint cur, LuvPoint pstep)
    {

        LuvPoint result = null;
        Iterator<LuvPoint> iterator;

        if (pstep == null)
        {
            iterator = cc4.iterator();

            Iterable<LuvPoint> nearest4 = clustersMap.getPointsMap().get4Nearest(cur);
            LuvPoint in4outer = null;
            for (LuvPoint luvPoint : nearest4)
            {
                if (clustersMap.getAt(luvPoint) != cluster)
                {
                    in4outer = luvPoint;
                    break;
                }
            }
            if (in4outer != null)
            {
                iterator = cc4.iterator(in4outer);
            }

        } else
        {
            iterator = cc4.iterator(pstep);
        }

        LuvPoint first = iterator.next();
        LuvPoint prev = first;

        while (iterator.hasNext())
        {
            LuvPoint curr = iterator.next();
            if (clustersMap.getAt(prev) != cluster && clustersMap.getAt(curr) == cluster)
            {
                result = curr;
                break;
            }
View Full Code Here
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
        Set<LuvPoint> processed = new HashSet<LuvPoint>();

        while (!unprocessed.isEmpty())
        {
            LuvPoint first = unprocessed.iterator().next();

            result.add(first);
            unprocessed.remove(first);

            List<LuvPoint> nonBoundary = getNonBoundary(result, cluster);

            while (true)
            {
                if (nonBoundary.isEmpty())
                {
                    nonBoundary = getNonBoundary(result, cluster);
                }
                if (nonBoundary.isEmpty())
                {
                    break;
                }

                LuvPoint anynb = nonBoundary.iterator().next();
                nonBoundary.remove(anynb);

                Collection<LuvPoint> nearestWithinCluster = clustersMap.get8NearestWithinCluster(cluster, anynb);

                nearestWithinCluster = filterExist(processed, nearestWithinCluster);
View Full Code Here
186
187
188
189
190
191
192
193
194
195
196
    }

    private void addifexist(List<LuvPoint> result, PointsMap pm, int x, int y)
    {
        LuvPoint at = pm.getAt(x, y);
        if (at != null)
        {
            result.add(at);
        }
    }
View Full Code Here
200
201
202
203
204
205
206
207
208
209
210
            //for multithreading
            Collection<Collection<LuvPoint>> countourscopy = new ArrayList<Collection<LuvPoint>>(countours);
            for (Collection<LuvPoint> countour : countourscopy)
            {
                Polygon polygon = new Polygon();
                LuvPoint last = null;

                g.setColor(Color.LIGHT_GRAY);

                //for multithreading
                countour = new ArrayList<LuvPoint>(countour);
View Full Code Here
64
65
66
67
68
69
70
71
72
73
74
       

        Set<LuvPoint> unprocesed = new HashSet<LuvPoint>(unorderedBoundary.size());
        unprocesed.addAll(unorderedBoundary);
        Path2 path = new Path2();
        LuvPoint elem = null;
        while (!unprocesed.isEmpty())
        {
            if (elem == null)
            {
                elem = unprocesed.iterator().next();
View Full Code Here
115
116
117
118
119
120
121
            x += luvPoint.getX();
            y += luvPoint.getY();
            n++;
        }

        return new LuvPoint(x / n, y / n, null);
    }
View Full Code Here
TOP

Related Classes of me.uits.aiphial.imaging.LuvPoint

  • me.uits.aiphial.imaging.boundary.BugInnerBO
  • me.uits.aiphial.imaging.boundary.PointsMap
  • MyImage.ClusterPanelDebug
  • MyImage.utls.BoundaryOrderer
  • MyImage.utls.BoundaryOrderer1
  • MyImage.utls.BoundaryOrderer2
  • MyImage.utls.BugInnerBO
  • MyImage.utls.BugOuterBO
  • MyImage.utls.Path
  • MyImage.utls.Path2
    • 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.