Titlebook: ;

Mri485

無能的人

Greedy triangulation can be efficiently implemented in the average case,Let . be a set of . points uniformly distributed in a unit square. We show that the greedy triangulation of . can be computed in .(.log..) expected time (without bucketing). The best previously known upper-bound on the expected-time performance of an algorithm for the greedy triangulation was .(..).

語(yǔ)言學(xué)

myalgia

Graph-Theoretic Concepts in Computer Science978-3-540-46076-3Series ISSN 0302-9743 Series E-ISSN 1611-3349

charisma

https://doi.org/10.1007/978-3-319-53082-6t the property holds just in case the property (or a related property) holds for some specific subgraphs determined by the fibres of the derivation. On the one hand, this leads to proper tests of compatible properties. On the other hand, compatible properties turn out to be decidable for the corresponding graph languages, i.e., the questions