The problem of navigating an autonomous mobile robot through an unexplored terrain of obstacles is the focus of this paper. The case when the obstacles are ‘known’ has been extensively studied in literature. The process of robot navigation in completely unexplored terrains involves both learning the information about the obstacle terrain and path planning. We present an algorithm to navigate a ...

Because of its simplicity and intuitive approach, pointbased rendering has been a very popular research area. Recent approaches have focused on hardware-accelerated techniques. By applying a deferred shading scheme, both high-quality images and high-performance rendering have been achieved. However, previous methods showed problems related to depth-based visibility computation. We propose an ex...

An experiment investigated systematic pointing errors in horizontal movements performed without visual feedback toward 48 targets placed symmetrically around two initial hand positions. Our main goal was to provide evidence in favor of the hypothesis that amplitude and direction of the movements are planned independently on the basis of the hand-target vector (vectorial parametric hypothesis, V...

Tracking humans that are interacting with the other subjects or environment remains unsolved in visual tracking, because the visibility of the human of interests in videos is unknown and might vary over time. In particular, it is still difficult for state-of-the-art human trackers to recover complete human trajectories in crowded scenes with frequent human interactions. In this work, we conside...

For any non-trivial abelian group A under addition a graph $G$ is said to be $A$-textit{magic}  if there exists a labeling $f:E(G) rightarrow A-{0}$ such that, the vertex labeling $f^+$  defined as $f^+(v) = sum f(uv)$ taken over all edges $uv$ incident at $v$ is a constant. An $A$-textit{magic} graph $G$ is said to be $Z_k$-magic graph if the group $A$ is $Z_k$  the group of integers modulo $k...

In this paper we present a very simple proof of the following result due to Abello et al [5], concerning the visibility graphs of simple polygons. The result says that the visibility graph of any simple nondegenerate polygon is isomorphic to the visibility graph of some simple staircase polygon. As a result of the above proof we also give an O(n log n) time algorithm for the following problem: ...