Most axis-aligned bounding-box (AABB) based BVH-construction algorithms are numerically robust; however, BVH ray traversal algorithms for ray tracing are still susceptible to numerical precision errors. We show where these errors come from and how they can be efficiently avoided during traversal of BVHs that use AABBs.

In this article we discuss a purely combinatorial problem, the construction of short universal traversal sequences, and its relationship to questions about logspace computation. We state the problem formally, show how it arises naturally in complexity theory, and review some of the known partial results. A basic introduction to complexity theory can be found in 6]. The P vs. NP problem is recog...

A linear time and space algorithm for construction of a binary tree from the pre-order and post-order traversals is presented. The solution is not always unique. The number of solutions is calculated and an optimal time and space method to find all the solutions is shown. Keywords: binary tree, traversals, construction of tree 1. INTRODUCTION The problem of construction the binary tree from the...

Routing is a challenging issue which should be handled in a timely manner without unnecessary time delays in MANETs. The choice of the constants affects timeliness of protocol. AODV suggests that the Node Traversal Time (NTT) should be a constant value but does not mention how this value to be adjusted with network size. The proposed method " Fuzzy Based Node Traversal Time AODV (FBNTTAODV...

In this paper we introduce a new notion of traversal sequences that we call exploration sequences. Exploration sequences share many properties with the traversal sequences defined in [AKL+], but they also exhibit some new properties. In particular, they have an ability to backtrack, and their random properties are robust under choice of the probability distribution on labels. Further, we presen...

This document specifies extensions to the Host Identity Protocol (HIP) to facilitate Network Address Translator (NAT) traversal. The extensions are based on the use of the Interactive Connectivity Establishment (ICE) methodology to discover a working path between two end-hosts, and on standard techniques for encapsulating Encapsulating Security Payload (ESP) packets within the User Datagram Pro...

A mobile agent in a network wants to visit every node of an n-node network, using a small number of steps. We investigate the performance of the following \nearest neighbor" heuristic: always go to the nearest unvisited node. If the network graph never changes, then from (Rosenkrantz, Stearns and Lewis, 1977) and (Hurkens and Woeginger, 2004) it follows that (n logn) steps are necessary and su ...

Network Address Translator (NAT) is a technology that is used for allowing multiple computers in the network to share a single public IP address for accessing the Internet. The basic reason for NAT usage is the limited number of IPv4 addresses. NAT is widely used in the current networks where it is also used as cloaking service for computers in internal network, since all computers behind the N...