按順時(shí)針順序排序點(diǎn)？給定一個(gè)x，y點(diǎn)數(shù)組，如何按順時(shí)針順序（圍繞它們的整體平均中心點(diǎn)）對(duì)該數(shù)組的點(diǎn)進(jìn)行排序？我的目標(biāo)是將點(diǎn)傳遞給線創(chuàng)建函數(shù)，以最終看起來相當(dāng)“堅(jiān)實(shí)”的東西，盡可能凸起，沒有相交的線。為了它的價(jià)值，我正在使用Lua，但任何偽代碼都會(huì)受到贊賞。非常感謝您的幫助！更新：作為參考，這是基于Ciamej優(yōu)秀答案的Lua代碼（忽略我的“app”前綴）：function appSortPointsClockwise(points)    local centerPoint = appGetCenterPointOfPoints(points)    app.pointsCenterPoint = centerPoint    table.sort(points, appGetIsLess)    return pointsendfunction appGetIsLess(a, b)    local center = app.pointsCenterPoint    if a.x >= 0 and b.x < 0 then return true    elseif a.x == 0 and b.x == 0 then return a.y > b.y    end    local det = (a.x - center.x) * (b.y - center.y) - (b.x - center.x) * (a.y - center.y)    if det < 0 then return true    elseif det > 0 then return false    end    local d1 = (a.x - center.x) * (a.x - center.x) + (a.y - center.y) * (a.y - center.y)    local d2 = (b.x - center.x) * (b.x - center.x) + (b.y - center.y) * (b.y - center.y)    return d1 > d2endfunction appGetCenterPointOfPoints(points)    local pointsSum = {x = 0, y = 0}    for i = 1, #points do pointsSum.x = pointsSum.x + points[i].x; pointsSum.y = pointsSum.y + points[i].y end    return {x = pointsSum.x / #points, y = pointsSum.y / #points}end