Scribd Logo
Upload

Welcome to Scribd!

  • 3 views

    Thuaät Toaùn Weiler-Atherton: Giaûng Vieân: Buøi Tieán Leân

    Uploaded by

    my hoang
    This document discusses an algorithm for optimizing boolean operations on polygons. Specifically, it summarizes the Sutherland-Hodgman clipping algorithm, noting that it provides optimal results for convex polygons but not non-convex or concave polygons. It also states that boolean operations cannot be directly applied to polygons. The document likely proposes a new algorithm to improve on the limitations of Sutherland-Hodgman clipping for different polygon types and boolean operations.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Thuaät Toaùn Weiler-Atherton: Giaûng Vieân: Buøi Tieán Leân

    Uploaded by

    my hoang
    3 views5 pages
    This document discusses an algorithm for optimizing boolean operations on polygons. Specifically, it summarizes the Sutherland-Hodgman clipping algorithm, noting that it provides optimal results for convex polygons but not non-convex or concave polygons. It also states that boolean operations cannot be directly applied to polygons. The document likely proposes a new algorithm to improve on the limitations of Sutherland-Hodgman clipping for different polygon types and boolean operations.

    Original Description:

    đồ họa máy tính

    Original Title

    chuong_3d

    Copyright

    © © All Rights Reserved

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document discusses an algorithm for optimizing boolean operations on polygons. Specifically, it summarizes the Sutherland-Hodgman clipping algorithm, noting that it provides optimal results for convex polygons but not non-convex or concave polygons. It also states that boolean operations cannot be directly applied to polygons. The document likely proposes a new algorithm to improve on the limitations of Sutherland-Hodgman clipping for different polygon types and boolean operations.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as ppt, pdf, or txt
    3 views5 pages

    Thuaät Toaùn Weiler-Atherton: Giaûng Vieân: Buøi Tieán Leân

    Uploaded by

    my hoang
    This document discusses an algorithm for optimizing boolean operations on polygons. Specifically, it summarizes the Sutherland-Hodgman clipping algorithm, noting that it provides optimal results for convex polygons but not non-convex or concave polygons. It also states that boolean operations cannot be directly applied to polygons. The document likely proposes a new algorithm to improve on the limitations of Sutherland-Hodgman clipping for different polygon types and boolean operations.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as ppt, pdf, or txt
    of 5

    THUAT TOAN WEILER-ATHERTON

    Giang vien : Bui Tien Len

    at van e
    anh gia thuat toan xen a giac SutherlandHodgeman u - Cho ket qua tot oi vi a giac loi Khuyet - Cha cho c ket qua toi u oi vi trng hp a giac lom - Khong the m rong thanh cac phep toan boolean tren cac a giac

    Trang 2

    Bai toan

    Trang 3

    Thuat toan

    Trang 4

    Trang 5

    You might also like