1
$\begingroup$

I have two edge loops which I am trying to bridge.

enter image description here

The edge loops do not have an equal number of vertices. My assumption was that the Edge Loop Tool would just bridge to the nearest vertex.

enter image description here

Given that this doesn't appear to happen, would I be right in thinking that it cycles through the verts numerically and creates an edge each time? i.e select vert1a + vert1b then create edge,select vert2a + vert2b then create edge etc..

If so, is there a way around this either in the form of a smart bridge tool that will join to nearest corresponding vert on adjacent edge loop, or any other non-manual workaround?

$\endgroup$
3
  • $\begingroup$ Can you upload that part of your geometry? You can upload it at blend- exchange.giantcowfilms.com/ and then paste the resulting link as part of your question. I have hard time reproducing your problem. $\endgroup$
    – Leander
    Commented Sep 30, 2019 at 10:38
  • $\begingroup$ Thanks Leander, the link is here. <img src="https://blend-exchange.giantcowfilms.com/embedImage.png?bid=6635" /> . $\endgroup$
    – James
    Commented Sep 30, 2019 at 10:58
  • $\begingroup$ In the uploaded file there is only one example of the issue (bottom left), which I can correct manually. Unfortunately I have hundreds of these kind of loop pairs to bridge, some of which have no issue, others can have 4-5 verts bridging to other verts elsewhere on the corresponding edge loop. $\endgroup$
    – James
    Commented Sep 30, 2019 at 11:09

1 Answer 1

2
$\begingroup$

An easy way to create face between the loops is to not treat the as edge loops.

  1. ⇧ ShiftRMB RMB select two opposing edges and delete the X > Edges.
  2. Select the opposite "end" vertices each and connect them with an edge F. You now have a single loop.
  3. Selec this loop ⎇ AltRMB RMB and fill it F with an n-gon.
  4. Triangulate the ngon with ⎈ CtrlT.
  5. Select the four vertices which we disconnected at step 1 and fill the face F.

enter image description here

$\endgroup$
1
  • $\begingroup$ Thanks Leander, that's a great solution and works perfectly for me. $\endgroup$
    – James
    Commented Sep 30, 2019 at 12:21

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .