|
Polystick
In recreational mathematics, a polystick (or polyedge) is a polyform with a line segment (a 'stick') as the basic shape. A polystick is a connected set of segments in a regular grid. A square polystick is a connected subset of a regular square grid. A triangular polystick is a connected subset of a regular triangular grid. Polysticks are classified according to how many line segments they contain. The name "polystick" seems to have been first coined by Brian R. Barwell. The names "polytrig" and "polytwigs" has been proposed by David Goodger to simplify the phrases "triangular-grid polysticks" and "hexagonal-grid polysticks," respectively. Colin F. Brown has used an earlier term "polycules" for the hexagonal-grid polysticks due to their appearance resembling the spicules of sea sponges. There is no standard term for line segments built on other regular tilings, an unstructured grid, or a simple connected graph, but both "polynema" and "polyedge" have been proposed. When refl ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polysticks
In recreational mathematics, a polystick (or polyedge) is a polyform with a line segment (a 'stick') as the basic shape. A polystick is a connected set of segments in a regular grid. A square polystick is a connected subset of a regular square grid. A triangular polystick is a connected subset of a regular triangular grid. Polysticks are classified according to how many line segments they contain. The name "polystick" seems to have been first coined by Brian R. Barwell. The names "polytrig" and "polytwigs" has been proposed by David Goodger to simplify the phrases "triangular-grid polysticks" and "hexagonal-grid polysticks," respectively. Colin F. Brown has used an earlier term "polycules" for the hexagonal-grid polysticks due to their appearance resembling the spicules of sea sponges. There is no standard term for line segments built on other regular tilings, an unstructured grid, or a simple connected graph, but both "polynema" and "polyedge" have been proposed. When refl ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polyform
In recreational mathematics, a polyform is a plane (mathematics), plane figure or solid compound constructed by joining together identical basic polygons. The basic polygon is often (but not necessarily) a convex polygon, convex plane-filling polygon, such as a Square (geometry), square or a triangle. More specific names have been given to polyforms resulting from specific basic polygons, as detailed in the table below. For example, a square basic polygon results in the well-known polyominoes. Construction rules The rules for joining the polygons together may vary, and must therefore be stated for each distinct type of polyform. Generally, however, the following rules apply: #Two basic polygons may be joined only along a common edge, and must share the entirety of that edge. #No two basic polygons may overlap. #A polyform must be connected (that is, all one piece; see connected graph, connected space). Configurations of disconnected basic polygons do not qualify as polyforms. #The ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Recreational Mathematics
Recreational mathematics is mathematics carried out for recreation (entertainment) rather than as a strictly research and application-based professional activity or as a part of a student's formal education. Although it is not necessarily limited to being an endeavor for amateurs, many topics in this field require no knowledge of advanced mathematics. Recreational mathematics involves mathematical puzzles and games, often appealing to children and untrained adults, inspiring their further study of the subject. The Mathematical Association of America (MAA) includes recreational mathematics as one of its seventeen Special Interest Groups, commenting: Mathematical competitions (such as those sponsored by mathematical associations) are also categorized under recreational mathematics. Topics Some of the more well-known topics in recreational mathematics are Rubik's Cubes, magic squares, fractals, logic puzzles and mathematical chess problems, but this area of mathematics incl ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Line Segment
In geometry, a line segment is a part of a straight line that is bounded by two distinct end points, and contains every point on the line that is between its endpoints. The length of a line segment is given by the Euclidean distance between its endpoints. A closed line segment includes both endpoints, while an open line segment excludes both endpoints; a half-open line segment includes exactly one of the endpoints. In geometry, a line segment is often denoted using a line above the symbols for the two endpoints (such as \overline). Examples of line segments include the sides of a triangle or square. More generally, when both of the segment's end points are vertices of a polygon or polyhedron, the line segment is either an edge (geometry), edge (of that polygon or polyhedron) if they are adjacent vertices, or a diagonal. When the end points both lie on a curve (such as a circle), a line segment is called a chord (geometry), chord (of that curve). In real or complex vector spa ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Regular Grid
A regular grid is a tessellation of ''n''-dimensional Euclidean space by congruent parallelotopes (e.g. bricks). Its opposite is irregular grid. Grids of this type appear on graph paper and may be used in finite element analysis, finite volume methods, finite difference methods, and in general for discretization of parameter spaces. Since the derivatives of field variables can be conveniently expressed as finite differences, structured grids mainly appear in finite difference methods. Unstructured grids offer more flexibility than structured grids and hence are very useful in finite element and finite volume methods. Each cell in the grid can be addressed by index (i, j) in two dimensions or (i, j, k) in three dimensions, and each vertex has coordinates (i\cdot dx, j\cdot dy) in 2D or (i\cdot dx, j\cdot dy, k\cdot dz) in 3D for some real numbers ''dx'', ''dy'', and ''dz'' representing the grid spacing. Related grids A Cartesian grid is a special case where the elements are uni ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sponge Spicule
Spicules are structural elements found in most sponges. The meshing of many spicules serves as the sponge's skeleton and thus it provides structural support and potentially defense against predators. Sponge spicules are made of calcium carbonate or silica. Large spicules visible to the naked eye are referred to as megascleres, while smaller, microscopic ones are termed microscleres. The composition, size, and shape of spicules are major characters in sponge systematics and taxonomy. Overview Sponges are a species-rich clade of the earliest-diverging (most basal) animals. They are distributed globally, with diverse ecologies and functions, and a record spanning at least the entire Phanerozoic. Most sponges produce skeletons formed by spicules, structural elements that develop in a wide variety of sizes and three dimensional shapes. Among the four sub-clades of Porifera, three (Demospongiae, Hexactinellida, and Homoscleromorpha) produce skeletons of amorphous silica and on ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sea Sponges
Sponges, the members of the phylum Porifera (; meaning 'pore bearer'), are a basal animal clade as a sister of the diploblasts. They are multicellular organisms that have bodies full of pores and channels allowing water to circulate through them, consisting of jelly-like mesohyl sandwiched between two thin layers of cells. Sponges have unspecialized cells that can transform into other types and that often migrate between the main cell layers and the mesohyl in the process. Sponges do not have nervous, digestive or circulatory systems. Instead, most rely on maintaining a constant water flow through their bodies to obtain food and oxygen and to remove wastes. Sponges were first to branch off the evolutionary tree from the last common ancestor of all animals, making them the sister group of all other animals. Etymology The term ''sponge'' derives from the Ancient Greek word ( 'sponge'). Overview Sponges are similar to other animals in that they are multicellular, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
List Of Uniform Tilings
This table shows the 11 convex uniform tilings (regular and semiregular) of the Euclidean plane, and their dual tilings. There are three regular and eight semiregular tilings in the plane. The semiregular tilings form new tilings from their duals, each made from one type of irregular face. John Conway calls these uniform duals ''Catalan tilings'', in parallel to the Catalan solid polyhedra. Uniform tilings are listed by their vertex configuration, the sequence of faces that exist on each vertex. For example ''4.8.8'' means one square and two octagons on a vertex. These 11 uniform tilings have 32 different ''uniform colorings''. A uniform coloring allows identical sided polygons at a vertex to be colored differently, while still maintaining vertex-uniformity and transformational congruence between vertices. (Note: Some of the tiling images shown below are ''not'' color-uniform) In addition to the 11 convex uniform tilings, there are also 14 known nonconvex tilings, using star ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Unstructured Grid
An unstructured grid or irregular grid is a tessellation of a part of the Euclidean plane or Euclidean space by simple shapes, such as triangles or tetrahedra, in an irregular pattern. Grids of this type may be used in finite element analysis when the input to be analyzed has an irregular shape. Unlike structured grids, unstructured grids require a list of the connectivity which specifies the way a given set of vertices make up individual elements (see graph (data structure)). Ruppert's algorithm In mesh generation, Delaunay refinement are algorithms for mesh generation based on the principle of adding Steiner points to the geometry of an input to be meshed, in a way that causes the Delaunay triangulation or constrained Delaunay triangulat ... is often used to convert an irregularly shaped polygon into an unstructured grid of triangles. In addition to triangles and tetrahedra, other commonly used elements in finite element simulation include quadrilateral (4-noded) and hexa ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Connected Graph
In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges) that need to be removed to separate the remaining nodes into two or more isolated subgraphs. It is closely related to the theory of network flow problems. The connectivity of a graph is an important measure of its resilience as a network. Connected vertices and graphs In an undirected graph , two '' vertices'' and are called connected if contains a path from to . Otherwise, they are called disconnected. If the two vertices are additionally connected by a path of length , i.e. by a single edge, the vertices are called adjacent. A graph is said to be connected if every pair of vertices in the graph is connected. This means that there is a path between every pair of vertices. An undirected graph that is not connected is called disconnected. An undirected graph ''G'' is therefore disconnected if there exist two vertices i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polyomino
A polyomino is a plane geometric figure formed by joining one or more equal squares edge to edge. It is a polyform whose cells are squares. It may be regarded as a finite subset of the regular square tiling. Polyominoes have been used in popular puzzles since at least 1907, and the enumeration of pentominoes is dated to antiquity. Many results with the pieces of 1 to 6 squares were first published in ''Fairy Chess Review'' between the years 1937 to 1957, under the name of "dissection problems." The name ''polyomino'' was invented by Solomon W. Golomb in 1953, and it was popularized by Martin Gardner in a November 1960 "Mathematical Games" column in ''Scientific American''. Related to polyominoes are polyiamonds, formed from equilateral triangles; polyhexes, formed from regular hexagons; and other plane polyforms. Polyominoes have been generalized to higher dimensions by joining cubes to form polycubes, or hypercubes to form polyhypercubes. In statistical physics, the study ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Vertex (graph Theory)
In discrete mathematics, and more specifically in graph theory, a vertex (plural vertices) or node is the fundamental unit of which graphs are formed: an undirected graph consists of a set of vertices and a set of edges (unordered pairs of vertices), while a directed graph consists of a set of vertices and a set of arcs (ordered pairs of vertices). In a diagram of a graph, a vertex is usually represented by a circle with a label, and an edge is represented by a line or arrow extending from one vertex to another. From the point of view of graph theory, vertices are treated as featureless and indivisible objects, although they may have additional structure depending on the application from which the graph arises; for instance, a semantic network is a graph in which the vertices represent concepts or classes of objects. The two vertices forming an edge are said to be the endpoints of this edge, and the edge is said to be incident to the vertices. A vertex ''w'' is said to be ad ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
