Implement vertex optimization in linear time.

newlinkgithub / webgl-loader

Automatically exported from code.google.com/p/webgl-loader

0 stars 0 forks source link

Implement vertex optimization in linear time. #1

Closed GoogleCodeExporter closed 9 years ago

GoogleCodeExporter commented 9 years ago

Right now, there is no boundary structure, so it runs in quadratic time.

Original issue reported on code.google.com by wonchun on 13 Aug 2011 at 2:55

GoogleCodeExporter commented 9 years ago

Original comment by wonchun on 13 Aug 2011 at 3:07

Added labels: Type-Enhancement
Removed labels: Type-Defect

GoogleCodeExporter commented 9 years ago

Original comment by wonchun on 14 Aug 2011 at 5:43

Added labels: Priority-Critical

GoogleCodeExporter commented 9 years ago

Finally fixed in r25!

Interestingly, implementing the approximate linear algorithm (by only scanning 
triangles incident to vertices in the cache) as opposed to the "exact" (as 
exact as a heuristic might be) quadratic algorithm results in smaller files 
with better cache hit ratios.

Original comment by wonchun on 5 Sep 2011 at 9:43

GoogleCodeExporter commented 9 years ago

Original comment by wonchun on 5 Sep 2011 at 9:43

Changed state: Fixed