Skip to content

Experimentation with parallelizing convex hull and applying it to some shortest paths problems

Notifications You must be signed in to change notification settings

Boolos/convex-hull

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

47 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

convex-hull

Experimentation with parallelizing convex hull and applying it to some shortest paths problems

###Command line parameters

  • -d -> specifies to run in debug mode.
  • -D -> runs unit tests.
  • -f filepath -> specifies a file from which to load input data.
  • -m integer -> the minimum x and y coordinate value for auto-generated data.
  • -M integer -> the maximum x and y coordinate value for auto-generated data.
  • -n integer -> the number of elements to process.
  • -o filepath -> specifies a file to write the auto generated data to. This can be used in later process runs by using the -f parameter.
  • -r integer -> the number of times to run each algorithm. If this is greater than one, a summary section will display the statistics for each algorithm.
  • -t integer -> the number of threads to run.

###Example This will run the process (named a.out) with 3200 points with 32 threads and 11 runs and restricts the coordinates to the rectangle defined by (-100, -100) to (100, 100) and run unit tests. The order of the parameters does not matter.

./a.out -n 3200 -t 32 -r 11 -m -100 -M 100 -D

About

Experimentation with parallelizing convex hull and applying it to some shortest paths problems

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Contributors 4

  •  
  •  
  •  
  •  

Languages