2003
DOI: 10.1046/j.1540.8167.90307.x
|View full text |Cite
|
Sign up to set email alerts
|

Atrial Excitation Assuming Uniform Propagation

Abstract: Atrial Excitation Assuming Uniform Propagation. Introduction:We investigated the spread of the excitation wave over the atria following initiation in a given focus in an atrial model containing its overall geometry only, i.e., without atrial bundles.Methods and Results: The propagation velocity of the excitation wave was taken to be uniform, and the wall thickness was discarded. The timing of excitation of any point on the atrium thus becomes directly proportional to its shortest distance over the atrial wall … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2006
2006
2014
2014

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 21 publications
(8 citation statements)
references
References 25 publications
0
8
0
Order By: Relevance
“…This was first observed in an application to the relatively simple atrial activation sequence, frequently involving just the “focus” in the sinus node region. 56 Subsequently, it also proved to be effective in applications to the ventricles.…”
Section: Discussionmentioning
confidence: 99%
See 2 more Smart Citations
“…This was first observed in an application to the relatively simple atrial activation sequence, frequently involving just the “focus” in the sinus node region. 56 Subsequently, it also proved to be effective in applications to the ventricles.…”
Section: Discussionmentioning
confidence: 99%
“…The nature of this data is summarized below. More details can be found in previous publications, 1 , 13 , 35 , 56 in which essentially the same material was used.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…At this stage any pair of vertices is connected at least via the surface edges, but ‘shortcuts’ through the volume generally exist. The optimal route is computed by means of a standard ‘all pairs shortest path’ algorithm like Floyd–Warshall [60]; cf. figure 4 a .…”
Section: Neural Activity Model and Signal Expressionmentioning
confidence: 99%
“…5 The distance matrix (all-pairs shortest path) is computed using Johnson's algorithm 3 as implemented by David Gleich in the toolbox MATLABBGL (available at MATLAB Central file exchange). First, a point x 1 is randomly selected.…”
Section: Random Distribution Of Phase Singularitiesmentioning
confidence: 99%