On Oct 8, 2013, at 10:49 AM, phoenix <[email protected]> wrote: > > I've been trying out the boolean evaluation code, and I noticed that > coplanar flat surfaces seem to be taking a lot of time - does your > implementation try to recognize that both surfaces are planar and > check to see if they are in the same infinite plane rather than doing > the tree-based evaluation? If not, that looks like it might be a > worthwhile performance optimization to add. > > Sorry for the late reply. Actually there isn't any planar optimizations for > SSI yet... (Although we do have it for PSI and CSI) For the coplanar case, > determining the overlap region is quite fast, but we still perform the > tree-based evaluation later to find the rest intersections. Maybe we can have > an optimization when both of them are planar surfaces.
Where might this optimization go? How hard do think it will be to get working? Just a matter of iterating over all CSI pairings? We're trying to put the SSI code to use immediately since it's at the heart of providing shaded OpenGL displays of geometry and robust export. The evaluations need to be mildly interactive and the flat surfaces are frequent. Any help or code appreciated. :) It's a lot of code to get up to speed. Cheers! Sean ------------------------------------------------------------------------------ October Webinars: Code for Performance Free Intel webinars can help you accelerate application performance. Explore tips for MPI, OpenMP, advanced profiling, and more. Get the most from the latest Intel processors and coprocessors. See abstracts and register > http://pubads.g.doubleclick.net/gampad/clk?id=60134071&iu=/4140/ostg.clktrk _______________________________________________ BRL-CAD Developer mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/brlcad-devel
