{"id":131,"date":"2007-05-12T14:55:01","date_gmt":"2007-05-12T12:55:01","guid":{"rendered":" http:\/\/www.nsonic.de\/blog\/2007\/05\/triangle-algorithm\/"},"modified":"2007-05-12T14:55:03","modified_gmt":"2007-05-12T12:55:03","slug":"triangle-algorithm","status":"publish","type":"post","link":"https:\/\/www.nsonic.de\/blog\/2007\/05\/triangle-algorithm\/","title":{"rendered":"Triangle algorithm"},"content":{"rendered":"

Lars Gollub a \u00e9crit dans l’article
\n<6up816$k8u36@forums.borland.com \n \n>…
\n> >Can you use the fillpoly routine or something like that?
\n>
\n> Well, no. This is why I am asking for the algorithm. Windows is
\n> very slow in drawing *many small* Objects. So I draw them
\n<\/em>
\n
\nwell, take a look in the good all SWAG ! Von: Paul TOTH
\nBetreff: Re: Triangle algorithm
\nDatum: Dienstag, 29. September 1998 08:28<\/p>\n

look on my Pascal Page for ZED & BODY.
\n—
\nsee the triangle as a array of horizontal lines…(or vertical for fast VGA
\nX-Mode)<\/p>\n

0
\n.
\nRightX…..LeftX
\n. A
\n. BBBB
\n. CCCCCC
\n. DDDDDDDD
\n.
\nMaxY<\/p>\n

[code lang=”delphi”]Var
\n RightX:array[0..MaxY] of word;
\n LeftX :array[0..MaxY] of word; <\/p>\n

procedure DrawTriangle(color:TColor);
\n var
\n x1,x2,y:integer;
\n begin
\n for y:=0 to MaxY do begin
\n x1:=RightX;
\n x2:=LeftX;
\n if x1<0 then begin dx:=-dx; ix:=-1 end else ix:=+1;\n dy:=y2-y1; if dy<0 then begin dy:=-dy; iy:=-1 end else iy:=+1;\n if dx>dy then begin
\n e1:= 2*dy;
\n e2:=e1-dx;
\n e3:=e2-dx;
\n for i:=0 to dx do begin
\n if x1LeftSX[y1] then LeftX[y1] :=x1;
\n inc(x1,ix);
\n if e2<0 then inc(e2,e1) else begin\n inc(e2,e3);\n inc(y1,iy);\n end;\n end;\n end else begin\n e1:= 2*dx;\n e2:=e1-dy;\n e3:=e2-dy;\n for i:=0 to dy do begin\n if x1LeftX[y1] then LeftX[y1] :=x1;\n inc(y1,iy);\n if e2<0 then inc(e2,e1) else begin\n inc(e2,e3);\n inc(x1,ix);\n end;\n end;\n end;\n end;\n\nprocedure Triangle(x1,y1,x2,y2,x3,y3,color:integer);\n begin\n fillchar(RightX,SizeOf(RightX),255); \/\/ default 65535\n fillchar(LeftX,SizeOf(LeftX),0); \/\/ default 0\n scan(x1,y1,x2,y2);\n scan(x2,y2,x3,y3); \n scan(x3,y3,x1,y1);\n DrawTriangle(Color);\n end;\n[\/code]\n\n[tags]Delphi, Graphic[\/tags]\n<\/p>\n","protected":false},"excerpt":{"rendered":"

Lars Gollub a \u00e9crit dans l’article <6up816$k8u36@forums.borland.com >… > >Can you use the fillpoly routine or something like that? > > Well, no.…<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"spay_email":""},"categories":[11],"tags":[75,101],"jetpack_featured_media_url":"","jetpack_shortlink":"https:\/\/wp.me\/p71Tml-27","_links":{"self":[{"href":"https:\/\/www.nsonic.de\/blog\/wp-json\/wp\/v2\/posts\/131"}],"collection":[{"href":"https:\/\/www.nsonic.de\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.nsonic.de\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.nsonic.de\/blog\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.nsonic.de\/blog\/wp-json\/wp\/v2\/comments?post=131"}],"version-history":[{"count":0,"href":"https:\/\/www.nsonic.de\/blog\/wp-json\/wp\/v2\/posts\/131\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.nsonic.de\/blog\/wp-json\/wp\/v2\/media?parent=131"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.nsonic.de\/blog\/wp-json\/wp\/v2\/categories?post=131"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.nsonic.de\/blog\/wp-json\/wp\/v2\/tags?post=131"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}