On Tue, Jul 10, 2012 at 9:52 AM, phoenix <284281...@qq.com> wrote: > (2) Using marching methods: > > I look a litter deeper into the marching algorithm on how to implement it, > and meet some difficulties. Even after reading several papers to find the > answer I want, I still cannot come out with a complete solution of the first > step, which is to calculate the starting point on the intersection curve > using curve-surface intersection!
Wu, My personal opinion is you should focus on the subdivision approach for the moment - for BRL-CAD, I think that one makes the most sense. If we need to fall back on or add marching at some point though, the paper below might have more in the way of detail - mentioning it so we're aware of it later if it's needed and in case you hadn't seen it already. Determining intersection curves between surfaces of two solids K Abdel-Malek, HJ Yeh http://www.engineering.uiowa.edu/~amalek/papers/CAD1.pdf CY ------------------------------------------------------------------------------ Live Security Virtual Conference Exclusive live event will cover all the ways today's security and threat landscape has changed and how IT managers can respond. Discussions will include endpoint security, mobile security and the latest in malware threats. http://www.accelacomm.com/jaw/sfrnl04242012/114/50122263/ _______________________________________________ BRL-CAD Developer mailing list brlcad-devel@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/brlcad-devel
