Parallel computation of alpha complexes for biomolecules
نویسندگان
چکیده
منابع مشابه
Parallel computation framework for optimizing trailer routes in bulk transportation
We consider a rich tanker trailer routing problem with stochastic transit times for chemicals and liquid bulk orders. A typical route of the tanker trailer comprises of sourcing a cleaned and prepped trailer from a pre-wash location, pickup and delivery of chemical orders, cleaning the tanker trailer at a post-wash location after order delivery and prepping for the next order. Unlike traditiona...
متن کاملParallel Computation of 3D Morse-Smale Complexes
The Morse-Smale complex is a topological structure that captures the behavior of the gradient of a scalar function on a manifold. This paper discusses scalable techniques to compute the Morse-Smale complex of scalar functions defined on large three-dimensional structured grids. Computing the Morse-Smale complex of three-dimensional domains is challenging as compared to two-dimensional domains b...
متن کاملModels for Parallel Computation
Parallel computing must meet seemingly contradictory goals: software development should be carried out in an architecture-and technology-independent environment, while both algorithms and system software should take full advantage of the features of the underlying parallel architecture. At the same time, application programmers cannot be expected to be parallel processing experts. Usability, sc...
متن کاملArrows for Parallel Computation
Arrows are a general interface for computation and an alternative to Monads for API design. In contrast to Monad-based parallelism, we explore the use of Arrows for specifying generalised parallelism. Specifically, we define an Arrow-based language and implement it using multiple parallel Haskells. As each parallel computation is an Arrow, such parallel Arrows (PArrows) can be readily composed ...
متن کاملSupplemental Material for “ Parallel Computation of 3 D Morse - Smale complexes ”
Gradient and MS Complex on sub-domains. Gradient pairs are computed within a sub-domain using Algorithm 1 and Algorithm 2 from section 4. The cell complex of the sub-domain is extended to include the set of cells that are incident on the shared boundary of sub-domains but gradient pairs are computed only on the initial sub-domain cell complex (see Figure 1b). Thus, we obtain identical pairings ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2020
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2020.101651