Talk:Linkability Rules - Revision history

Windy Schor: /* New Linkability Rule - 2010 */

2012-03-14T02:03:31Z

New Linkability Rule - 2010

← Older revision		Revision as of 19:03, 13 March 2012
Line 45:		Line 45:
	return true;		return true;
	}</csharp>		}</csharp>
			:I would put 27, the radius, not 54, the diameter, in that last check. The distance from the center of a sphere to the edge is a radius, and the new rule mentions only a diameter. [[User:Windy Schor\|Windy Schor]] 19:03, 13 March 2012 (PDT)

Strife Onizuka: /* New Linkability Rule - 2010 */

2010-12-02T21:02:38Z

New Linkability Rule - 2010

← Older revision		Revision as of 14:02, 2 December 2010
Line 23:		Line 23:
	== New Linkability Rule - 2010 ==		== New Linkability Rule - 2010 ==

	If I understand the new link rules properly, then the following should be correct. The only question I'm left with is how the center of a prim is calculated.		If I understand the new link rules properly, then the following should be correct. The only question I'm left with is how the center of a prim is calculated. -- '''[[User:Strife_Onizuka\|Strife]]''' <sup><small>([[User talk:Strife_Onizuka\|talk]]\|[[Special:Contributions/Strife_Onizuka\|contribs]])</small></sup> 21:02, 2 December 2010 (UTC)
	<csharp>		<csharp>bool linkable(prim[] prims)
	bool linkable(prim[] prims)
	{		{
	if(prims == null \|\| prims.length > 256)		if(prims == null \|\| prims.length > 256)
Line 45:		Line 44:

	return true;		return true;
	}		}</csharp>
	</csharp>

Strife Onizuka: /* New Linkability Rule - 2010 */ new section

2010-12-02T21:02:19Z

New Linkability Rule - 2010: new section

← Older revision		Revision as of 14:02, 2 December 2010
Line 20:		Line 20:

	I actually made a graphic before I read this and stuck it in there (the brightly colored prim shapes), but it doesn't cover the details of the math, just the order in which single prims are checked, then the failures are sub-checked, etc. I was trying to explain that part to someone, and the graphic just came about as a result. Perhaps a short animation would better explain the more detailed picture? [[User:Tiger Crossing\|Tiger Crossing]] 17:21, 4 April 2008 (PDT)		I actually made a graphic before I read this and stuck it in there (the brightly colored prim shapes), but it doesn't cover the details of the math, just the order in which single prims are checked, then the failures are sub-checked, etc. I was trying to explain that part to someone, and the graphic just came about as a result. Perhaps a short animation would better explain the more detailed picture? [[User:Tiger Crossing\|Tiger Crossing]] 17:21, 4 April 2008 (PDT)

			== New Linkability Rule - 2010 ==

			If I understand the new link rules properly, then the following should be correct. The only question I'm left with is how the center of a prim is calculated.
			<csharp>
			bool linkable(prim[] prims)
			{
			if(prims == null \|\| prims.length > 256)
			return false;

			if(prims.length < 2)
			return prims.length > 0;

			Vector center = new Vector();

			foreach(prim p in prims)
			center += p.center;

			center /= prims.length;

			foreach (prim p in prims)
			if((p.center - center).Magnitude >= 54)
			return false;

			return true;
			}
			</csharp>

Mitzy Shino: /* New algorithm overview graphic? */

2009-12-09T05:33:53Z

New algorithm overview graphic?

← Older revision		Revision as of 22:33, 8 December 2009
Line 17:		Line 17:
	* Show that the spheres interact, and can be linked		* Show that the spheres interact, and can be linked
	...any good? [[User:Celierra Darling\|Celierra Darling]] 08:24, 3 April 2008 (PDT)		...any good? [[User:Celierra Darling\|Celierra Darling]] 08:24, 3 April 2008 (PDT)
	* My head hurts [[User:~~Mitz~~ Shino\|Mitzy Shino]] 18:32, 9 Dec 2009 (NZDT)		* My head hurts [[User:Mitzy Shino\|Mitzy Shino]] 18:32, 9 Dec 2009 (NZDT)

	I actually made a graphic before I read this and stuck it in there (the brightly colored prim shapes), but it doesn't cover the details of the math, just the order in which single prims are checked, then the failures are sub-checked, etc. I was trying to explain that part to someone, and the graphic just came about as a result. Perhaps a short animation would better explain the more detailed picture? [[User:Tiger Crossing\|Tiger Crossing]] 17:21, 4 April 2008 (PDT)		I actually made a graphic before I read this and stuck it in there (the brightly colored prim shapes), but it doesn't cover the details of the math, just the order in which single prims are checked, then the failures are sub-checked, etc. I was trying to explain that part to someone, and the graphic just came about as a result. Perhaps a short animation would better explain the more detailed picture? [[User:Tiger Crossing\|Tiger Crossing]] 17:21, 4 April 2008 (PDT)

Mitzy Shino: /* New algorithm overview graphic? */

2009-12-09T05:32:58Z

New algorithm overview graphic?

← Older revision		Revision as of 22:32, 8 December 2009
Line 17:		Line 17:
	* Show that the spheres interact, and can be linked		* Show that the spheres interact, and can be linked
	...any good? [[User:Celierra Darling\|Celierra Darling]] 08:24, 3 April 2008 (PDT)		...any good? [[User:Celierra Darling\|Celierra Darling]] 08:24, 3 April 2008 (PDT)
			* My head hurts [[User:Mitz Shino\|Mitzy Shino]] 18:32, 9 Dec 2009 (NZDT)

	I actually made a graphic before I read this and stuck it in there (the brightly colored prim shapes), but it doesn't cover the details of the math, just the order in which single prims are checked, then the failures are sub-checked, etc. I was trying to explain that part to someone, and the graphic just came about as a result. Perhaps a short animation would better explain the more detailed picture? [[User:Tiger Crossing\|Tiger Crossing]] 17:21, 4 April 2008 (PDT)		I actually made a graphic before I read this and stuck it in there (the brightly colored prim shapes), but it doesn't cover the details of the math, just the order in which single prims are checked, then the failures are sub-checked, etc. I was trying to explain that part to someone, and the graphic just came about as a result. Perhaps a short animation would better explain the more detailed picture? [[User:Tiger Crossing\|Tiger Crossing]] 17:21, 4 April 2008 (PDT)

Tiger Crossing: /* New algorithm overview graphic? */

2008-04-05T00:21:22Z

New algorithm overview graphic?

← Older revision		Revision as of 17:21, 4 April 2008
Line 17:		Line 17:
	* Show that the spheres interact, and can be linked		* Show that the spheres interact, and can be linked
	...any good? [[User:Celierra Darling\|Celierra Darling]] 08:24, 3 April 2008 (PDT)		...any good? [[User:Celierra Darling\|Celierra Darling]] 08:24, 3 April 2008 (PDT)

			I actually made a graphic before I read this and stuck it in there (the brightly colored prim shapes), but it doesn't cover the details of the math, just the order in which single prims are checked, then the failures are sub-checked, etc. I was trying to explain that part to someone, and the graphic just came about as a result. Perhaps a short animation would better explain the more detailed picture? [[User:Tiger Crossing\|Tiger Crossing]] 17:21, 4 April 2008 (PDT)

Celierra Darling: New section: New algorithm overview graphic?

2008-04-03T15:24:45Z

New section: New algorithm overview graphic?

← Older revision		Revision as of 08:24, 3 April 2008
Line 5:		Line 5:

	I changed the SMALLEST_MAX to be LINK_BONUS, and bumped it from 1.0 to 2.0, as per changes in the code. [[User:Andrew_Linden]]		I changed the SMALLEST_MAX to be LINK_BONUS, and bumped it from 1.0 to 2.0, as per changes in the code. [[User:Andrew_Linden]]

			== New algorithm overview graphic? ==

			Kelly Linden and I added some attempts at better ways to explain the algorithm in a more-intuitive way. I think there probably needs to be something graphical, though. Assuming I transformed the equations correctly in the 'visualization' section, I'm thinking something like
			* Two identical complicated-looking prims with bounding boxes with nice numbers, like 1.5x2x6 (diameter: 6.5)
			* Show the bounding boxes as shown by the 'stretch' tool
			* Replace the complicated-looking prims by boxes
			* Add a translucent bounding sphere around each prim
			* Add translucent spheres which are triple each bounding sphere
			* Add translucent spheres which are one more meter around
			* Show that the spheres interact, and can be linked
			...any good? [[User:Celierra Darling\|Celierra Darling]] 08:24, 3 April 2008 (PDT)

Andrew Linden at 16:43, 1 April 2008

2008-04-01T16:43:37Z

← Older revision		Revision as of 09:43, 1 April 2008
Line 3:		Line 3:

	Linkability checks over already linked sets should be performed using the coordinate system as established by the rotation of the linked set, instead of a global coordinate system, to prevent a rotation of a valid linked set breaking the linked set. [[user:Damanios_Thetan\|Damanios Thetan]]		Linkability checks over already linked sets should be performed using the coordinate system as established by the rotation of the linked set, instead of a global coordinate system, to prevent a rotation of a valid linked set breaking the linked set. [[user:Damanios_Thetan\|Damanios Thetan]]

			I changed the SMALLEST_MAX to be LINK_BONUS, and bumped it from 1.0 to 2.0, as per changes in the code. [[User:Andrew_Linden]]

Damanios Thetan at 09:49, 6 October 2007

2007-10-06T09:49:38Z

← Older revision		Revision as of 02:49, 6 October 2007
Line 2:		Line 2:
	A new linkability check over a valid linkable set, which is rotated (causing a different order in the prim selection of the linkability check) can cause this set to become invalid.		A new linkability check over a valid linkable set, which is rotated (causing a different order in the prim selection of the linkability check) can cause this set to become invalid.

	Linkability checks over already linked sets should be performed using the coordinate system as established by the rotation of the linked set, instead of a global coordinate system, to prevent a rotation of a valid linked set breaking the linked set. [user:Damanios_Thetan]		Linkability checks over already linked sets should be performed using the coordinate system as established by the rotation of the linked set, instead of a global coordinate system, to prevent a rotation of a valid linked set breaking the linked set. [[user:Damanios_Thetan\|Damanios Thetan]]

Damanios Thetan at 09:49, 6 October 2007

2007-10-06T09:49:11Z

← Older revision		Revision as of 02:49, 6 October 2007
Line 2:		Line 2:
	A new linkability check over a valid linkable set, which is rotated (causing a different order in the prim selection of the linkability check) can cause this set to become invalid.		A new linkability check over a valid linkable set, which is rotated (causing a different order in the prim selection of the linkability check) can cause this set to become invalid.

	Linkability checks over already linked sets should be performed using the coordinate system as established by the rotation of the linked set, instead of a global coordinate system, to prevent a rotation of a valid linked set breaking the linked set. [user:~~Damanios Thetan~~]		Linkability checks over already linked sets should be performed using the coordinate system as established by the rotation of the linked set, instead of a global coordinate system, to prevent a rotation of a valid linked set breaking the linked set. [user:Damanios_Thetan]