🗊Презентация Clipping summary

Категория: Математика
Нажмите для полного просмотра!
Clipping summary, слайд №1Clipping summary, слайд №2Clipping summary, слайд №3Clipping summary, слайд №4Clipping summary, слайд №5Clipping summary, слайд №6Clipping summary, слайд №7Clipping summary, слайд №8Clipping summary, слайд №9Clipping summary, слайд №10Clipping summary, слайд №11Clipping summary, слайд №12Clipping summary, слайд №13Clipping summary, слайд №14Clipping summary, слайд №15Clipping summary, слайд №16Clipping summary, слайд №17Clipping summary, слайд №18Clipping summary, слайд №19Clipping summary, слайд №20
Скачать
Вы можете ознакомиться и скачать презентацию на тему Clipping summary. Доклад-сообщение содержит 20 слайдов. Презентации для любого класса можно скачать бесплатно. Если материал и наш сайт презентаций Mypresentation Вам понравились – поделитесь им с друзьями с помощью социальных кнопок и добавьте в закладки в своем браузере.

Слайды и текст этой презентации

Слайд 1


Clipping
Описание слайда:
Clipping

Слайд 2


Clipping Summary It’s the process of finding the exact part of a polygon lying inside the view volume To maintain consistency, clipping of a polygon should result in a polygon, not a sequence of partially unconnected lines We will first look at 2 different 2D solutions and then extend one to 3D
Описание слайда:
Clipping Summary It’s the process of finding the exact part of a polygon lying inside the view volume To maintain consistency, clipping of a polygon should result in a polygon, not a sequence of partially unconnected lines We will first look at 2 different 2D solutions and then extend one to 3D

Слайд 3


Sutherland-Hodgman Algorithm Clip the polygon against each boundary of the clip region successively Result is possibly NULL if polygon is outside Can be generalised to work for any polygonal clip region, not just rectangular
Описание слайда:
Sutherland-Hodgman Algorithm Clip the polygon against each boundary of the clip region successively Result is possibly NULL if polygon is outside Can be generalised to work for any polygonal clip region, not just rectangular

Слайд 4


Clipping To A Region To find the new polygon iterate through each of the polygon edges and construct a new sequence of points starting with an empty sequence for each edge there are 4 possible cases to consider
Описание слайда:
Clipping To A Region To find the new polygon iterate through each of the polygon edges and construct a new sequence of points starting with an empty sequence for each edge there are 4 possible cases to consider

Слайд 5


Clipping a polygon edge against the boundary Given an edge P0,P1 we have 4 cases: entering the clipping region add P and P1 leaving the region add only P entirely outside do nothing entirely inside add only P1 Where P is the point of intersection
Описание слайда:
Clipping a polygon edge against the boundary Given an edge P0,P1 we have 4 cases: entering the clipping region add P and P1 leaving the region add only P entirely outside do nothing entirely inside add only P1 Where P is the point of intersection

Слайд 6


Still the Sutherland-Hodgman We can determine which of the 4 cases and also the point of intersection with just if statements To sum it up, an example:
Описание слайда:
Still the Sutherland-Hodgman We can determine which of the 4 cases and also the point of intersection with just if statements To sum it up, an example:

Слайд 7


Weiler-Atherton Algorithm When we have non-convex polygons then the algorithm above might produce polygons with coincident edges This is fine for rendering but maybe not for other applications (eg shadows) The Weiler-Atherton algorithm produces separate polygons for each visible fragment
Описание слайда:
Weiler-Atherton Algorithm When we have non-convex polygons then the algorithm above might produce polygons with coincident edges This is fine for rendering but maybe not for other applications (eg shadows) The Weiler-Atherton algorithm produces separate polygons for each visible fragment

Слайд 8


Weiler-Atherton Algorithm
Описание слайда:
Weiler-Atherton Algorithm

Слайд 9


Find the intersection vertices and connect them in the two lists
Описание слайда:
Find the intersection vertices and connect them in the two lists

Слайд 10


Find the intersection vertices and connect them in the two lists
Описание слайда:
Find the intersection vertices and connect them in the two lists

Слайд 11


Find the intersection vertices and connect them in the two lists
Описание слайда:
Find the intersection vertices and connect them in the two lists

Слайд 12


Completed Loop
Описание слайда:
Completed Loop

Слайд 13


Classify each intersection vertex as Entering or Leaving
Описание слайда:
Classify each intersection vertex as Entering or Leaving

Слайд 14


Capture clipped polygons Start at an entering vertex If you encounter a leaving vertex swap to right hand (clip polygon) loop If you encounter an entering vertex swap to left hand (polygon) loop A loop is finished when you arrive back at start Repeat whilst there are entering vertices
Описание слайда:
Capture clipped polygons Start at an entering vertex If you encounter a leaving vertex swap to right hand (clip polygon) loop If you encounter an entering vertex swap to left hand (polygon) loop A loop is finished when you arrive back at start Repeat whilst there are entering vertices

Слайд 15


Capture clipped polygons Loop 1: L, 4, 5, K Loop 2: J, 9, 0, i
Описание слайда:
Capture clipped polygons Loop 1: L, 4, 5, K Loop 2: J, 9, 0, i

Слайд 16


Clipping Polygons in 3D The Sutherland-Hodgman can easily be extended to 3D the clipping boundaries are 6 planes instead of 4 lines intersection calculation is done by comparing an edge to a plane instead of edge to edge It can either be done in Projection Space or in Canonical Perspective
Описание слайда:
Clipping Polygons in 3D The Sutherland-Hodgman can easily be extended to 3D the clipping boundaries are 6 planes instead of 4 lines intersection calculation is done by comparing an edge to a plane instead of edge to edge It can either be done in Projection Space or in Canonical Perspective

Слайд 17


Clipping in Projection Space The view volume is defined by: Testing for the 4 cases is fast, for example for the x = 1 (right) clip plane: x0  1 and x1  1 entirely inside x0  1 and x1 > 1 leaving x0 > 1 and x1  1 entering x0 > 1 and x1 > 1 entirely outside
Описание слайда:
Clipping in Projection Space The view volume is defined by: Testing for the 4 cases is fast, for example for the x = 1 (right) clip plane: x0  1 and x1  1 entirely inside x0  1 and x1 > 1 leaving x0 > 1 and x1  1 entering x0 > 1 and x1 > 1 entirely outside

Слайд 18


Clipping in Canonical Perspective When we have an edge that extends from the front to behind the COP, then if we clip after projection (which in effect is what the PS does) we might get wrong results
Описание слайда:
Clipping in Canonical Perspective When we have an edge that extends from the front to behind the COP, then if we clip after projection (which in effect is what the PS does) we might get wrong results

Слайд 19


Clipping in Homogeneous Coord. The Sutherland-Hodgman can also be used for clipping in 4D before dividing the points by the w This can have the advantage that is even more general, it even allows for the front clip plane to be behind the COP
Описание слайда:
Clipping in Homogeneous Coord. The Sutherland-Hodgman can also be used for clipping in 4D before dividing the points by the w This can have the advantage that is even more general, it even allows for the front clip plane to be behind the COP

Слайд 20


Clipping Recap Sutherland-Hodgman is simple to describe but fails in certain cases Weiler-Atherton clipping is more robust but considerably harder Both extend to 3D but we need to consider projection and end up clipping in 4D
Описание слайда:
Clipping Recap Sutherland-Hodgman is simple to describe but fails in certain cases Weiler-Atherton clipping is more robust but considerably harder Both extend to 3D but we need to consider projection and end up clipping in 4D

Скачать

Теги Clipping summary
Похожие презентации
Mypresentation.ru
Загрузить презентацию