mirror of
				https://github.com/jhasse/poly2tri.git
				synced 2025-11-04 06:09:31 +01:00 
			
		
		
		
	removed temporary test code
This commit is contained in:
		@@ -39,7 +39,6 @@
 | 
			
		||||
#include <iostream>
 | 
			
		||||
using namespace std;
 | 
			
		||||
 | 
			
		||||
#include "test_shapes.h"
 | 
			
		||||
#include "../poly2tri/poly2tri.h"
 | 
			
		||||
using namespace p2t;
 | 
			
		||||
 | 
			
		||||
@@ -96,7 +95,7 @@ int main(int argc, char* argv[])
 | 
			
		||||
  if (argc != 5) {
 | 
			
		||||
    cout << "-== USAGE ==-" << endl;
 | 
			
		||||
    cout << "Load Data File: p2t filename center_x center_y zoom" << endl;
 | 
			
		||||
    cout << " Random Points: p2t random num_points width zoom" << endl;
 | 
			
		||||
    cout << "Example: ./build/p2t testbed/data/dude.dat 500 500 1" << endl;
 | 
			
		||||
    return 1;
 | 
			
		||||
  }
 | 
			
		||||
 | 
			
		||||
@@ -116,11 +115,6 @@ int main(int argc, char* argv[])
 | 
			
		||||
 | 
			
		||||
  vector<p2t::Point*> polyline;
 | 
			
		||||
    
 | 
			
		||||
  for(int i = 0; i < 25; i++) {
 | 
			
		||||
    polyline.push_back(new Point(outline[i*2],outline[i*2+1]));
 | 
			
		||||
  }
 | 
			
		||||
    
 | 
			
		||||
  /*
 | 
			
		||||
  if(random_distribution) {
 | 
			
		||||
    // Create a simple bounding box
 | 
			
		||||
    polyline.push_back(new Point(min,min));
 | 
			
		||||
@@ -154,8 +148,6 @@ int main(int argc, char* argv[])
 | 
			
		||||
    }
 | 
			
		||||
  }
 | 
			
		||||
  
 | 
			
		||||
  */
 | 
			
		||||
  
 | 
			
		||||
  cout << "Number of constrained edges = " << polyline.size() << endl;
 | 
			
		||||
  polylines.push_back(polyline);
 | 
			
		||||
 | 
			
		||||
@@ -178,26 +170,6 @@ int main(int argc, char* argv[])
 | 
			
		||||
   * STEP 2: Add holes or Steiner points if necessary
 | 
			
		||||
   */
 | 
			
		||||
      
 | 
			
		||||
  vector<Point*> hole1_pts;
 | 
			
		||||
  vector<Point*> hole2_pts;
 | 
			
		||||
  
 | 
			
		||||
  for(int i = 0; i < 22; i++) {
 | 
			
		||||
    hole1_pts.push_back(new Point(hole1[i*2],hole1[i*2+1]));
 | 
			
		||||
  }
 | 
			
		||||
  
 | 
			
		||||
  cdt->AddHole(hole1_pts);
 | 
			
		||||
  
 | 
			
		||||
  for(int i = 0; i < 10; i++) {
 | 
			
		||||
    hole2_pts.push_back(new Point(hole2[i*2],hole2[i*2+1]));
 | 
			
		||||
  }
 | 
			
		||||
  
 | 
			
		||||
  cdt->AddHole(hole2_pts);
 | 
			
		||||
  
 | 
			
		||||
  for(int i = 0; i < 42; i ++) {
 | 
			
		||||
    cdt->AddPoint(new Point(steiner_points[i*2], steiner_points[i*2+1]));
 | 
			
		||||
  }
 | 
			
		||||
      
 | 
			
		||||
  /*
 | 
			
		||||
  string s(argv[1]);
 | 
			
		||||
  if(s.find("dude.dat", 0) != string::npos) {
 | 
			
		||||
    // Add head hole
 | 
			
		||||
@@ -219,7 +191,6 @@ int main(int argc, char* argv[])
 | 
			
		||||
      cdt->AddPoint(new Point(x, y));
 | 
			
		||||
    }
 | 
			
		||||
  }
 | 
			
		||||
  */
 | 
			
		||||
  
 | 
			
		||||
  /*
 | 
			
		||||
   * STEP 3: Triangulate!
 | 
			
		||||
 
 | 
			
		||||
		Reference in New Issue
	
	Block a user