Article
Licensed
Unlicensed
Requires Authentication
Parallel embeddings of octahedral polyhedra
-
L. G. Babat
Published/Copyright:
July 9, 2008
Abstract
We construct a combinatorial representation of an octahedral polyhedron (crystal), find its geometrical parameters, and show that the parameters of such a polyhedron and its mirror image coincide and are simply measured.
Using the combinatorial representation of a diamond, we are able to construct an algorithm which finds a round cut diamond of maximum radius embedded into an octahedral diamond and determines how to place this cut diamond in the octahedral one. This results in creating a technological process to cut round diamonds of maximum value from octahedral ones.
Received: 2006-10-20
Revised: 2007-03-22
Published Online: 2008-07-09
Published in Print: 2008-June
© de Gruyter 2008
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- The relationship between the level of affinity and cryptographic parameters of Boolean functions
- Testing numbers of the form for primality
- On the complexity of construction of complete and complete bipartite graphs
- Minimality and deadlockness of multitape automata
- Limit distributions of the number of absent chains of identical outcomes
- Parallel embeddings of octahedral polyhedra
Articles in the same Issue
- The relationship between the level of affinity and cryptographic parameters of Boolean functions
- Testing numbers of the form for primality
- On the complexity of construction of complete and complete bipartite graphs
- Minimality and deadlockness of multitape automata
- Limit distributions of the number of absent chains of identical outcomes
- Parallel embeddings of octahedral polyhedra
