This is an algorithm for finding neighbors for point objects that can freely move and have no predefined position. The query sphere consists of a center location and a given radiu...
Chordal graphs can be used to encode dependency models that are representable by both directed acyclic and undirected graphs. This paper discusses a very simple and efficient algo...
In this paper we describe and analyze a method based on local least square fitting for estimating the normals at all sample points of a point cloud data (PCD) set, in the presenc...
Many applications in wireless sensor networks rely on data from neighboring nodes. However, the effort for developing efficient solutions for sharing data in the neighborhood is of...
Andreas Lachenmann, Daniel Minder, Kurt Rothermel,...
This paper deals with the generation of balanced incomplete block designs (BIBD), a hard constrained combinatorial problem with multiple applications. This problem is here formulat...