Connectivity in the developing hippocampus displays a functional organization particularly effective in supporting network synchronization, as it includes superconnected hub neurons. We have previously shown that hub network function is supported by a subpopulation of GABA neurons. However, it is unclear whether hub cells are only transiently present or… (More)
This paper presents a new method for computing whether or not two triangles in three dimensions intersect. The code is very efficient and requires minimum arithmetic precision. Indeed, all branching decisions are carried out by evaluating the signs of degree three polynomials. In addition, an efficient test is proposed for the two-dimensional case. Tests… (More)
Early-born γ-aminobutyric acid (GABA) neurons (EBGNs) are major components of the hippocampal circuit because at early postnatal stages they form a subpopulation of "hub cells" transiently supporting CA3 network synchronization (Picardo et al.  Neuron 71:695-709). It is therefore essential to determine when these cells acquire the remarkable… (More)
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating pointarithmetic are often an obstacle to obtain practical implementation of geometric algorithms. If the adoption of the exact computation paradigm  gives a satisfactory solution to this kind of problemsfor purely combinatorial algorithms this… (More)
In this paper we propose a new approach for the robust computation of the nearest integer lattice points of some specific geometric constructions (intersection of two planar segments, circumcenter of a planar triangle and of a spatial tethraedron). Given that the data and the final results of the geometric constructions are stored using single precision… (More)
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementation of geometric algorithms. If the adoption of the exact computation paradigm  gives a satisfactory solution to this kind of problems for purely combinatorial algorithms, this… (More)
This paper presents a fast method for computing whether or not two convex polygons in three dimensions intersect. The test relies exclusively on the sign of 4¢4 determinants. The source code is available online.