Optimal Parallel Algorithms for Convex Polygon Separation

  • Authors:

  • Norm Dadoun;David G. Kirkpatrick

  • Affiliations:

  • -;-

  • Venue:
  • Optimal Parallel Algorithms for Convex Polygon Separation
  • Year:
  • 1989

Quantified Score

Hi-index 0.00

Visualization

Abstract

_cf_loadingtexthtml="";_cf_contextpath="";_cf_ajaxscriptsrc="/CFIDE/scripts/ajax";_cf_jsonprefix='//';_cf_clientid='CCE2E498B82C538F78E8F83970F6FBE3';Optimal Parallel Algorithms for Convex Polygon Separation function settab() { var mytabs = ColdFusion.Layout.getTabLayout('citationdetails'); mytabs.on('tabchange', function(tabpanel,activetab) { document.cookie = 'picked=' + '901833' + ',' + activetab.id; }) }function letemknow(){ ColdFusion.Window.show('letemknow');}function testthis(){alert('test');}function loadalert(){ alert("I am in the load alert"); }function loadalert2(){ alert("I am in the load alert2"); } google.load('visualization', '1', {packages:['orgchart']}); google.setOnLoadCallback(drawChart); function drawChart() { var data = new google.visualization.DataTable(); data.addColumn('string', 'Name'); data.addColumn('string', 'Manager'); data.addColumn('string', 'ToolTip'); data.addRows([ [{v:'0', f:'CCS for this Technical Report