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

Pic.1

Clipping

Pic.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 …

Pic.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 …

Pic.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 …

Pic.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 …

Pic.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:

Pic.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 …

Pic.8

Weiler-Atherton Algorithm

Pic.9

Find the intersection vertices and connect them in the two lists

Pic.10

Find the intersection vertices and connect them in the two lists

Pic.11

Find the intersection vertices and connect them in the two lists

Pic.12

Completed Loop

Pic.13

Classify each intersection vertex as Entering or Leaving

Pic.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 …

Pic.15

Capture clipped polygons Loop 1: L, 4, 5, K Loop 2: J, 9, 0, i

Pic.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 …

Pic.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 …

Pic.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

Pic.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 …

Pic.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 …

Скачать презентацию

Если вам понравился сайт и размещенные на нем материалы, пожалуйста, не забывайте поделиться этой страничкой в социальных сетях и с друзьями! Спасибо!