Visibility Computations in Densely Occluded Polyhedral Environments

作者: Seth Jared Teller

DOI:

关键词: Computer graphics (images)Artificial intelligencePotentially visible setGraphics hardwareGraphicsFrame ratePrecomputationRendering (computer graphics)Subset and supersetComputer visionObserver (special relativity)Computer science

摘要: These subdivision and visibility determination techniques have been implemented for general polyhedral geometric models in three dimensions. Using a furnished model of a planned computer science building as test data, we have achieved static culling rates of over 90\% and dynamic culling rates of more than 99\%, on average, decreasing the average refresh rates of a simulated walk through the model by a factor of about one hundred. The subdivision and visibility precomputation stages required several hours of compute-time for a five-story building, a reasonable figure given the design time cycle for a project of this size. The results of the visibility computation incurred less than 10\% storage overhead (15 megabytes) with respect to the amount of storage required by the geometric model itself (180 megabytes).

参考文章(0)