Hi Andrew, Edge loops are trickier and employ many different approaches including quads and following edges based on collinearity (dot product), following border edges, creases to name a few.
Too many approaches to go into details but if they all fail (e.g. when dealing with an arbitrary loop between two components) then a shortest path search is used. (e.g. think path finding like the kind used in video games) If there are multiple equal paths then you could use something like your projected line test to choose the straightest path. e.g. when dealing with grid topology where all paths will be equal in length. (within error tolerances) -- Brent From: [email protected] [mailto:[email protected]] On Behalf Of Andrew Prostrelov Sent: 26 June 2017 07:20 To: Official Softimage Users Mailing List. https://groups.google.com/forum/#!forum/xsi_list <[email protected]> Subject: Re: EdgeRing ALG for n-gons Ok. So i finished full and segment(or range) edge ring selection block. Also finished full edge loop selection. But edge loop segment(range) selection is a tricky one. It definitely use different approach to collect edges. http://c2n.me/3LCDqzC First i tryed to creat CLine primitive from center of first selected edge (lmb) to second selected edge (lmbx2). Then one by one we project first edge vertex neighbor edges onto CLine and get edge with max Parameter value. But it doesn't work right. It also doesn't work if we smply get distance to vertex neighbor edges (with no projection onto CLine). I assume that edge loop range algorithm also use dot_product and collinearity. But i still didn't figure it out how.
------ Softimage Mailing List. To unsubscribe, send a mail to [email protected] with "unsubscribe" in the subject, and reply to confirm.
