doubly
31Doubly stochastic model — In statistics, a doubly stochastic model is a type of model that can arise in many contexts, but in particular in modelling time series and stochastic processes. The basic idea for a doubly stochastic model is that an observed random variable is… …
32Doubly connected edge list — The doubly connected edge list (DCEL) is a data structure to represent an embedding of a planar graph in the plane and polytopes in 3D. This data structure provides efficient manipulation of the topological information associated with the objects …
33Doubly chained tree — In computer science, a Doubly chained tree is a tree data structure in which each node has two pointers. Typically, each node has one pointer pointing to its child and one pointing at the node to its right. Then the following node will have one… …
34Doubly logarithmic tree — In computer science a doubly logarithmic tree is a tree where each internal node of height 1 has two children, and each internal node of height h > 1 has children. Each child of the root contains leaves. The number of children at a node as we… …
35Doubly-connected edge list — Die Doubly connected edge list (DCEL, doppelt verkettete Kantenliste) ist eine Datenstruktur, die einen zusammenhängenden planaren Graphen repräsentiert, der in die Ebene eingebettet ist. Die Datenstruktur wird in der algorithmischen Geometrie… …
36Doubly serrate — Serrate Ser rate, Serrated Ser ra*ted, a. [L. serratus, fr. serra a saw; perhaps akin to secare to cut, E. saw a cutting instrument. Cf. {Sierra}.] 1. Notched on the edge, like a saw. [1913 Webster] 2. (Bot.) Beset with teeth pointing forwards or …
37Doubly-connected edge list — The doubly connected edge list (DCEL) is a data structure to represent an embedding of a planar graph in the plane and polytopes in 3D. This data structure provide efficient manipulation of the topological information associated with the objects… …
38Doubly Linked Face List — A Doubly Linked Face List or DLFL is an efficient data structure for storing 2 manifold mesh data. The structure stores linked lists for a 3D mesh s faces, edges, vertices, and corners. The structure guarantees the preservation of the manifold… …
39Doubly linked face list — In applied mathematics, a doubly linked face list (DLFL) is an efficient data structure for storing 2 manifold mesh data. The structure stores linked lists for a 3D mesh s faces, edges, vertices, and corners. The structure guarantees the… …
40doubly refracting prism — dvilūžė prizmė statusas T sritis fizika atitikmenys: angl. doubly refracting prism vok. doppelbrechendes Prisma, n rus. двоякопреломляющая призма, f pranc. prisme biréfringent, m …
