Divided-Area Rendering Device Memory Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional divided-area-based rendering devices require excessive memory and bandwidth due to the need to load and process polygon data for each divided area, especially when dealing with a large number of visible polygons, leading to increased memory usage and potential interruptions.
Innovation Solution
A divided-area-based rendering device that generates an area table associating each unit polygon with the divided area it belongs to, allowing for efficient vertex processing and rasterization by determining the rendering unit polygon for each area, thereby reducing intermediate data and memory usage.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If polygon data is loaded and processed for each divided area, then rendering can be performed for each area, but the amount of intermediate data and memory bandwidth consumption increases excessively
Solution Approach 1:
The rendering region is divided into multiple divided areas, and for each unit polygon, the patent determines which divided areas it belongs to using an area table. This segmentation allows processing to be distributed across divided areas while avoiding redundant data loading, as each unit polygon's data is loaded only once and then distributed to relevant divided areas through the area table structure.
Solution Approach 2:
The patent introduces an area table as an intermediary data structure that maps unit polygons to divided areas. This area table serves as a mediator between the polygon data and the divided area processing, enabling efficient determination of which unit polygons belong to which divided areas without requiring excessive intermediate data or frequent memory access, thus resolving the contradiction between rendering efficiency and memory bandwidth consumption.
2Reliability
If polygon data is loaded for each divided area, then complete rendering information is available, but memory usage exceeds reserved memory region capacity
Solution Approach 1:
The patent performs preliminary determination of which divided areas each unit polygon belongs to by using screen coordinates and the area table before actual rendering processing. This preliminary action allows the system to prepare a compact area table that contains only the necessary mapping information, avoiding the need to load complete polygon data for each divided area and thus keeping memory usage within reserved capacity while maintaining rendering completeness.
Solution Approach 2:
The patent extracts only the essential mapping information (which unit polygons belong to which divided areas) into a separate area table, rather than loading complete polygon data for each divided area. This extraction approach maintains rendering completeness by preserving the necessary spatial relationships while significantly reducing memory usage to fit within reserved memory region capacity.
3Productivity
If comprehensive polygon processing is performed, then all visible polygons are rendered, but processing interruptions occur due to memory constraints
Solution Approach 1:
The patent implements a dynamic processing approach where the area table is generated based on actual screen coordinates and divided area configurations, allowing the system to adaptively determine polygon-area relationships. This dynamic structure enables continuous processing without interruptions, as the area table provides efficient O(1) lookup capability to determine which unit polygons belong to current divided areas, eliminating memory constraint-induced interruptions while maintaining high rendering throughput.
Data Source
AI summary
A divided-area-based rendering device includes: a table generating unit that calculates, for each unit polygon, a first area including the unit polygon, using screen coordinates, determines, from among divided areas obtained by dividing a rendering region, a divided area including at least part of the first area, and generates an area-by-polygon table that is a table in which, for each unit polygon, the divided area including the at least part of the first area including the unit polygon is associated with the unit polygon; a determining unit that determines a rendering unit polygon that is one of the unit polygons which is associated with the divided area, by referring to the area-by-polygon table; and an area rendering unit that performs, for each divided area, vertex processing and rasterization on the rendering unit polygon.