39条走向成功的要领和方法
《39条走向成功的要领和方法》由会员分享,可在线阅读,更多相关《39条走向成功的要领和方法(9页珍藏版)》请在装配图网上搜索。
1、(+ 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
2、(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(pro
3、gn;(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 enc
4、loses 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
5、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
6、 1)(while (and (not flag)( (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
7、 (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
8、 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 thats 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 (
9、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
10、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);repea
11、t(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(s
12、etq 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
13、 (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.
14、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 (ca
15、r c) (cadr c)a (angle b (cadr lst);setq(if (= (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)
- 温馨提示:
1: 本站所有资源如无特殊说明,都需要本地电脑安装OFFICE2007和PDF阅读器。图纸软件为CAD,CAXA,PROE,UG,SolidWorks等.压缩文件请下载最新的WinRAR软件解压。
2: 本站的文档不包含任何第三方提供的附件图纸等,如果需要附件,请联系上传者。文件的所有权益归上传用户所有。
3.本站RAR压缩包中若带图纸,网页内容里面会有图纸预览,若没有图纸预览就没有图纸。
4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
5. 装配图网仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对用户上传分享的文档内容本身不做任何修改或编辑,并不能对任何下载内容负责。
6. 下载文件中如有侵权或不适当内容,请与我们联系,我们立即纠正。
7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。
最新文档
- 新北师大版四年级数学下册《整理与复习》课件-(2)
- 《三、知之为知之不知为不知 课件》高中语文人教版选修 先秦诸子选读33764
- 《〈论语〉选读》之《诲人不倦》课件3
- 新北师大版八年级下册5.1认识分式.ppt
- 新北师大版八年级下册4.2提公因式法(2)
- 新北师大版包装四年级数学下册PPT课件
- 新北师大版六下《变化的量》4.1
- 《三角形的面积课件》小学数学北师大版五年级上册325
- 新北师大版六数下册《总复习》(63-67页)
- 新北师大版四年级数学下册《买文具》课件
- 新北师大版六数总复习《解决问题的策略》(108-109页)
- 新北师大版四年级下册《三角形边的关系》ppt课件
- 新北师大版六年级数学下册《练习三》
- 《七、总复习——图形与几何——平面图形的认识课件》小学数学苏教版六年级下册5903
- 新北师大版二年级下册数学《辨认方向》上课用