TOPICS
Search

Search Results for ""


371 - 380 of 1833 for Disk_covering_problemSearch Results
The Bevan point V of a triangle DeltaABC is the circumcenter of the excentral triangle DeltaJ_AJ_BJ_C. It is named in honor of Benjamin Bevan, a relatively unknown Englishman ...
The network flow problem considers a graph G with a set of sources S and sinks T and for which each edge has an assigned capacity (weight), and then asks to find the maximum ...
The Riemann's moduli space gives the solution to Riemann's moduli problem, which requires an analytic parameterization of the compact Riemann surfaces in a fixed ...
A plot of y_i versus the estimator e_i=y^^_i-y_i. Random scatter indicates the model is probably good. A pattern indicates a problem with the model. If the spread in e_i ...
Given a smooth manifold M with an open cover U_i, a partition of unity subject to the cover U_i is a collection of smooth, nonnegative functions psi_i, such that the support ...
Any triangle that has two equal angle bisectors (each measured from a polygon vertex to the opposite sides) is an isosceles triangle. This theorem is also called the ...
In combinatorial mathematics, the series-parallel networks problem asks for the number of networks that can be formed using a given number of edges. The edges can be ...
A plane-filling arrangement of plane figures or its generalization to higher dimensions. Formally, a tiling is a collection of disjoint open sets, the closures of which cover ...
The Roman surface, also called the Steiner surface (not to be confused with the class of Steiner surfaces of which the Roman surface is a particular case), is a quartic ...
The transitive reflexive reduction of a partial order. An element z of a partially ordered set (X,<=) covers another element x provided that there exists no third element y ...
1 ... 35|36|37|38|39|40|41 ... 184 Previous Next

...