39条走向成功的要领和方法

(+ n 1) (length lst5) ;make sure lst5 has non-zero extents (or (equal dx 0.0 0.00001)(equal dy 0.0 0.00001);or);and(setq dx (+ (abs (- (car (nth (+ n 1) lst5)(car (nth n lst5);minus);absdx);plusdy (+ (abs (- (cadr (nth (+ n 1) lst5)(cadr (nth n lst5);minus);absdy);plus);setq(setq n (+ n 1);while(if (or (equal dx 0.0 0.00001)(equal dy 0.0 0.00001);or(setq lst3 nillst5 nil);setq(progn(setq lst3 lst5lst5 nil);setq(if (and lst3lst6);and(progn(setq lst3 (split_at_pinch2 lst3 lst6);progn(progn(if lst3(setq lst3 (list lst3);setq);if);progn then);if);progn else lst5 has non-zero extents);if);progn(progn;(getstring "2")(if (not (in_bounds (car lst3) lst2)(progn(if (or (acet-geom-point-inside (nth 0 lst2) lst3 dst)(acet-geom-point-inside (nth 1 lst2) lst3 dst)(acet-geom-point-inside (nth 2 lst2) lst3 dst)(acet-geom-point-inside (nth 3 lst2) lst3 dst);or(setq lst3 lst2);then clip boundary totally encloses the image bounds ;so use image_bounds as clip boundary(setq lst3 nil);else clip boundary has no overlap with image so return nil);if);progn then clip boundary is not within the image_bounds);if(if lst3(setq lst3 (list lst3);setq);if);progn else either totally inside or totally outside with no intersections);iflst3);defun pre_proccess_boundary(defun split_at_pinch2 ( lst lst2 / n k a b x1 flag j m c d x2 x3 lst3 lst4 lst5 )(setq n 0)(repeat (max (- (length lst2) 1) 0)(setq k (nth n lst2)a (nth k lst)b (nth (+ k 1) lst)x1 (acet-clipit-list-extents (list a b);setq(setq flag nil)(setq j (+ n 1)(while (and (not flag)(< j (length lst2);and(setq m (nth j lst2)c (nth m lst)d (nth (+ m 1) lst)x2 (acet-clipit-list-extents (list c d)x3 (acet-clipit-list-extents (append x1 x2);setq(if (and (or (and (equal (car x3) (car x1) 0.0001) (equal (cadr x3) (cadr x1) 0.0001) );and(and (equal (car x3) (car x2) 0.0001) (equal (cadr x3) (cadr x2) 0.0001) );and);or(equal 0.0 (acet-geom-vector-side c a b) (equal 0.0 (acet-geom-vector-side d a b) );and(setq lst3 (append lst3(list (list k m);append);setq then);if(setq j (+ j 1);setq);while(setq n (+ n 1);setq);repeat(setq n 0);setq(repeat (max 0 (- (length lst3) 1)(setq a (nth n lst3)b (cadr a)a (car a)c (nth (+ n 1) lst3)d (cadr c)c (car c);setq(setq lst4 (append lst4(list (list (+ a 1)(if (not (equal (min b c) a) (min b c) b);if);list);list);append );setq(setq n (+ n 1);setq);repeat(if lst3(progn(setq a (nth n lst3) b (cadr a) a (car a) c (car lst3) d (cadr c) c (car c);setq(setq lst4 (append lst4 (list (list (max (+ a 1)(if lst4(+ (cadr (last lst4) 1) 0);if );max b );list );list (list (list (+ b 1) c );list );list );append );setq );progn then);if(if (and lst3 lst4)(progn(setq n 0) (repeat (length lst4) (setq a (nth n lst4) j (car a);setq(setq lst3 nil)(while (not (equal j (cadr a)(setq lst3 (append lst3 (list (nth j lst);setq (setq j (+ j 1) (if (= j (length lst)(setq j 0);if);while(setq lst3 (append lst3 (list (nth j lst);setq(if (> (length lst3) 2)(progn(if (> (length lst3) 3)(progn(if (not (equal (car lst3) (last lst3)(setq lst3 (append lst3 (list (car lst3);setq);if(setq lst3 (split_at_pinch2 lst3 ;a little recursion excursion.(list 0 (- (length lst3) 2) );split_at_pinch2);setq);progn then(setq lst3 (list lst3);if(setq lst5 (append lst5 lst3);setq;(setq lst5 (append lst5 (list lst3);setq);progn);if(setq n (+ n 1);setq);repeat(if lst5(setq lst lst5)(setq lst (list lst);if);progn then(setq lst (list lst);setq else);iflst);defun split_at_pinch2(defun add_corners ( nn jj lst3 lst2 / mxmn len n a b lst lst4 ;func flag flag2 mxmn len lst lst4 ;n a b d1 d2 d3 d4)(setq mxmn (list (nth nn lst3)len (length lst3);setq(setq n nn)(while (not (equal n jj);build a list that's a loop of points from exit to entry point(setq a (nth n lst3)mxmn (acet-clipit-list-extents (append (list a) mxmn);setq(if (not (equal a (last lst) 0.0001)(setq lst (append lst (list a);setq);if(setq n (+ n 1)(if (= n len) (setq n 0);if);while(setq a (nth n lst3)mxmn (acet-clipit-list-extents (append (list a) mxmn)lst (append lst (list a);setq(setq mxmn (* 4.0 (distance (car mxmn) (cadr mxmn) b mxmn);setq(if (not (equal (car lst) (last lst) 0.0001) ;make sure the loop is fully closed(setq lst (append lst (list (car lst);setq then);if(setq lst2 (cdr lst2)(setq n 0)(repeat (length lst2)(setq a (nth n lst2)(if (not (acet-geom-point-inside a lst mxmn)(setq a nil);if(setq lst4 (append lst4 (list a)(setq n (+ n 1);setq);repeat(setq b (list b (car lst4)(if (member nil lst4)(progn(while (car lst4)(setq lst4 (append (cdr lst4) (list (car lst4);while(while (and lst4(not (car lst4);and(setq lst4 (cdr lst4);while(if (not (last lst4)(progn(setq lst4 (reverse lst4)(while (and lst4(not (car lst4);and(setq lst4 (cdr lst4);while(setq lst4 (reverse lst4);progn);if);progn(progn(if (equal (length lst4) 4)(progn(while (not (equal 0(nth nn lst3) (car lst4)(last(acet-geom-vector-sidelst4) )(setq lst4 (append (cdr lst4) (list (car lst4);setq );while );progn);if);progn(if lst4(progn(if (< (distance (nth nn lst3) (last lst4) (distance (nth nn lst3) (car lst4) )(setq lst4 (reverse lst4);if(if (and (< (distance (nth jj lst3) (car lst4) (distance (nth nn lst3) (car lst4) )(< (distance (nth jj lst3) (car lst4) (distance (nth jj lst3) (last lst4);and(setq lst4 (reverse lst4);if);progn then);if(if (not (equal (nth nn lst3) (car lst4) 0.0001) (setq lst4 (append (list (nth nn lst3) lst4);append);setq);if(if (not (equal (nth jj lst3) (last lst4) 0.0001)(setq lst4 (append lst4 (list (nth jj lst3) );append);setq);iflst4);defun add_corners(defun in_bounds ( p1 lst / a b c)(setq b (car lst)b (list (car b) (cadr b)c (caddr lst)c (list (car c) (cadr c)a (angle b (cadr lst);setq(if (< a 0) (setq a (+ a (* 2.0 pi)(setq a (* -1.0 a)c (acet-geom-point-rotate c b a)p1 (acet-geom-point-rotate p1 b a)lst (acet-clipit-list-extents (list b c p1) );setq(and (equal (car lst) b 0.000001)(equal (cadr lst) c 0.000001) );and);defun in_bounds(defun wipeout_clipit ( na lst / na2 la n a)(if na(entdel na);if(if (setq la (acet-layer-locked (getvar "clayer")(command "_.layer" "_un" (getvar "clayer") "") );if(command "_.pline")(setq n 0) (repeat (length lst)(setq a (nth n lst);setq(command a)(setq n (+ n 1);setq);repeat(command "")(setq na2 (entlast)(command "_.pedit" na2 "_cl" "_x")(command "_.wipeout" "_n" na2 "_y")(if la(command "_.layer" "_lock" (getvar "clayer") "") );if);defun wipeout_clipit;take a list of point ans removes duplicated points and unneeded points ;as a result of no angle change.(defun plist_optimize ( lst / n a b c d lst2)(if (not (equal (car lst) (last lst) 0.00001)(setq lst (append lst (list (car lst);setq then);if(setq n 0)(repeat (max 0(- (length lst) 1)(setq a (nth n lst)b (nth (+ n 1) lst);setq(if (equal n 0)(setq lst2 (list a b);if(setq c (nth (max (- (length lst2) 2) 0) lst2)d (last lst2);setq(if (equal (angle a b)(angle c d)0.000001);equal(setq lst2 (reverse (cdr (reverse lst2);setq);if(if (not (equal b (last lst2)(setq lst2 (append lst2 (list b);setq);if(setq n (+ n 1);setq);repeat(if (and (>= (length lst2) 4)(equal (angle (car lst2) (cadr lst2)(angle (nth (- (length lst2) 2) lst2) (last lst2) 0.000001);equal);and(setq lst2 (cdr lst2)lst2 (reverse (cdr (reverse lst2);setq);iflst2);defun plist_optimize(defun acet-clipit-list-extents ( lst / a b ) (setq lst (acet-geom-list-extents lst)a (car lst)b (cadr lst)(list (list (car a) (cadr a)(list (car b) (cadr b);list);defun acet-clipit-list-extents(princ)