We consider the problem of computing the centroid of all the vertices in a non-degenerate arrangement of n lines. The trivial approach requires the enumeration of all `n 2 ´ verti...
Deepak Ajwani, Saurabh Ray, Raimund Seidel, Hans R...
This paper presents algorithms for computing offsets of NURBS curves and surfaces. The basic approach consists of four steps: (1) recognition of special curves and surfaces; (2) s...
—In this paper, we present three different methods for implementing the Probabilistic Neural Network on a Beowulf cluster computer. The three methods, Parallel Full Training Set ...
Jimmy Secretan, Michael Georgiopoulos, Ian Maidhof...
In this paper, we study efficient data collection for wireless sensor networks. We present efficient distributed algorithms with approximately the minimum delay, or the minimum mes...
Teaching computer science to children is a major priority in most countries in the world. Nevertheless, Computer Science curricula do not seem to address the children’s world, c...