Convex and discrete geometry Definition
Spherical code
Builds on Dot productAngle between two vectors
Definition
Let and let be the unit sphere, where is the dot product. A spherical code in is a finite nonempty subset . Let . The code has minimal angle at least if for all distinct . Equivalently, every two distinct points of make an angle at least at the origin. The largest size of a spherical code in with minimal angle at least is denoted .
Remarks
Example: the points , where are the standard basis vectors, form a spherical code with minimal angle . Two distinct points among them have dot product or , both at most . Non-example: in , the points , and do not have minimal angle at least , since the dot product of the first and the third is . The kissing number is .
Reading path
To understand this page from the ground up, read these 3 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Angle between two vectors concept
- Dot product concept
- Spherical code definition
Further reading
About this page
| Tag | VY2TTB854G |
|---|---|
| URI | m2://VY2TTB854G |
| Kind | definition |
| Writing | W0 stub |
| MSC | 52C17, 94B65, 05B40 |
| Defines | Spherical code |
| Uses | Dot product, Angle between two vectors |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.