Visibility and Hidden Surface Removal
Visibility and Hidden Surface Removal Visibility and Hidden Surface Removal
Warnock’s: example © Machiraju/Zhang/Möller 74
Final issues on area subdivision • Warnock’s algorithm subdivide using rectangles • It is possible to divide by polygon boundaries – Weiler-Atherton algorithm ([F] Section 15.7.2) • Can even do area subdivision at subpixel level – Expensive obviously – full area-subdivision visibility at each pixel – Why? Use average color from all polygons that cover a pixel – antialiasing technique (later in the © Machiraju/Zhang/Möller course) 75
- Page 23 and 24: 1. Edge and face coherence • Edge
- Page 25 and 26: 2. Use of projection normalization
- Page 27 and 28: 2. Perspective Transform • Can br
- Page 29 and 30: 3. Bounding Objects (2) • For ren
- Page 31 and 32: 3. Bounding Objects (4) • rectang
- Page 33 and 34: 4. Back-face culling • Assumption
- Page 35 and 36: 5. Spatial Partitioning • break a
- Page 37 and 38: 6. Hierarchy • Use (e.g., semanti
- Page 39 and 40: z-buffer algorithm revisited • On
- Page 41 and 42: z-buffer: exploiting depth coherenc
- Page 43 and 44: z-buffer: bilinear interpolation
- Page 45 and 46: List Priority (2) • Depth compari
- Page 47 and 48: List Priority (4) • Do extents in
- Page 49 and 50: List Priority (6) • Do polygons c
- Page 51 and 52: List Priority (8) • If these test
- Page 53 and 54: List Priority (10) • More example
- Page 55 and 56: Scanline: data structure • Recall
- Page 57 and 58: Scanline Example • Another repres
- Page 59 and 60: Scanline: scan example 2 • At sca
- Page 61 and 62: Scanline: scan example 4 • Mainta
- Page 63 and 64: Scanline problems • Beware of lar
- Page 65 and 66: Building the BSP trees • Object s
- Page 67 and 68: BSP traversal example • Rendering
- Page 69 and 70: Warnock’s subdivision • Divide
- Page 71 and 72: Warnocks Algorithm (3) - Single sur
- Page 73: Warnock’s Algorithm • If none o
Warnock’s: example<br />
© Machiraju/Zhang/Möller<br />
74