[Closed] Mini-Challenge #3

please show all your ideas even if they are slower. it might be a bright idea but with wrong implementation. also it will be very interesting to discuss why one or another solution doesn’t really work, or doesn’t work as expected.
mxs has some specific problems working with arrays, pointers to node, etc.
show your idea and we will try to optimize it.

Ok, I gotta jump in on this one. I’ll try to have something posted before Saturday morning.

Oooh, I will def. be watching this one. I was searching for a faster method, and found some, but it would be cool if it can be faster yet.

I am using cloneops now and also attaching somewhat randomly instead of linierly. I took part of the code from soulburn though, so I don’t take credit for it.

How does this look for the layout?

  I'm guessing we're creating/convert the teapots before we calculate any time, correct?

(the script below doesn’t perform any fast methods, just an example of the layout i’ll be using)

      (
  	fn createTeapots howManyTeapots: 1000 =
  	(
  		/*
  		===============
  		Here we delete all objects, create the teapots, select them, and zoom extents, the function returns the teapot array
  		===============
  		*/
  		delete objects
  		local arrayToReturn = #()
  
  		for j = 1 to 1000 do
  			append arrayToReturn (teapot pos:[random -100 100, random -100 100, random 0 100])
  		select geometry
  		actionMan.executeAction 0 "311"  -- Tools: Zoom Extents All Selected
  		
  		clearSelection()
  		
  		arrayToReturn
  	)
  	
  	rollout roAttachSpeedTest "1000 Teapot Speed Test"  width: 220
  	(
  		button btnRunSpeedTest "Run Speed Test"
  		group ""
  		(
  			radioButtons rbSpeedTest "Choose Test:" labels:#("Test 1", "Test 2", "Test 3") columns:1 default: 3 align:#center
  		)
  		group ""
  		(
  			radioButtons rbMeshOrPoly "Pre-Convert Teapots to" labels:#("Editable Mesh", "Editable Poly") columns:1 default:1 align:#center
  		)
  		label labSpeedTestCaption ""
  
  		on roAttachSpeedTest open do
  		(
  			if (queryBox "Reset Max scene before continuing?" beep:false) then
  				resetMaxFile #noprompt
  			
  			actionMan.executeAction 0 "50026"  -- Tools: Maximize Viewport Toggle
  			
  			if objects.count != 0 then
  				delete objects
  
  		)
  		on btnRunSpeedTest pressed do
  		(
  			with undo off
  			(
  				if rbMeshOrPoly.state == 1 then
  				(
  					convertToMesh(createTeapots())
  					convertToPoly geometry[1]
  				)
  				else
  				(
  					convertToPoly(createTeapots())
  				)
  						
  				gc()
  				
  				if rbSpeedTest.state == 1 then
  				(
  					local theCurrTime = timeStamp()
  					(
  						messageBox "Test 1 hasn't been implimented yet." beep:false
  					)
  					local endTime = timeStamp()
  					labSpeedTestCaption.text = ("Test Attach 1 process took " + ((endTime - theCurrTime) as string) + "ms." )
  					
  				)
  				
  				if rbSpeedTest.state == 2 then
  				(
  					local theCurrTime = timeStamp()
  					messageBox "Test 2 hasn't been implimented yet." beep:false
  					local endTime = timeStamp()
  					labSpeedTestCaption.text = ("Test Attach 1 process took " + ((endTime - theCurrTime) as string) + "ms." )
  				)
  				if rbSpeedTest.state == 3 then
  				(
  					local theCurrTime = timeStamp()
  					messageBox "Test 3 hasn't been implimented yet." beep:false
  					local endTime = timeStamp()
  					labSpeedTestCaption.text = ("Test Attach 1 process took " + ((endTime - theCurrTime) as string) + "ms." )
  				)
  			)			
  		)
  	)
  	
  	CreateDialog roAttachSpeedTest style:#(#style_toolwindow, #style_resizing, #style_sysmenu) fgcolor:([0,255,64]) bitmap:
  	undefined 
  	
  )
      

I had a feeling this challenge would be coming.
I think we need a specific test case (1000 teapots as j83 suggested is fine by me), as different algorithms are better for different cases.

are you ready? i’m cheating as usually. honestly i spent days to beat the vanisavich’s algorithm.

tomorrow i will provide the standard test for fastest poly attach algorithm. all players will have the same field.

I don’t know if I have time to join, but spent at least an half our in bed thinking of new ways to do this

Great challenge!
-Johan

My first attempt… cluster attach with a twist.
From my tests it seems to be 25 times faster than cluster attach. Can anyone confirm?

fn megaClusterAttach objs =
(
	gc()
	local ts = timestamp()
	with undo off with redraw off
	(
		local att = meshop.Attach
		local snap = snapShotAsMesh
		local del = deleteItem
		local j = 1
		local meshes = for o in objs collect snap o
		while meshes.count > 1 do
		(
			att meshes[j] meshes[j+1]
			del meshes (j+1)
			j += 1
			if (j + 1) > meshes.count then j = 1
		)
		delete objs
		local result = editable_mesh name:"Result"
		result.mesh = meshes[1]
		print (timeStamp()-ts)
	)	
)

edit: didn’t notice the output must be editablepoly. Adding a convertTo command to the result adds considerable time, though still 4 times faster than cluster attach.