Decentralized and coordinate-free computation of critical points and surface networks in a discretized scalar field

Abstract

This paper provides a decentralized and coordinate-free algorithm, called DGraF (decentralized gradient field) to identify critical points (peaks, pits, and passes) and the topological structure of the surface network connecting those critical points. Algorithms that can operate in the network without centralized control and without coordinates are… (More)
DOI: 10.1080/13658816.2013.801578

Topics

8 Figures and Tables

Slides referencing similar topics