• Journal of Korea Game Society
• /
• v.14 no.6
• /
• pp.29-38
• /
• 2014

In the large scale indoor 3D game scenes, the data amount of potentially visible set (PVS) which pre-computes the information of occlusion culling can be huge. However, the large part of them can be represented as zero. In this paper, the effective hardware structure is designed, which compresses PVS data as the way of zero run length encoding (ZRLE) during building the scene trees of 3D games in mobile environments. The compression ratio of the proposed structure and the rendering speed (frame per second: FPS) according to both PVS culling and frustum culling are analyzed under 3D game simulations.

• Journal of the Korea Computer Graphics Society
• /
• v.8 no.2
• /
• pp.9-14
• /
• 2002

In cases of densely occluded urban scenes, it is effective to determine the visibility of scenes, since only small parts of the scene are visible from a given cell. In this paper, we introduce a new visibility preprocessing method that efficiently computes potentially visible objects for volumetric cells. The proposed method deals with general 3D polygonal models and invisible objects jointly blocked by multiple occluders. The proposed approach decomposes volume visibility into a set of point visibilities, and then computes point visibility using hardware visibility queries, in particular HP_occlusion_test and NV_occlusion_query. We carry out experiments on various large-scale scenes, and show the performance of our algorithm.

• The KIPS Transactions:PartD
• /
• v.11D no.4
• /
• pp.783-798
• /
• 2004

An e-business client application in ubiquitous mobile computing environment may become disconnected from the enterprise server due to broken communication connections caused by the limitation of mobile computing environments(limited battery life of the mobile device, low bandwidth communication, incomplete wireless communication infrastructure, etc). It Is even Possible that mobile client application Intentionally operates in disconnected mode to reduce communication cost and the power consumption of the mobile device. We use “data hoarding” as a means of providing local autonomy to allow transactions to be processed and committed on the mobile host despite of disconnection. The key problem to this approach is the synchronization problem that serialize potentially conflicting updates from disconnected clients on master objects of the server database. In this paper, we present a new transaction synchronizing method that splits a transaction into a set of independent component transactions and give the synchronization priority on each component taking the possibility of use and conflicts in the server into consideration. Synchronization is performed component by component based un synchronization priority. After the Preferred component of a no bile transaction succeeds in synchronization with the server, the mobile transaction can pre-commit at server. A pre-committed transaction's updated value is made visible at server before the final commit of the transaction. The synchronization of the component with low synchronization priority can be delayed in adaption to wireless bandwidth and computing resources. As a result, the availability of important data updated by mobile client is increased and it can maximize the utilization of the limited wireless bandwidth and computing resources.