Code Red => AutoLISP (Vanilla / Visual) => Topic started by: well20152016 on December 03, 2018, 03:12:31 AM
Title: Fast algorithm for finding 3D face boundary?
Post by: well20152016 on December 03, 2018, 03:12:31 AM
Fast algorithm for finding 3D face boundary?
Title: Re: Fast algorithm for finding 3D face boundary?
Post by: David Bethel on December 03, 2018, 05:50:42 AM
Isn't a 3DFACE is a boundary in most instances ???
Title: Re: Fast algorithm for finding 3D face boundary?
Post by: ribarm on December 03, 2018, 10:02:34 AM
Hi this is improved version that accepts holes in 3dfaces network and manages to do breaking along boundary - 3DPOLYLINE if user want that... But nevertheless its slow - on my PC it took 920 secsonds for your cca 2500 3dfaces...
(defun c:3dpolysaround3dfaces (/ vl-position-fuzz car-vl-member-if unique uniquepl osm pdm pds ss ti i 3df pl pll plll el ell elll k z p1 p2 3dppl ch pp ppl pos1 pos2 ppp 3dppls p )
For more info, serach this topic... https://forums.autodesk.com/t5/visual-lisp-autolisp-and-general/draw-3dpoly-in-3dfaces/m-p/7789616#M365239
Regards, M.R. P.S. You could ask someone that work in .NET or ObjectARX like nullptr-aka Daniel to convert this lisp to something faster as it's not fast algorithm at all... But it's LISP and you can understand it...
Title: Re: Fast algorithm for finding 3D face boundary?
Post by: well20152016 on December 03, 2018, 11:01:23 PM