XIV Spanish Meeting on Computational Geometry
Texte intégral
Outline
Documents relatifs
The problem is formulated as follows: given a n- dimensional space and queries in transactional environ- ment, what kind of data structure should we use for opti- mal performance..
This paper (i) reviews the general properties enjoyed by AHDs, (ii) com- pletes the list of properties of the various important basis AHDs by deriving many new and general
There is a motivation from logic : Were Z ⊂ Q diophantine, then Hilbert’s 10th problem over the rationals would have a negative answer (using Matijasevich’s theorem over Z).. Let
We use our result to prove that the scaling limit of finite variance Galton–Watson trees conditioned on the number of nodes whose out-degree lies in a given set is the
In the special case when the boundary of the domain G is diffeomor- phic to a 3-dimensional sphere, the fact that the closed complex tangential curve ⊂ S ⊂ ∂ G mentioned above does
plane sets and the frontier of such a set will be denoted by the corresponding lower case Greek letter. Points and real numbers will be denoted by capital and by lower
In a Angle Cover by a convex pentagon, if a point out side the pentagon lies in a Great Angle (angle formed by three adjacent vertices of the pentagon, the center one being the
In this section, we will give some properties of these Green functions that we will need later. The proof of the following lemma is based on elementary potential theory on the