亚洲在线久爱草,狠狠天天香蕉网,天天搞日日干久草,伊人亚洲日本欧美

為了賬號安全,請及時綁定郵箱和手機立即綁定
已解決430363個問題,去搜搜看,總會有你想問的

如何在pygame中找到三角形的中點,然后遞歸地重復執行它以形成謝爾賓斯基三角形?

如何在pygame中找到三角形的中點,然后遞歸地重復執行它以形成謝爾賓斯基三角形?

ibeautiful 2023-12-08 15:58:56
如何找到最初繪制的三角形的中點?我需要創建一個謝爾賓斯基三角形,其中一個三角形內有多個三角形。到目前為止,我有第一個三角形的代碼,如下所示:import pygamepygame.init()colors = [pygame.Color(0, 0, 0, 255),       # Black          pygame.Color(255, 0, 0, 255),     # Red          pygame.Color(0, 255, 0, 255),     # Green          pygame.Color(0, 0, 255, 255),     # Blue          pygame.Color(255, 255, 255, 255)] # White# Each of these constants is the index to the corresponding pygame Color object# in the list, colors, defined above.BLACK = 0RED = 1GREEN = 2BLUE = 3WHITE = -1height = 640width = 640size = [width, height]screen = pygame.display.set_mode(size)screen.fill(WHITE)def draw_triangle(p1, p2, p3, color, line_width, screen):    p1 = [5, height - 5]    p2 = [(width - 10) / 2, 5]    p3 = [width - 5, height - 5]    pygame.draw.polygon(screen, 0, [p1, p2, p3], 2)    pygame.display.flip()def find_midpoint(p1, p2):def sierpinski(degree, p1, p2, p3, color, line_width, screen):剩下的兩個函數都是完成謝爾賓斯基三角形所需要的。首先,創建一個函數來查找中點,然后創建一個在這些三角形內創建多個三角形(稱為謝爾賓斯基三角形)的函數。
查看完整描述

2 回答

?
智慧大石

TA貢獻1946條經驗 獲得超3個贊

另一個三角形內的“中點三角形”由一個三角形定義,該三角形的坐標是周圍三角形各邊的中點:

https://img1.sycdn.imooc.com/6572cce4000126d002210219.jpg

因此,對于三角形的每條線/邊,計算中點:


def lineMidPoint( p1, p2 ):

    """ Return the mid-point on the line p1 to p2 """

    # Ref: https://en.wikipedia.org/wiki/Midpoint

    x1, y1 = p1

    x2, y2 = p2

    x_mid = round( ( x1 + x2 ) / 2 )

    y_mid = round( ( y1 + y2 ) / 2 )

    return ( x_mid, y_mid )

在您的情況下,這將被多次調用p1,p2并p3生成 3 個“角”三角形:


# midpoints of each size

mid_p1 = lineMidPoint( p1, p2 )

mid_p2 = lineMidPoint( p2, p3 )

mid_p3 = lineMidPoint( p3, p1 ) 


# The 3 "corner" triangles

upper_triangle = [ mid_p1, p2, mid_p2 ]

left_triangle  = [ p1, mid_p1, mid_p3 ]

right_triangle = [ mid_p3, mid_p2, p3 ]


# The inner triangle (for the sake of completeness)

inner_triangle = [ mid_p1, mid_p2, mid_p3 ]

然后,您需要將其包裝在遞歸調用中,并進行某種深度救助。


就像是:


def drawTriangle( window, colour, points, bailout=5 ):

    if ( bailout > 0 ):

        # Calculate the 3 inner corner-triangles

        p1, p2, p3 = points

        mid_p1 = lineMidPoint( p1, p2 )

        mid_p2 = lineMidPoint( p2, p3 )  # mid-point of each side

        mid_p3 = lineMidPoint( p3, p1 ) 


        # triangles between the original corners, and new mid-points

        upper_triangle = [ mid_p1, p2, mid_p2 ]  

        left_triangle  = [ p1, mid_p1, mid_p3 ]

        right_triangle = [ mid_p3, mid_p2, p3 ]


        drawTriangle( window, colour, upper_triangle, bailout-1 )

        drawTriangle( window, colour, left_triangle,  bailout-1 )

        drawTriangle( window, colour, right_triangle, bailout-1 )

    else:

        pygame.draw.lines( window, colour, True, points )  # draw triangle

我認為這畫出了一個謝爾賓斯基三角形

https://img1.sycdn.imooc.com/6572ccf30001625004020428.jpg

查看完整回答
反對 回復 2023-12-08
?
萬千封印

TA貢獻1891條經驗 獲得超3個贊

我不確定爭論的目的degree是什么,也許是為了限制遞歸深度?


這是一個基于您的問題的示例,使用遞歸 sierpinski 函數:


import pygame


def draw_triangle(p1, p2, p3, color, line_width, screen):

    pygame.draw.polygon(screen, color, [p1, p2, p3], line_width)


def midpoint(p1, p2):

    """ Return the mid-point on the line p1 to p2 """

    x1, y1 = p1

    x2, y2 = p2

    x_mid = (x1 + x2) // 2

    y_mid = (y1 + y2) // 2

    return (x_mid, y_mid)


def sierpinski(degree, p1, p2, p3, color, line_width, screen):

    # p1 → bottom left, p2 → bottom right, p3 → top

    # recursive function so check for exit condition first

    if abs(p1[0] - p2[0]) <= 2 and abs(p2[0] - p3[0]) <= 2 and abs(p1[0] - p3[0]) <= 2:

        return

    draw_triangle(p1, p2, p3, color, line_width, screen)

    a = midpoint(p1, p2)

    b = midpoint(p1, p3)

    c = midpoint(p2, p3)

    # skip the centre triangle

    sierpinski(degree, p1, a, b, color, line_width, screen)

    sierpinski(degree, p2, a, c, color, line_width, screen)

    sierpinski(degree, p3, b, c, color, line_width, screen)


height = 640

width = 640

pygame.init()

screen = pygame.display.set_mode((width, height), pygame.RESIZABLE)

pygame.display.set_caption("Sierpiński")

clock = pygame.time.Clock()

update_screen = True

running = True

while running:

    for event in pygame.event.get():

        if event.type == pygame.QUIT:

            running = False

        elif event.type == pygame.VIDEORESIZE:

            width, height = event.dict["size"]

            screen = pygame.display.set_mode((width, height), pygame.RESIZABLE)

            update_screen = True


    if update_screen:

        # only draw the screen when required

        screen.fill(pygame.color.Color("white"))

        # determine initial points based on window size

        p1 = [5, height - 5]

        p2 = [(width - 10) // 2, 5]

        p3 = [width - 5, height - 5]

        sierpinski(None, p1, p2, p3, pygame.color.Color("black"), 1, screen)

        pygame.display.update()

        update_screen = False

    # limit framerate

    clock.tick(30)

pygame.quit()

為了簡潔起見,我刪除了顏色處理,而是使用pygame.color.Color接受其構造函數的字符串參數。我還使用整數除法//來代替round(…).


根據遞歸函數的深度或復雜性,您可以重新繪制每一幀,但我想展示一個限制示例,以防函數復雜性增加。最后,我最近一直在調整屏幕大小,這似乎與一次繪制有關,所以我也將其包括在內。

https://img1.sycdn.imooc.com/6572cd050001be5a06510863.jpg

編輯:我修改了該sierpinski函數以支持degree指定遞歸 dep 的參數


def sierpinski(degree, p1, p2, p3, color, line_width, screen):

    # p1 → bottom left, p2 → bottom right, p3 → top

    # recursive function so check for exit condition first

    if degree is None:

        if abs(p1[0] - p2[0]) <= 2 and abs(p2[0] - p3[0]) <= 2 and abs(p1[0] - p3[0]) <= 2:

            return

    else:

        if degree == 0:

            return

        else:

            degree -= 1

    …

然后我添加了一些事件處理,以便可以使用鼠標滾輪來增加和減少度數,這顯示在標題欄上:


elif event.type == pygame.MOUSEBUTTONUP:

    if event.button == 4:  # wheel up

        if degree is None:

            degree = 8

        else:

            degree += 1

            if degree > maximum_degree:

                degree = maximum_degree

        update_screen = True

    elif event.button == 5: # wheel down

        if degree is None:

            degree = 3

        else:

            degree -= 1

            if degree < minimum_degree:

                degree = minimum_degree

        update_screen = True


查看完整回答
反對 回復 2023-12-08
  • 2 回答
  • 0 關注
  • 172 瀏覽
慕課專欄
更多

添加回答

舉報

0/150
提交
取消
微信客服

購課補貼
聯系客服咨詢優惠詳情

幫助反饋 APP下載

慕課網APP
您的移動學習伙伴

公眾號

掃描二維碼
關注慕課網微信公眾號