Texture mip streaming prioritization

--===============0612281275903093542==
Content-Type: multipart/alternative; boundary=047d7b414030c26e7004e214734f

--047d7b414030c26e7004e214734f
Content-Type: text/plain; charset=ISO-8859-1

Hi There,

I'm currently working on a texture streaming system and looking into ways
to prioritize which mips on which textures should be loaded.
I was hoping that people on this list may have experience with these
algorithms that they could share?

Currently I know which mips need to be loaded in order to render a scene
without degradation in image quality.
I would now like to apply a memory budget to textures, and make decisions
about which mips of which textures should be loaded over others.

My current line of thinking involves comparing cost / benefit of loading
each individual mip.
i.e.

How many pixels would be affected by a particular mip level being loaded
versus how much memory would that mip level use?

This becomes Priority = Benefit / Cost

I'd then sort for highest priority and assign memory budget to those mips
at the top of the list.

Any thoughts? comments? Alternatives that work better? Alternatives that
have worked enough?

Problems that arise with the above algorithm are quite broad, and in
particular, optimising the tipping point between cost and benifit would be
necessary. Also, calculating the number of pixels affected would involve
crude calculations that aren't really going to affect real world values....

Thanks all for your thoughts!

Josh

--047d7b414030c26e7004e214734f
Content-Type: text/html; charset=ISO-8859-1
Content-Transfer-Encoding: quoted-printable

<div dir=3D"ltr">Hi There,<br><br>I&#39;m currently working on a texture st=
reaming system and looking into ways to prioritize which mips on which text=
ures should be loaded.<div>I was hoping that people on this list may have e=
xperience with these algorithms that they could share?<br>
<br>Currently I know which mips need to be loaded in order to render a scen=
e without degradation in image quality.<br>I would now like to apply a memo=
ry budget to textures, and make decisions about which mips of which texture=
s should be loaded over others.=A0<br>
<br>My current line of thinking involves comparing cost / benefit of loadin=
g each individual mip.<br>i.e.<br><br>How many pixels would be affected by =
a particular mip level being loaded versus how much memory would that mip l=
evel use?<br>
<br>This becomes Priority =3D Benefit / Cost<br><br>I&#39;d then sort for h=
ighest priority and assign memory budget to those mips at the top of the li=
st.<br><br>Any thoughts? comments? Alternatives that work better? Alternati=
ves that have worked enough?</div>
<div><br></div><div>Problems that arise with the above algorithm are quite =
broad, and in particular, optimising the tipping point between cost and ben=
ifit would be necessary. Also, calculating the number of pixels affected wo=
uld involve crude calculations that aren&#39;t really going to affect real =
world values....<br>
<br>Thanks all for your thoughts!<br><br>Josh</div></div>

--047d7b414030c26e7004e214734f--


--===============0612281275903093542==
Content-Type: text/plain; charset="us-ascii"
MIME-Version: 1.0
Content-Transfer-Encoding: 7bit
Content-Disposition: inline

------------------------------------------------------------------------------
See everything from the browser to the database with AppDynamics
Get end-to-end visibility with application monitoring from AppDynamics
Isolate bottlenecks and diagnose root cause in seconds.
Start your free trial of AppDynamics Pro today!
http://pubads.g.doubleclick.net/gampad/clk?id=48808831&iu=/4140/ostg.clktrk
--===============0612281275903093542==
Content-Type: text/plain; charset="us-ascii"
MIME-Version: 1.0
Content-Transfer-Encoding: 7bit
Content-Disposition: inline

_______________________________________________
GDAlgorithms-list mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list
Archives:
http://sourceforge.net/mailarchive/forum.php?forum_name=gdalgorithms-list
--===============0612281275903093542==--