Search Results for ""
351 - 360 of 1833 for Disk_covering_problemSearch Results
The geometry resulting from the application of the inversion operation. It can be especially powerful for solving apparently difficult problems such as Steiner's porism and ...
The problem of maximizing a linear function over a convex polyhedron, also known as operations research or optimization theory. The general problem of convex optimization is ...
Cauchy conditions are initial conditions (time conditions) rather than boundary conditions (space conditions). An initial-value problem is often termed a Cauchy problem. ...
A circular sector is a wedge obtained by taking a portion of a disk with central angle theta<pi radians (180 degrees), illustrated above as the shaded region. A sector with ...
The subset C of the Euclidean plane formed by the union of the x-axis, the line segment with interval [0,1] of the y-axis, and the sequence of segments with endpoints (1/n,0) ...
The geodesics in a complete Riemannian metric go on indefinitely, i.e., each geodesic is isometric to the real line. For example, Euclidean space is complete, but the open ...
Let E be a simply connected compact set in the complex plane. By the Riemann mapping theorem, there is a unique analytic function ...
The mean triangle area A^_ is the average area of a triangle in triangle picking within some given shape. As summarized in the following table, it is possible to compute the ...
Let two disks of radius r intersect one another perpendicularly and have a diameter in common. If the distance between the centers of the disks is sqrt(2) times their radius, ...
The bipartite double graph, also called the Kronecker cover, Kronecker double cover, bipartite double cover, canonical double cover, or bipartite double, of a given graph G ...
...
View search results from all Wolfram sites (161691 matches)

