Big Chemical Encyclopedia

Chemical substances, components, reactions, process design ...

Articles Figures Tables About

Making polygons

A polygon is a plane figure composed of connected lines. How many connected lines must there be to make a polygon ... [Pg.133]

The procedure of Frost and Musulin can be adapted to chain systems with it bonding in the following way. For a chain having m atoms, draw a polygon as before, except it must have m + 2 sides. Disregard the top and bottom vertices and use only one side of the polygon where it makes contact with the circle to determine the energy levels. [Pg.171]

As stated, the Platonic solids constitute a family of five convex uniform polyhedra made up of the same regular polygons and possess either 32, 432, or 532 symmetry. As a result, the three coordinate directions within each solid are equivalent, which makes these polyhedra models for spheroid design. [Pg.140]

Remember In determining chirality in substituted cycloalkanes, always draw the rings as flat polygons. This is especially true for cyclohexane derivatives, where having two chair forms that interconvert can make analysis especially difficult. [Pg.181]

As pointed out in Section 7, the plastio foam cells have a very complex shape, most frequently that of irregular polygons, which makes the use of the above formulas too cumbersome nevertheless, the order of the specific surface value given by the equations is correct. [Pg.200]

As the number of components that make up a finite molecular assembly increases so does the size and, generally, the complexity of the assembly. Thus, molecular assemblies with three, four, and five molecules as components may form 2D cyclic structures of increasing size in the form of trimers, tetramers, and pentamers, respectively (Scheme l).3a The components may also be arranged in three dimensions to form a cage. Notably, useful classifications of the structures of finite assemblies based on principles of plane (i.e. polygons) and solid geometry (i.e. polyhedra) have been recently discussed.4... [Pg.14]

A univariate subdivision scheme is a set of rules by which a denser polygon is defined in terms of a sparser one. The same set of rules can then be applied again to make an even denser one, and this can be repeated indefinitely to make such a dense polygon that it looks like a curve. In principle an infinite number of such refinements would indeed give a continuous curve, and it is possible to deduce from the rules some properties of that curve without actually taking an infinite number of steps. [Pg.47]


See other pages where Making polygons is mentioned: [Pg.1]    [Pg.167]    [Pg.167]    [Pg.168]    [Pg.1]    [Pg.167]    [Pg.167]    [Pg.168]    [Pg.78]    [Pg.697]    [Pg.701]    [Pg.480]    [Pg.223]    [Pg.169]    [Pg.212]    [Pg.328]    [Pg.241]    [Pg.186]    [Pg.705]    [Pg.258]    [Pg.7]    [Pg.272]    [Pg.460]    [Pg.276]    [Pg.224]    [Pg.245]    [Pg.154]    [Pg.121]    [Pg.125]    [Pg.525]    [Pg.297]    [Pg.58]    [Pg.208]    [Pg.84]    [Pg.75]    [Pg.1319]    [Pg.8]    [Pg.628]    [Pg.495]    [Pg.292]    [Pg.1340]    [Pg.15]    [Pg.80]    [Pg.62]    [Pg.73]    [Pg.1]   
See also in sourсe #XX -- [ Pg.167 ]




SEARCH



Polygonization

© 2026 chempedia.info