1 / 4

Wednesday, March 1, 2000 William H. Hsu Department of Computing and Information Sciences, KSU

Lecture 13. Visible Surface Determination. Wednesday, March 1, 2000 William H. Hsu Department of Computing and Information Sciences, KSU http://www.cis.ksu.edu/~bhsu Readings: Sections 15.1-15.2, Foley et al (Reference) Hearn and Baker 2 e Slide Set 5, VanDam (8b, 11/09/1999).

vanya
Download Presentation

Wednesday, March 1, 2000 William H. Hsu Department of Computing and Information Sciences, KSU

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Lecture 13 Visible Surface Determination Wednesday, March 1, 2000 William H. Hsu Department of Computing and Information Sciences, KSU http://www.cis.ksu.edu/~bhsu Readings: Sections 15.1-15.2, Foley et al (Reference) Hearn and Baker 2e Slide Set 5, VanDam (8b, 11/09/1999)

  2. Lecture Outline • Readings • Sections 15.1-15.2, Foley et al • Outside reading (optional): Hearn and Baker 2e • Outside reading (required): Slide Set 5, VanDam (11/09/1999) • Recently • Surface models and solid modeling • Color theory • Today • Quick review • Visible surface data structures • Overview of basic problem • Visible surface determination (VSD) algorithms • Back-face culling • Depth buffer akaz-buffer • Depth sort algorithms: painter’s algorithm, etc. • Next Class: Realism, Midterm Review

  3. Terminology • Visible Surface Determination (VSD) • Ray tracing • Data structures and associated techniques • Boundary representations (B-reps): bounding volumes, other models • Depth buffer • Priority queue • Binary space partitioning (BSP) trees • Associated algorithms • Quick rejection testing, back-face culling • Depth bufferakaz-buffer algorithms • Depth sort algorithms: painter’s algorithm, etc. • BSP tree algorithm • Taxonomy of Algorithms • Depth buffer • List-priority: depth sort, BSP tree • Scan line (aka sweep line)

  4. Summary Points • Visible Surface Determination (VSD) • Ray tracing • Techniques for efficient VSD • Perspective transform • Bounding volumes (cubes and other polyhedra) • Back-face culling • Data structures: depth buffer, priority queue, active-edge table (AET) • Associated algorithms: z-buffer, painter’s, sweepline • Taxonomy of VSD Algorithms • Depth buffer • List priority • Scan line • Next Class • Visual realism (skim Chapter 14, FVD) • Midterm review (bring questions!)

More Related