Multi segment closed area

[ssdd]

Multi segment closed area

1.dwg

[Roy_043]

Looking at the bottom pair, corner solutions seem rather arbitrary.

TR: 0 segmens removed.

BR: 2 segments removed.

BL: 1 segment removed.

TL: 1 segment removed.

Edited October 24, 2018 by Roy_043

[ssdd]

Help: algorithm for fast selection and closed area implementation

[BIGAL]

One problem is when filleting plines that are zig zag the fillet is applied to the section of the pline so no easy auto way of doing.

[ronjonp]

Why not like the two green examples? What is your logic?

[ssdd]

After extension, there are intersection points. After lengthening, a closed area is formed, and the redundant points are deleted.

[ssdd]

1.dwg

[ronjonp]

I see now .. your first example did not show that correctly:

 

Just curious, but what do you use this for?

Edited November 14, 2018 by ronjonp

[ssdd]

The enclosed area under this specification needs to be obtained. I hope you can help me.

Edited November 15, 2018 by ssdd

[BIGAL]

Ah yes extend all then do a bpoly erase old. Ok it took about 5 minutes.

 

You need to download lee-mac's double extend lisp only thing is it needs some subtle changes in about 6 lines. I will PM Lee the changes before posting here as its his code. Just needs to remember the 1st point picked for the bpoly. The code here rearranges the local variables so the erase will work with the selection.

my code 

(defun joinpls ( / sel inpt outpt)
(if (not "dex")(Load "DoubleExtendV1-0-AH"))
(c:dex)
(command "bpoly" inpt "")
(command "erase" sel "")
)
(joinpls)

 

Edited November 16, 2018 by BIGAL