Any VLA equivalent to bpoly...
Hi Rudy, No, there is nothing out there as as simple function, I wrote a very similar function but it is now abandoned. LE.
By the way Rudy, What are you trying to do? [There is the Tovna gbound application, but is not accesible as function]
The Tovna Gbound is gold. Its expensive though. Anyone that can clone it will make bucks... "Rudy Tovar" <Rudyatcadentitydotcom> |>Any VLA equivalent to bpoly... |> |> James Maeding jmaeding at hunsaker dot com Civil Engineer/Programmer
James, How many others really would like to have a clone or a similar program like this one? You are the only one I have heard interesting on this. LE.
Thanks... but you will see the lack of interest of everyone.... this topic have come up several times and every time just stop, because there is no follow up, or every one is to busy or simple lost of interest. Regards, Luis. If you like to try, the version I made with visual lisp and some boolean operations, let me know, still needs more, but to me does a very decent job, for the single boundary definitions and for the global boundaries definitions by selection.
Hey, Luis, email me the code for yours... It's not that it doesn't have interest, more does anyone want to pay for it... In great part it's importance is in one imagination, and knowing how to apply it... How do you apply....simple...being able to code predefined points to be calculated...random point placement for any given boundary definition...without having to use autocads boundary function that yield unwanted conclusions...
Hi Rudy, No is not open source code, it is a function similar to bpoly and another similar to the gbound ability to create boundaries base on a selection. All made with Visual Lisp. It is all start by the principle of what a boundary is by defining the enclosed area per all the nodes that form a boundary. It is a complex algorithm with calculus and boolean operations, the function is smart enough to create a boundary if a enclosed area is found, no need to break anything. A diference between my function against bpoly is that mine recognize the nodes or all intersections, and the boundary is created base on that. The recognition of the boundary has to be made on the current view, objects outside of the view are ignored, and also uses a global "fuzzer", where the user can use the precision for large coordinates or when an enclosed area is form by a lot of curves-curves objects. Anyway as you know, all my projects or applications are now abandoned. BTW, my comments are not to anyone in specific....I am referring in general.... Regards, Luis