|
|
@ -137,7 +137,7 @@ void ofApp::update(){ |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
if(current_time - last_updated_time >= 0.1){ |
|
|
|
if(current_time - last_updated_time >= 1.0){ |
|
|
|
buildKDTree(); |
|
|
|
getNearestImages(); |
|
|
|
last_updated_time = current_time; |
|
|
@ -187,7 +187,7 @@ void ofApp::update(){ |
|
|
|
} |
|
|
|
|
|
|
|
if(ofGetElapsedTimef() > tsne_start_time + TNSE_DURATION){ |
|
|
|
tsne_iter_idx = (tsne_iter_idx + 1) % 9; |
|
|
|
tsne_iter_idx = (tsne_iter_idx + 1) % 3; |
|
|
|
updateTSNEPositions(nodes); |
|
|
|
} |
|
|
|
} |
|
|
@ -598,8 +598,8 @@ void ofApp::createNodes(std::string json_path){ |
|
|
|
tsne_points = tsne.run(tsne_input, dims, perplexity, theta, normalise, runManually); |
|
|
|
|
|
|
|
// Option 1: Using nested loops
|
|
|
|
for(size_t i = 0; i < 9; i++) { |
|
|
|
for(size_t t = 0; t <= 100; t++) { |
|
|
|
for(size_t i = 0; i < 3; i++) { |
|
|
|
for(size_t t = 0; t <= 300; t++) { |
|
|
|
tsne_points = tsne.iterate(); |
|
|
|
} |
|
|
|
point_iterations.push_back(tsne_points); |
|
|
|