summaryrefslogtreecommitdiff
path: root/drawing/src/lineSegmenter.cpp
blob: 47a9d624b12d8b2462684291e09c92d104af4e66 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
#include "lineSegmenter.h"

const vector <ofPolyline> & lineSegmenter::getSegments(int num,float coverage, float phase){
	//num - number of segments
	//coverage - amount that each segment fills it's slot from 0-1
	//phase - from 0-1

	//if the path is closed, we can make a segment that crosses the end/beginning
	//however we want to be able to deal with open paths

/*

segments 0...n - 1
phase 0...1

phase 0 

segment 0 is (0 -> coverage) / n
segment n - 1 is ((0 -> coverage) + (n-1)) /n

phase 1: has to be the loop target, it has to look identical

segment 0 is (1 -> coverage) / n
segment n - 1 is (1 - > coverage) + (n-1) 

*/


	segments.clear();

	for (int i=0;i<num;i++){
		float startIndex=line.getIndexAtPercent((phase+i)/num); //always <1
		float endPoint=(phase+i+coverage)/num; //can be >1
		float endIndex=line.getIndexAtPercent(endPoint>1.0f?endPoint-1.0f:endPoint);
		ofPolyline segment;
		segment.addVertex(line.getPointAtIndexInterpolated(startIndex));
		for (int j=(int)ceil(startIndex);j<(endPoint>1?line.size():(int)ceil(endIndex));j++){
			segment.addVertex(line[j]);
		}
		if (endPoint>1){
			segments.push_back(segment);
			segment.clear();
			for (int j=0;j<(int)ceil(endIndex);j++){
				segment.addVertex(line[j]);
			}
			segment.addVertex(line.getPointAtIndexInterpolated(endIndex));
		}
		else {	
			segment.addVertex(line.getPointAtIndexInterpolated(endIndex));
		}
		segments.push_back(segment);	
	}

	return segments;
}

void lineSegmenter::draw(){
	line.draw();
	return;
}

/*




*/