Search Results for ""
21 - 30 of 1833 for Disk_covering_problemSearch Results
The Poincaré hyperbolic disk is a two-dimensional space having hyperbolic geometry defined as the disk {x in R^2:|x|<1}, with hyperbolic metric ...
The Heilbronn triangle problem is to place n>=3 points in a disk (square, equilateral triangle, etc.) of unit area so as to maximize the area Delta(n) of the smallest of the ...
The integral of 1/r over the unit disk U is given by intint_(U)(dA)/r = intint_(U)(dxdy)/(sqrt(x^2+y^2)) (1) = int_0^(2pi)int_0^1(rdrdtheta)/r (2) = 2piint_0^1dr (3) = 2pi. ...
A coordinate system defined by the transformation equations x = a/Lambdacnmucnnucospsi (1) y = a/Lambdacnmucnnusinpsi (2) z = a/Lambdasnmudnmusnnudnnu, (3) where ...
To generate random points over the unit disk, it is incorrect to use two uniformly distributed variables r in [0,1] and theta in [0,2pi) and then take x = rcostheta (1) y = ...
To solve the heat conduction equation on a two-dimensional disk of radius a=1, try to separate the equation using U(r,theta,t)=R(r)Theta(theta)T(t). (1) Writing the theta and ...
Hadamard's maximum determinant problem asks to find the largest possible determinant (in absolute value) for any n×n matrix whose elements are taken from some set. Hadamard ...
The problem of determining (or counting) the set of all solutions to a given problem.
Is it possible to cover completely the surface of a sphere with congruent, nonoverlapping arcs of great circles? Conway and Croft (1964) proved that it can be covered with ...
Given a circular table of diameter 9 feet, which is the minimal number of planks (each 1 foot wide and length greater than 9 feet) needed in order to completely cover the ...
...
View search results from all Wolfram sites (161691 matches)

