Listing 1 - 10 of 25 | << page >> |
Sort by
|
Choose an application
Combinatorial geometry --- Geometrie combinatoire --- Meetkunde [Combinatorische ] --- Geometry --- Data processing --- 519.11 --- -Mathematics --- Euclid's Elements --- Geometric combinatorics --- Geometrical combinatorics --- Combinatorial analysis --- Discrete geometry --- Classical combinatorial theory and problems. Factorials. Partitions --- -Classical combinatorial theory and problems. Factorials. Partitions --- 519.11 Classical combinatorial theory and problems. Factorials. Partitions --- -Geometric combinatorics --- Géométrie algorithmique --- Géometrie convexe --- Geometry - Data processing
Choose an application
What do proteins and pop-up cards have in common? How is opening a grocery bag different from opening a gift box? How can you cut out the letters for a whole word all at once with one straight scissors cut? How many ways are there to flatten a cube? With the help of 200 colour figures, author Joseph O'Rourke explains these fascinating folding problems starting from high school algebra and geometry and introducing more advanced concepts in tangible contexts as they arise. He shows how variations on these basic problems lead directly to the frontiers of current mathematical research and offers ten accessible unsolved problems for the enterprising reader. Before tackling these, you can test your skills on fifty exercises with complete solutions. The book's website, http://www.howtofoldit.org, has dynamic animations of many of the foldings and downloadable templates for readers to fold or cut out.
Liaison theory (Mathematics) --- Origami --- Protein folding --- Polyèdres --- Repliement --- Polyhedra. --- Liaison theory (Mathematics). --- Polyèdres --- Protein folding. --- Mathematics. --- Polyhedra --- Protéines --- Folding of proteins --- Proteins --- Polyhedral figures --- Polyhedrons --- Geometry, Solid --- Shapes --- Japanese paper folding --- Paper folding, Japanese --- Paper work --- Linkage theory (Mathematics) --- Schemes (Algebraic geometry) --- Folding --- Conformation
Choose an application
This is the revised and expanded 1998 edition of a popular introduction to the design and implementation of geometry algorithms arising in areas such as computer graphics, robotics, and engineering design. The basic techniques used in computational geometry are all covered: polygon triangulations, convex hulls, Voronoi diagrams, arrangements, geometric searching, and motion planning. The self-contained treatment presumes only an elementary knowledge of mathematics, but reaches topics on the frontier of current research, making it a useful reference for practitioners at all levels. The second edition contains material on several new topics, such as randomized algorithms for polygon triangulation, planar point location, 3D convex hull construction, intersection algorithms for ray-segment and ray-triangle, and point-in-polyhedron. The code in this edition is significantly improved from the first edition (more efficient and more robust), and four new routines are included. Java versions for this new edition are also available. All code is accessible from the book's Web site (http://cs.smith.edu/~orourke/) or by anonymous ftp.
519.6 --- 681.3*D32 --- 681.3*D32 language classifications: applicative languages data-flow languages design languages extensible languages macro and assembly languages nonprocedural languages specialized application and very high-level languages (Programminglanguages) --- language classifications: applicative languages data-flow languages design languages extensible languages macro and assembly languages nonprocedural languages specialized application and very high-level languages (Programminglanguages) --- 519.6 Computational mathematics. Numerical analysis. Computer programming --- Computational mathematics. Numerical analysis. Computer programming --- 681.3*D32 language classifications: applicative languages; data-flow languages; design languages; extensible languages; macro and assembly languages; nonprocedural languages; specialized application and very high-level languages (Programminglanguages) --- language classifications: applicative languages; data-flow languages; design languages; extensible languages; macro and assembly languages; nonprocedural languages; specialized application and very high-level languages (Programminglanguages) --- C (Computer program language) --- Geometry --- #KVIV:BB --- 681.3*I3 --- 681.3*I3 Computer graphics (Computing methodologies) --- Computer graphics (Computing methodologies) --- Data processing --- C (Computer program language). --- Geografie --- Data processing. --- Topografie --- Graphicy. --- C (langage de programmation) --- Géométrie --- Informatique --- Géométrie --- C (Langage de programmation) --- Informatique. --- Mathematics --- Physical Sciences & Mathematics
Choose an application
C (Computer program language) --- Geometry --- C (Langage de programmation) --- Géométrie --- Data processing --- Informatique --- 681.3*I35 --- Computational geometry and object modeling (Computer graphics) --- 681.3*I35 Computational geometry and object modeling (Computer graphics) --- #KVIV:BB --- Programming --- Computer science --- Data processing. --- C (Computer program language). --- Geometry - Data processing.
Choose an application
Choose an application
Choose an application
Choose an application
Choose an application
Language acquisition --- Vocabulary --- Langage --- Vocabulaire --- Acquisition
Choose an application
Listing 1 - 10 of 25 | << page >> |
Sort by
|