[编程交流] 列表中的3dpolyline

(setq pts (ssget '((0 . "POINT"))))

(entmake
(list
(cons 0 "LINE")
(cons 10 '(0. 0. 0.))
(cons 11 '(1. 1. 0.))
)
) 

(setq points (ssget '((0 . "POINT"))))
(= (cdr (assoc 0 (entget (ssname points 0)))) "POINT")

(setq x [color=red]'[/color](10 0 0 0))
(entmake
([color=red]list[/color]
 [color=red]'[/color](0 . "LINE") 
 x
 [color=red]'[/color](11 1 1 0) 
)
)

  (defun _pline (lst)
   (if (and (> (length lst) 1)
            (entmakex '((0 . "POLYLINE") (10 0. 0. 0.) (70 . ))
            (foreach x lst (entmakex (list '(0 . "VERTEX") (cons 10 x) '(70 . 32))))
       )
     (cdr (assoc 330 (entget (entmakex '((0 . "SEQEND"))))))
   )
 )

;Connects selected points into a box, finds next points by angle from last point to new
;point through centroid of all points. All points must lay on the same plane in 3d space. 
;Mark Camball, March 2010
(defun c:p2b ();/ points length centroid p list_pt previousp i)
;;;;;;;;;;;;;;FIND CENTROID OF POINTS;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
(defun centroid(sspoints / sumx sumy sumz z)
(setq length (sslength points))
(setq sumx 0 sumy 0 sumz 0 z 0)
(repeat length
 (setq sumx (+ sumx (car (cdr (assoc 10 (entget (ssname points z)))))))
 (setq sumy (+ sumy (cadr (cdr (assoc 10 (entget (ssname points z)))))))
 (setq sumz (+ sumz (caddr (cdr (assoc 10 (entget (ssname points z)))))))
 (setq z (+ 1 z))
);_repeat
(setq sumx (/ sumx length) sumy (/ sumy length) sumz (/ sumz length) )
(list sumx sumy sumz)
);_centroid
;(setq sum '(0,0,0))? and add to list instead of 3 counters?
;;;;;;;;;;;;;;GET NORMAL VECTOR;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
(defun norm(sspoints / pt1 pt2 pt3)
(setq pt1 (cdr (assoc 10 (entget (ssname points 0)))))
(setq pt2 (cdr (assoc 10 (entget (ssname points 1)))))
(setq pt3 (cdr (assoc 10 (entget (ssname points 2)))))
(cal "nor(pt1,pt2,pt3)")
);_norm
;error if not all points on same plane or duplicate points chosen
;;;;;;;;;;;;DETERMINES THE NEXT POINT;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
(defun nextpoint( / amin n p2 acur pm)
 (setq amin 500);loop makes this lower every time a lower value is found 
 (setq n 0)
 (repeat length ;loop through all the points and save the next point to pm
  ;gets the coordinates from the nth point in selection set
  (setq p2 (cdr (assoc 10 (entget (ssname points n)))))
  
  ;if the new point is not same as the last point made
  (if (not (equal previousp p2))  (progn
   ;set angle from lead point to centroid to point in question (3d angle needs normal vector p)
   (setq acur (cal "ang(centroid,previousp,p2,p)"))
    
   ;if the angle is lowest found while looping through all points, make note (pm)
   (if (< acur amin)(progn
    (setq amin acur)
    (setq pm p2)
   ))_if _progn
  ))_if _progn
 (setq n (+ 1 n))
 );_repeat
 (setq pm pm);returns pm
);_nextpoint
;;;;;;;;;;;;;;;;;;PRINTS THE LIST AS A LINE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
(defun printlist(); / n p1)
;70.8 for 3d pline 66.1 for verticies follow
;70.32 ---- use 42.0 instead for pline
;sets 3dpolyline
;sets first point
;repeats the other poionts
;end polyline
(setq n 0)
(entmake      (list   (cons 0 "POLYLINE")  (cons 66 1) (cons 70   ))
(setq p1 (nth n list_pt))
(entmake (list (cons 0 "VERTEX")(cons 10 p1)(cons 70 32)))
(repeat length
(setq p1 (nth (setq n (+ 1 n)) list_pt))
(entmake (list (cons 0 "VERTEX")(cons 10 p1)(cons 70 32)))
);_repeat
(entmake (list (cons 0 "SEQEND")))
(princ)
);_printlist
;;;;;;;;;START MAIN PROGRAM;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;load in the geometry calculator
 (if (not c:cal)(arxload "geomcal"))
;sets world ucs
(command "ucs" "w")
;read in all point
(setq points (ssget '((0 . "POINT"))))
(setq length (sslength points))
;calculate centroif of points
(setq centroid (centroid points))
;calculate normal vector to points 
(setq p (norm points)) ;(only uses 3 points and assumes all are in a plane)
;create a list to store points in order and sets first point
(setq list_pt (list        (setq previousp (cdr (assoc 10 (entget (ssname points 0)))))    ))
;each time through (once for every point after first) add one coord to end of list_pt
(setq i 1)
(while (< i length)
 (setq list_pt (append list_pt (list (setq previousp (nextpoint)))))
 (setq i (+ 1 i))
);_while
;add first point to end of list to close area
(setq list_pt (append list_pt (list (nth 0 list_pt)) ))
(printlist)
;(plines)
);_defun