TAILIEUCHUNG - Algorithms and Networking for Computer Games phần 9

tính toán cứng. Trong hình 9,17 (b) thế giới game được chia thành tĩnh, các tế bào rời rạc, và con tàu màu xám là quan tâm đến các tế bào giao nhau hào quang của nó. Lọc tế bào dễ dàng hơn để thực hiện, nhưng nó ít phân biệt đối xử hơn so với sữa công thức lọc. | 208 COMPENSATING RESOURCE LIMITATIONS computation hard. In Figure b the game world is divided into static discrete cells and the grey ship is interested in the cells that intersect its aura. Cell-based filtering is easier to implement but it is less discriminating than formula-based filtering. Figure c show extents that approximate the actual aura with rectangles . bounding boxes . The computation is simpler than when using formulae and in most cases the filtering is better than when using large cells. Filtering update messages with auras is always symmetric if the auras intersect both parties receive updates from each other. However aura can be divided further into a focus and a nimbus where focus represents an observing entity s interest and nimbus represents an observed entity s wish to be seen in a given medium Benford et al. 1994 Greenhalgh 1998 . Thus the player s focus must intersect with another player s nimbus in order to be aware of him see Figure . For example in hide-and-seek the nimbus of the hiding person could be smaller than the seeker s and the seeker cannot interact with the hider. At the same time the hider can observe the seeker if the seeker s nimbus is larger and intersects the hider s focus. Figure With focus dashed areas and nimbus grey areas the awareness needs not to be symmetric. a The grey ship s focus intersects the white ship s nimbus which means that the grey ship receives update messages from the white ship. Because the white ship s focus does not intersect the grey ship s nimbus it does not receive update messages from the grey ship. b Focus and nimbus can vary according to the medium . visual aural or textual . COMPENSATING RESOURCE LIMITATIONS 209 Area-of-interest filters can be called intrinsic filters because they use application-specific data content of an update message to determine which nodes need to receive it. This filtering provides fine-grained information delivery but message processing may .

• Kỹ thuật lập trình
• kỷ năng lập trình
• lập trình ứng dụng
• lập trình windows
• thủ thuật máy tính
• mẹo cho máy tính
• bí quyết lập trình
• thiết kế web
• lập trình web
• lập trinh dotnet
• tạo hiệu ứng web