—When programming a spatial computing medium such as a cellular automaton, the hop count distance to some set of sources (particles) is an often used information. In particular, ...
In this paper, we investigate the suitability of embedding Internet hosts into a Euclidean space given their pairwise distances (as measured by round-trip time). Using the classic...
Abstract. This paper proposes a novel technique for constructing a neuroanatomical shape complex atlas using an information geometry framework. A shape complex is a collection of s...
Ting Chen, Anand Rangarajan, Stephan J. Eisenschen...
We investigate the theoretical limits of positioning algorithms. In particular, we study scenarios where the nodes do not receive anchors directly (multi-hop) and where no physica...
In this paper, we propose to combine Kazhdan’s FFT-based approach to surface reconstruction from oriented points with adaptive subdivision and partition of unity blending techni...
Oliver Schall, Alexander G. Belyaev, Hans-Peter Se...