<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: ACMR and ATVR</title>
	<atom:link href="http://www.realtimerendering.com/blog/acmr-and-atvr/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.realtimerendering.com/blog/acmr-and-atvr/</link>
	<description>Tracking the latest developments in interactive rendering techniques</description>
	<lastBuildDate>Mon, 17 Jun 2013 03:17:13 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.4.1</generator>
	<item>
		<title>By: Eric</title>
		<link>http://www.realtimerendering.com/blog/acmr-and-atvr/comment-page-1/#comment-47</link>
		<dc:creator>Eric</dc:creator>
		<pubDate>Mon, 30 Mar 2009 17:13:40 +0000</pubDate>
		<guid isPermaLink="false">http://www.realtimerendering.com/blog/?p=83#comment-47</guid>
		<description>Yes, the optimum ACMR is 0.5 for a regular grid (or any closed mesh, for that matter - it&#039;s all from Euler&#039;s geometric formula; see pages 554-555 of the 3rd edition). I was indeed referring to the fact that for a single tristrip the ACMR approaches 1.0 at best (the more triangles, the closer to 1.0), since each vertex is shared by at most 3 triangles. Reading over my post, I made a typo, saying &quot;meshes&quot; where I meant to say &quot;tristrips&quot;. Fixed, and sorry about that. At least we got it right in the book.

BTW, the &quot;non-bizarre mesh&quot; reference is like what you point out, that you could have some silly mesh like a single triangle repeated a million times. With this pathological case the ACMR drops nearly to 0.0: 3 vertices/million triangles.

Naty&#039;s the blogmaster, I&#039;ve passed on your OpenID comment to him.</description>
		<content:encoded><![CDATA[<p>Yes, the optimum ACMR is 0.5 for a regular grid (or any closed mesh, for that matter &#8211; it&#8217;s all from Euler&#8217;s geometric formula; see pages 554-555 of the 3rd edition). I was indeed referring to the fact that for a single tristrip the ACMR approaches 1.0 at best (the more triangles, the closer to 1.0), since each vertex is shared by at most 3 triangles. Reading over my post, I made a typo, saying &#8220;meshes&#8221; where I meant to say &#8220;tristrips&#8221;. Fixed, and sorry about that. At least we got it right in the book.</p>
<p>BTW, the &#8220;non-bizarre mesh&#8221; reference is like what you point out, that you could have some silly mesh like a single triangle repeated a million times. With this pathological case the ACMR drops nearly to 0.0: 3 vertices/million triangles.</p>
<p>Naty&#8217;s the blogmaster, I&#8217;ve passed on your OpenID comment to him.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Arseny Kapoulkine</title>
		<link>http://www.realtimerendering.com/blog/acmr-and-atvr/comment-page-1/#comment-46</link>
		<dc:creator>Arseny Kapoulkine</dc:creator>
		<pubDate>Mon, 30 Mar 2009 05:36:26 +0000</pubDate>
		<guid isPermaLink="false">http://www.realtimerendering.com/blog/?p=83#comment-46</guid>
		<description>Optimum ACMR for a regular grid is ~0.5, so 1.0 is kind of wrong. ACMR of 1.0 is the ACMR for any non-indexed strip sequence (without degenerates, if you exclude them from counting, and for any sequence if you include everything).

Btw, registration on a blog w/out OpenID is kind of lame.</description>
		<content:encoded><![CDATA[<p>Optimum ACMR for a regular grid is ~0.5, so 1.0 is kind of wrong. ACMR of 1.0 is the ACMR for any non-indexed strip sequence (without degenerates, if you exclude them from counting, and for any sequence if you include everything).</p>
<p>Btw, registration on a blog w/out OpenID is kind of lame.</p>
]]></content:encoded>
	</item>
</channel>
</rss>