Search Results for ""
3321 - 3330 of 13135 for Computational GeometrySearch Results

A circle having a given number of lattice points on its circumference. The Schinzel circle having n lattice points is given by the equation {(x-1/2)^2+y^2=1/45^(k-1) for n=2k ...
For every positive integer n, there exists a circle in the plane having exactly n lattice points on its circumference. The theorem is based on the number r(n) of integral ...
A simplex, sometimes called a hypertetrahedron (Buekenhout and Parker 1998), is the generalization of a tetrahedral region of space to n dimensions. The boundary of a ...
The small cubicuboctahedron is the uniform polyhedron with Maeder index 13 (Maeder 1997), Wenninger index 69 (Wenninger 1989), Coxeter index 38 (Coxeter et al. 1954), and ...
The small ditrigonal icosidodecahedron is the uniform polyhedron with Maeder index 30 (Maeder 1997), Weinninger index 70 (Wenninger 1971, p. 106-107), Coxeter index 39 ...
The small dodecicosidodecahedron is the uniform polyhedron with Maeder index 33 (Maeder 1997), Wenninger index 72 (Wenninger 1989), Coxeter index 42 (Coxeter et al. 1954), ...
The small stellated truncated dodecahedron, also called the quasitruncated small stellated dodecahedron, is the uniform polyhedron with Maeder index 58 (Maeder 1997), ...
A snake is an Eulerian path in the d-hypercube that has no chords (i.e., any hypercube edge joining snake vertices is a snake edge). Klee (1970) asked for the maximum length ...
The snub dodecadodecahedron, not to be confused with the Archimdean snub dodecahedron, is the uniform polyhedron is the uniform polyhedron with Maeder index 40 (Maeder 1997), ...
Let two spheres of radii R and r be located along the x-axis centered at (0,0,0) and (d,0,0), respectively. Not surprisingly, the analysis is very similar to the case of the ...

...