[go: up one dir, main page]

McCormack et al., 2000 - Google Patents

Tiled polygon traversal using half-plane edge functions

McCormack et al., 2000

View PDF
Document ID
481322723664844404
Author
McCormack J
McNamara R
Publication year
Publication venue
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware

External Links

Snippet

Existing techniques for traversing a polygon generate fragments one (or more) rows or columns at a time.(A fragment is all the information needed to paint one pixel of the polygon.) This order is non-optimal for many operations. For example, most frame buffers …
Continue reading at dl.acm.org (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F12/00—Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02—Addressing or allocation; Relocation
    • G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
    • G06F12/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
    • G06F12/0844—Multiple simultaneous or quasi-simultaneous cache accessing
    • G06F12/0846—Cache with multiple tag or data arrays being simultaneously accessible
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F12/00—Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02—Addressing or allocation; Relocation
    • G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
    • G06F12/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
    • G06F12/0875—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches with dedicated cache, e.g. instruction or stack
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T15/00—3D [Three Dimensional] image rendering
    • G06T15/50—Lighting effects
    • G06T15/80—Shading
    • G06T15/83—Phong shading
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T15/00—3D [Three Dimensional] image rendering
    • G06T15/04—Texture mapping
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T15/00—3D [Three Dimensional] image rendering
    • G06T15/10—Geometric effects
    • G06T15/40—Hidden part removal
    • G06T15/405—Hidden part removal using Z-buffer
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T15/00—3D [Three Dimensional] image rendering
    • G06T15/005—General purpose rendering architectures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T15/00—3D [Three Dimensional] image rendering
    • G06T15/06—Ray-tracing
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T11/00—2D [Two Dimensional] image generation
    • G06T11/40—Filling a planar surface by adding surface attributes, e.g. colour or texture
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T1/00—General purpose image data processing
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions

Similar Documents

Publication Publication Date Title
McCormack et al. Tiled polygon traversal using half-plane edge functions
US6714196B2 (en) Method and apparatus for tiled polygon traversal
McCormack et al. Neon: a single-chip 3d workstation graphics accelerator
Levenberg Fast view-dependent level-of-detail rendering using cached geometry
US7336283B2 (en) Efficient hardware A-buffer using three-dimensional allocation of fragment memory
US8570322B2 (en) Method, system, and computer program product for efficient ray tracing of micropolygon geometry
US9355492B2 (en) System, method, and computer program product for utilizing a wavefront path tracer
Hakura et al. The design and analysis of a cache architecture for texture mapping
EP0725366B1 (en) Texturing and shading 3-D images
CA2337530C (en) Apparatus and method for real-time volume processing and universal 3d rendering
Zhou et al. RenderAnts: interactive Reyes rendering on GPUs
KR100291628B1 (en) Cache memory for 3D graphic texture and its cache miss penalty reducing method
Gobbetti et al. Technical strategies for massive model visualization
Benthin et al. Efficient ray tracing of subdivision surfaces using tessellation caching
Pajarola et al. Xsplat: External memory multiresolution point visualization
Gross et al. Fast and Efficient Nearest Neighbor Search for Particle Simulations.
Chen et al. Lod-sprite technique for accelerated terrain rendering
Hasselgren et al. An Efficient Multi-View Rasterization Architecture.
Knowles et al. Fast sorting for exact OIT of complex scenes
Wald et al. Faster RTX-Accelerated Empty Space Skipping using Triangulated Active Region Boundary Geometry.
Auzinger et al. Analytic visibility on the GPU
Lefebvre et al. HA-Buffer: Coherent Hashing for single-pass A-buffer
Hofmann et al. Hierarchical multi-layer screen-space ray tracing
US11887211B2 (en) Texture mapping
Teller et al. Frustum casting for progressive, interactive rendering