Search results for "polygon"
Items in stock - 4 working days delivery time
Times Polygon Book 3
Challenge yourself with word puzzles 300 word wheel puzzles to test your mental dexterity with this collection from The Times, one of their most popular online word games The perfect challenge for all lovers of wordsearch and crosswords. How many words can you make? The book is split into multiple levels 7-, 8-, 9- and 10-letter polygons, and each puzzle includes grades so you can compare your vocabulary against the setters at The Times. Make words of three or more letters, always including the central letter. Excludes capitalised words, plurals, conjugated forms (past tense, etc), adverbs ending in -LY, comparatives and superlatives. Accented letters are allowed, and are considered identical to the same letters without the accent. The perfect way for lovers of wordsearch and crosswords to pass the time and exercise the grey matter.
R 260.00
Items we need to order for you
R 305.00
R 321.00
R 1,073.00
R 458.00
R 397.00
R 554.00
Polygons Galore
Polygons Galore! is a mathematics unit for high-ability learners in grades 3-5 focusing on 2-D and 3-D components of geometry by exploring polygons and polyhedra and their properties. The van Hiele levels of geometric understanding provide conceptual underpinnings for unit activities. The unit consists of nine lessons that include student discovery of properties of polygons and polyhedra, investigations for finding areas of triangles and quadrilaterals, study of the Platonic solids, and real-world applications of polygons and polyhedra. It also includes activities related to identifying, comparing, and analyzing polygons by using properties of the polygons; constructing meanings for geometric terms; developing strategies to find areas of specific polygons; identifying and building regular and nonregular polyhedra; and recognizing geometric ideas and relationships as applied in daily life and in other disciplines, such as art.Grades 3-5
R 1,980.97
Generalized Polygons
Generalized Polygons is the first book to cover, in a coherent manner, the theory of polygons from scratch. In particular, it fills elementary gaps in the literature and gives an up-to-date account of current research in this area, including most proofs, which are often unified and streamlined in comparison to the versions generally known. Generalized Polygons will be welcomed both by the student seeking an introduction to the subject as well as the researcher who will value the work as a reference. In particular, it will be of great value for specialists working in the field of generalized polygons (which are, incidentally, the rank 2 Tits-buildings) or in fields directly related to Tits-buildings, incidence geometry and finite geometry. The approach taken in the book is of geometric nature, but algebraic results are included and proven (in a geometric way!). A noteworthy feature is that the book unifies and generalizes notions, definitions and results that exist for quadrangles, hexagons, octagons - in the literature very often considered separately - to polygons. Many alternative viewpoints given in the book heighten the sense of beauty of the subject and help to provide further insight into the matter.
R 2,804.07
Moufang Polygons
This book gives the complete classification of Moufang polygons, starting from first principles. In particular, it may serve as an introduction to the various important algebraic concepts which arise in this classification including alternative division rings, quadratic Jordan division algebras of degree three, pseudo-quadratic forms, BN-pairs and norm splittings of quadratic forms. This book also contains a new proof of the classification of irreducible spherical buildings of rank at least three based on the observation that all the irreducible rank two residues of such a building are Moufang polygons. In an appendix, the connection between spherical buildings and algebraic groups is recalled.
R 4,313.04
Polygons, Polyominoes and Polycubes
The problem of counting the number of self-avoiding polygons on a square grid, - therbytheirperimeterortheirenclosedarea,is aproblemthatis soeasytostate that, at ?rst sight, it seems surprising that it hasn’t been solved. It is however perhaps the simplest member of a large class of such problems that have resisted all attempts at their exact solution. These are all problems that are easy to state and look as if they should be solvable. They include percolation, in its various forms, the Ising model of ferromagnetism, polyomino enumeration, Potts models and many others. These models are of intrinsic interest to mathematicians and mathematical physicists, but can also be applied to many other areas, including economics, the social sciences, the biological sciences and even to traf?c models. It is the widespread applicab- ity of these models to interesting phenomena that makes them so deserving of our attention. Here however we restrict our attention to the mathematical aspects. Here we are concerned with collecting together most of what is known about polygons, and the closely related problems of polyominoes. We describe what is known, taking care to distinguish between what has been proved, and what is c- tainlytrue,but has notbeenproved. Theearlierchaptersfocusonwhatis knownand on why the problems have not been solved, culminating in a proof of unsolvability, in a certain sense. The next chapters describe a range of numerical and theoretical methods and tools for extracting as much information about the problem as possible, in some cases permittingexactconjecturesto be made.
R 1,590.31
R 489.00
Generalized Polygons
This book is intended to be an introduction to the fascinating theory ofgeneralized polygons for both the graduate student and the specialized researcher in the field. It gathers together a lot of basic properties (some of which are usually referred to in research papers as belonging to folklore) and very recent and sometimes deep results. I have chosen a fairly strict geometrical approach, which requires some knowledge of basic projective geometry. Yet, it enables one to prove some typically group-theoretical results such as the determination of the automorphism groups of certain Moufang polygons. As such, some basic group-theoretical knowledge is required of the reader. The notion of a generalized polygon is a relatively recent one. But it is one of the most important concepts in incidence geometry. Generalized polygons are the building bricks of Tits buildings. They are the prototypes and precursors of more general geometries such as partial geometries, partial quadrangles, semi-partial ge ometries, near polygons, Moore geometries, etc. The main examples of generalized polygons are the natural geometries associated with groups of Lie type of relative rank 2. This is where group theory comes in and we come to the historical raison d'etre of generalized polygons. In 1959 Jacques Tits discovered the simple groups of type 3D by classifying the 4 trialities with at least one absolute point of a D -geometry. The method was 4 predominantly geometric, and so not surprisingly the corresponding geometries (the twisted triality hexagons) came into play. Generalized hexagons were born.
R 1,636.99
Polygons, Polyominoes and Polycubes
The problem of counting the number of self-avoiding polygons on a square grid, - therbytheirperimeterortheirenclosedarea,is aproblemthatis soeasytostate that, at ?rst sight, it seems surprising that it hasn’t been solved. It is however perhaps the simplest member of a large class of such problems that have resisted all attempts at their exact solution. These are all problems that are easy to state and look as if they should be solvable. They include percolation, in its various forms, the Ising model of ferromagnetism, polyomino enumeration, Potts models and many others. These models are of intrinsic interest to mathematicians and mathematical physicists, but can also be applied to many other areas, including economics, the social sciences, the biological sciences and even to traf?c models. It is the widespread applicab- ity of these models to interesting phenomena that makes them so deserving of our attention. Here however we restrict our attention to the mathematical aspects. Here we are concerned with collecting together most of what is known about polygons, and the closely related problems of polyominoes. We describe what is known, taking care to distinguish between what has been proved, and what is c- tainlytrue,but has notbeenproved. Theearlierchaptersfocusonwhatis knownand on why the problems have not been solved, culminating in a proof of unsolvability, in a certain sense. The next chapters describe a range of numerical and theoretical methods and tools for extracting as much information about the problem as possible, in some cases permittingexactconjecturesto be made.
R 1,589.41
Moufang Polygons
This book gives the complete classification of Moufang polygons, starting from first principles. In particular, it may serve as an introduction to the various important algebraic concepts which arise in this classification including alternative division rings, quadratic Jordan division algebras of degree three, pseudo-quadratic forms, BN-pairs and norm splittings of quadratic forms. This book also contains a new proof of the classification of irreducible spherical buildings of rank at least three based on the observation that all the irreducible rank two residues of such a building are Moufang polygons. In an appendix, the connection between spherical buildings and algebraic groups is recalled.
R 4,313.21
R 342.34
R 244.00
R 672.00
R 294.00
R 489.00
R 228.00
R 619.17
R 489.00
Polygon Mesh Processing
Geometry processing, or mesh processing, is a fast-growing area of research that uses concepts from applied mathematics, computer science, and engineering to design efficient algorithms for the acquisition, reconstruction, analysis, manipulation, simulation, and transmission of complex 3D models. Applications of geometry processing algorithms already cover a wide range of areas from multimedia, entertainment, and classical computer-aided design, to biomedical computing, reverse engineering, and scientific computing. Over the last several years, triangle meshes have become increasingly popular, as irregular triangle meshes have developed into a valuable alternative to traditional spline surfaces. This book discusses the whole geometry processing pipeline based on triangle meshes. The pipeline starts with data input, for example, a model acquired by 3D scanning techniques. This data can then go through processes of error removal, mesh creation, smoothing, conversion, morphing, and more. The authors detail techniques for those processes using triangle meshes. A supplemental website contains downloads and additional information.
R 4,066.00
R 305.00
Fun and Games: Escape Rooms: Polygons
Four students must utilize their math skills to solve a challenging escape room. Do they have what it takes to spot the polygons and make it out before the time is up? Packed with factual information and high-interest content, this fiction math book uses real-world examples of problem solving to build students' math and reading skills. Let's Explore Math sidebars feature math questions that challenge students to develop their math skills. A problem-solving section at the end of the book prompts students to reflect and apply what they've learned. Demystify math with this leveled book that makes learning math fun and accessible for kids ages 10-12 and appeals to reluctant readers.
R 367.00
Algorithms for Parallel Polygon Rendering
This book is the result of the research in the implementation of polygon-based graphics operations on certain general purpose parallel processors; the aim is to provide a speed-up over sequential implementations of the graphics operations concerned, and the resulting software can be viewed as a subset of the application suites of the relevant parallel machines. A literature review and a brief description of the architectures considered give an introduction into the field. Most algorithms are consistently presented in an informally defined extension of the Occam language which includes Single Instruction Multiple Data stream (SIMD) data types and operations on them. Original methods for polygon rendering - including the operations of filling, hidden surface elimination and smooth shading - are presented for SIMD architectures like the DAP and for a dual-paradigm (SIMD-MIMD) machine constructed out of a DAP-like processor array and a transputer network. Polygon clipping algorithms for both transputer and the DAP are described and contrasted. Apart from the information presented in the book and the useful literature survey, the reader can also expect to gain an insight into the programming of the relevant parallel machines.
R 1,533.60
R 273.00
R 244.00
Polygonal Approximation and Scale-Space Analysis of Closed Digital Curves
This book covers the most important topics in the area of pattern recognition, object recognition, computer vision, robot vision, medical computing, computational geometry, and bioinformatics systems. Students and researchers will find a comprehensive treatment of polygonal approximation and its real life applications. The book not only explains the theoretical aspects but also presents applications with detailed design parameters. The systematic development of the concept of polygonal approximation of digital curves and its scale-space analysis are useful and attractive to scholars in many fields.
R 8,781.21
