<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en-gb">
	<link rel="self" type="application/atom+xml" href="https://pybullet.org/Bullet/phpBB3/app.php/feed/topic/563" />

	<title>Real-Time Physics Simulation Forum</title>
	
	<link href="https://pybullet.org/Bullet/phpBB3/index.php" />
	<updated>2006-09-29T07:07:38+00:00</updated>

	<author><name><![CDATA[Real-Time Physics Simulation Forum]]></name></author>
	<id>https://pybullet.org/Bullet/phpBB3/app.php/feed/topic/563</id>

		<entry>
		<author><name><![CDATA[Erwin Coumans]]></name></author>
		<updated>2006-09-29T07:07:38+00:00</updated>

		<published>2006-09-29T07:07:38+00:00</published>
		<id>https://pybullet.org/Bullet/phpBB3/viewtopic.php?p=1958#p1958</id>
		<link href="https://pybullet.org/Bullet/phpBB3/viewtopic.php?p=1958#p1958"/>
		<title type="html"><![CDATA[Re: Bullet &amp; ODE LCP Solver]]></title>

		
		<content type="html" xml:base="https://pybullet.org/Bullet/phpBB3/viewtopic.php?p=1958#p1958"><![CDATA[
<blockquote class="uncited"><div><blockquote class="uncited"><div><br>Good point. We recently discussed this reordering of constraints. Doing a randomize can work in some situations, but opinions vary. Other approaches are sweeping back-and-forwards or sorting them in order of deepest penetration. See the discussion here:<br><br><a href="http://www.continuousphysics.com/Bullet/phpBB2/viewtopic.php?t=534&amp;start=15" class="postlink">http://www.continuousphysics.com/Bullet ... 4&amp;start=15</a><br><br>Erwin</div></blockquote>Thanks Erwin for your quickly reply,but after tested ,i attention simply swap first and last constranit  approach isn't as well as randomizing.</div></blockquote>Which proves that opinions vary, as I mentioned.<p>Statistics: Posted by <a href="https://pybullet.org/Bullet/phpBB3/memberlist.php?mode=viewprofile&amp;u=2">Erwin Coumans</a> — Fri Sep 29, 2006 7:07 am</p><hr />
]]></content>
	</entry>
		<entry>
		<author><name><![CDATA[jiangwei]]></name></author>
		<updated>2006-09-29T06:43:21+00:00</updated>

		<published>2006-09-29T06:43:21+00:00</published>
		<id>https://pybullet.org/Bullet/phpBB3/viewtopic.php?p=1957#p1957</id>
		<link href="https://pybullet.org/Bullet/phpBB3/viewtopic.php?p=1957#p1957"/>
		<title type="html"><![CDATA[Re: Bullet &amp; ODE LCP Solver]]></title>

		
		<content type="html" xml:base="https://pybullet.org/Bullet/phpBB3/viewtopic.php?p=1957#p1957"><![CDATA[
<blockquote class="uncited"><div><br>Good point. We recently discussed this reordering of constraints. Doing a randomize can work in some situations, but opinions vary. Other approaches are sweeping back-and-forwards or sorting them in order of deepest penetration. See the discussion here:<br><br><a href="http://www.continuousphysics.com/Bullet/phpBB2/viewtopic.php?t=534&amp;start=15" class="postlink">http://www.continuousphysics.com/Bullet ... 4&amp;start=15</a><br><br>Erwin</div></blockquote>Thanks Erwin for your quickly reply,but after tested ,i attention simply swap first and last constranit  approach isn't as well as randomizing.<p>Statistics: Posted by <a href="https://pybullet.org/Bullet/phpBB3/memberlist.php?mode=viewprofile&amp;u=361">jiangwei</a> — Fri Sep 29, 2006 6:43 am</p><hr />
]]></content>
	</entry>
		<entry>
		<author><name><![CDATA[Erwin Coumans]]></name></author>
		<updated>2006-09-28T14:31:08+00:00</updated>

		<published>2006-09-28T14:31:08+00:00</published>
		<id>https://pybullet.org/Bullet/phpBB3/viewtopic.php?p=1954#p1954</id>
		<link href="https://pybullet.org/Bullet/phpBB3/viewtopic.php?p=1954#p1954"/>
		<title type="html"><![CDATA[Re: Bullet &amp; ODE LCP Solver]]></title>

		
		<content type="html" xml:base="https://pybullet.org/Bullet/phpBB3/viewtopic.php?p=1954#p1954"><![CDATA[
<blockquote class="uncited"><div>Hi All    <div class="codebox"><p>Code: </p><pre><code>if ((iteration &amp; 7) == 0) {for (i=1; i&lt;m; ++i) {IndexError tmp = order[i];int swapi = dRandInt2(i+1);order[i] = order[swapi];order[swapi] = tmp;}                }</code></pre></div>    I found this section code which in the "SorLcp.cpp" can improve the stable,but i don't know why.<br>There no thesis to discussed this.<br>What is the purpose of the method?<br>I am in a puzzle about this section of code.</div></blockquote>Good point. We recently discussed this reordering of constraints. Doing a randomize can work in some situations, but opinions vary. Other approaches are sweeping back-and-forwards or sorting them in order of deepest penetration. See the discussion here:<br><br><a href="http://www.continuousphysics.com/Bullet/phpBB2/viewtopic.php?t=534&amp;start=15" class="postlink">http://www.continuousphysics.com/Bullet ... 4&amp;start=15</a><br><br>Erwin<p>Statistics: Posted by <a href="https://pybullet.org/Bullet/phpBB3/memberlist.php?mode=viewprofile&amp;u=2">Erwin Coumans</a> — Thu Sep 28, 2006 2:31 pm</p><hr />
]]></content>
	</entry>
		<entry>
		<author><name><![CDATA[jiangwei]]></name></author>
		<updated>2006-09-29T05:50:52+00:00</updated>

		<published>2006-09-28T09:48:56+00:00</published>
		<id>https://pybullet.org/Bullet/phpBB3/viewtopic.php?p=1952#p1952</id>
		<link href="https://pybullet.org/Bullet/phpBB3/viewtopic.php?p=1952#p1952"/>
		<title type="html"><![CDATA[Bullet &amp; ODE LCP Solver]]></title>

		
		<content type="html" xml:base="https://pybullet.org/Bullet/phpBB3/viewtopic.php?p=1952#p1952"><![CDATA[
Hi All    <div class="codebox"><p>Code: </p><pre><code>if ((iteration &amp; 7) == 0) {for (i=1; i&lt;m; ++i) {IndexError tmp = order[i];int swapi = dRandInt2(i+1);order[i] = order[swapi];order[swapi] = tmp;}                }</code></pre></div>    I attentioned this section code which in the "SorLcp.cpp" can improve the stable,but i don't know why.<br>There no papers to discussed this.<br>I am in a puzzle about this section of code.<br>What is the purpose of the method?Does anyone can answer this question?Thanks!<p>Statistics: Posted by <a href="https://pybullet.org/Bullet/phpBB3/memberlist.php?mode=viewprofile&amp;u=361">jiangwei</a> — Thu Sep 28, 2006 9:48 am</p><hr />
]]></content>
	</entry>
	</feed>
