
Instant online reading.
Don't wait for delivery!
Go digital and save!
A Generative Theory of Shape - ( Lecture Notes in Computer Science #2145 )
Questioning Klein's Erlanger Program
By:Ā Michael Leyton
Paperback | 1 October 2006
At a Glance
576 Pages
22.86 x 15.24 x 1.91
Paperback
$169.75
or 4 interest-free payments of $42.44 with
Ā orĀShips in 5 to 7 business days
Industry Reviews
"This book is intended for a general scientifically interested audience a ] . The author develops a generative theory of shape along two principles fundamental to intelligence a" maximization of transfer and maximization of recoverability. He proceeds by using an algebraically flavoured approach characterizing features as symmetry groups while the addition of features corresponds to group extension. a ] The generative theory is used in several application areas like visual perception, robotics and computer-aided geometric design." (GA1/4nter Landsman, Zentralblatt MATH, Vol. 1012, 2003)
| Transfer | p. 1 |
| Introduction | p. 1 |
| Complex Shape Generation | p. 2 |
| Object-Oriented Theory of Geometry | p. 3 |
| Transfer | p. 4 |
| Human Perception | p. 6 |
| Serial-Link Manipulators | p. 18 |
| Object-Oriented Inheritance | p. 20 |
| Complex Shape Generation | p. 21 |
| Design | p. 21 |
| Cognition and Transfer | p. 22 |
| Transfer in Differential Equations | p. 23 |
| Scientific Structure | p. 24 |
| Maximization of Transfer | p. 28 |
| Primitive-Breaking | p. 28 |
| The Algebraic Description of Machines | p. 30 |
| Agent Self-Substitution | p. 30 |
| RigorousDefinition of Shape | p. 32 |
| RigorousDefinition of Aesthetics | p. 32 |
| Shape Generation by Group Extensions | p. 34 |
| Recoverability | p. 35 |
| Geometry and Memory | p. 35 |
| Practical Need for Recoverability | p. 35 |
| Theoretical Need for Recoverability | p. 37 |
| Data Sets | p. 37 |
| The Fundamental Recovery Rules | p. 39 |
| Design as Symmetry-Breaking | p. 44 |
| Computational Vision and Symmetry-Breaking | p. 45 |
| Occupancy | p. 47 |
| External vs. Internal Inference | p. 48 |
| Exhaustiveness and Internal Inference | p. 49 |
| Externalization Principle | p. 52 |
| Choice of Metric in the Externalization Principle | p. 58 |
| Externalization Principle and Environmental Dimensionality | p. 59 |
| History Symmetrization Principle | p. 61 |
| Symmetry-to-Trace Conversion | p. 63 |
| Roots | p. 66 |
| Inferred Order of the Generative Operations | p. 67 |
| Symmetry-Breaking vs. Asymmetry-Building | p. 69 |
| Against the Erlanger Program | p. 71 |
| Memory | p. 72 |
| Regularity | p. 73 |
| Aesthetics | p. 74 |
| The Definition of Shape | p. 75 |
| Mathematical Theory of Transfer, I | p. 77 |
| Shape Generation by Group Extensions | p. 77 |
| The Importance of n-Cubes in Computational Vision and CAD | p. 78 |
| Stage 1: Defining Fibers and Control | p. 80 |
| Stage 2: Defining the Fiber-Group Product | p. 82 |
| The Fiber-Group Product as a Symmetry Group | p. 84 |
| Defining the Action of the Fiber-Group Product on the Data Set 84 | |
| Stage 3: Action of G(C) on the Fiber-Group Product | p. 88 |
| Transfer as an Automorphism Group | p. 89 |
| Stage 4: Splitting Extension of the Fiber-Group Product by the Control Group | p. 90 |
| Wreath Products | p. 91 |
| The Universal Embdedding Theorems | p. 93 |
| Nesting vs. Control-Nesting | p. 93 |
| Stage 5: Defining the Action of G(F)$$G(C)on F x C | p. 95 |
| Control-GroupIndexes | p. 97 |
| Up-Keeping Effect of the Transfer Automorphisms | p. 98 |
| The Direct vs. the Indirect Representation | p. 103 |
| Transfer asConjugation | p. 104 |
| Conjugation and Recoverability | p. 108 |
| Infinite Control Sets | p. 109 |
| The Full Structure | p. 110 |
| The FiveGroupActions | p. 112 |
| Mathematical Theory of Transfer, II | p. 115 |
| Introduction | p. 115 |
| The Iterated Wreath Product | p. 115 |
| Opening Up | p. 116 |
| The Group TheoryofHierarchicalDetection | p. 118 |
| Control-Nested t-Automorphisms | p. 123 |
| The Wreath Modifier | p. 128 |
| Iso-Regular Groups | p. 129 |
| Canonical Plans | p. 131 |
| Wreath Poly A Groups | p. 132 |
| WreathCovering | p. 133 |
| Theory of Grouping | p. 135 |
| Introduction | p. 135 |
| Grouping from Wreath Products | p. 135 |
| Grouping as Algebraic Action | p. 139 |
| Generative Crystallography | p. 140 |
| Using the Law of Grouping | p. 141 |
| Hierarchical Detection in Grouping | p. 145 |
| Perceptual Relationship between Similar Groupings | p. 146 |
| Product Ordering | p. 149 |
| Local-to-Global in a Wreath Product | p. 152 |
| Perceptual Effect of Inclusion and Omission of Levels | p. 153 |
| Non-iso-regular Groups | p. 156 |
| Robot Manipulators | p. 161 |
| Three Algebraic Conditions | p. 161 |
| Object-Centered FramesasTransfer | p. 162 |
| The Serial-Link Manipulator | p. 165 |
| The Full Group of a Serial-Link Manipulator | p. 167 |
| Transfer in the Serial-Link Manipulator | p. 168 |
| The Full Group of a General-Linked Manipulator | p. 170 |
| Semi-Rigid Groups | p. 172 |
| Including Manipulator Shape | p. 173 |
| Algebraic Theory of Inheritance | p. 175 |
| Inheritance | p. 175 |
| Geometric Inheritance | p. 176 |
| Theory of Inheritance | p. 177 |
| Relating Inheritance Diagrams to Algebra | p. 178 |
| Class Inheritance | p. 179 |
| Reference Frames | p. 185 |
| Reference Objects | p. 185 |
| Non-coordinate-free Geometry | p. 186 |
| Processes andPhases | p. 187 |
| TheoryofReference Objects | p. 188 |
| The Necessity of Reference Frames | p. 189 |
| Structure of the 2D Reference Frame | p. 189 |
| Canonical Plan from the 2D Reference Frame | p. 193 |
| Organizing Role of the Cartesian Reference Frame | p. 194 |
| Orientation-and-Form | p. 195 |
| Cartesian Frame Bundle | p. 200 |
| External Actions on Frames: Decomposition | p. 203 |
| The3DReferenceFrame | p. 205 |
| Assigning Triple-Reflection Structures to Surfaces | p. 207 |
| ConstructionPlane | p. 210 |
| Relative Motion | p. 213 |
| Introduction | p. 213 |
| Theory of Relative Motion | p. 214 |
| Induced Motion | p. 218 |
| Inheritance via Extra Frames | p. 221 |
| Physics | p. 225 |
| Surface Primitives | p. 229 |
| Defining and Classifying Primitives | p. 229 |
| Level-ContinuousPrimitives | p. 231 |
| Sphere and Torus | p. 232 |
| Cylinder and Cone | p. 233 |
| Level-Discrete Primitives | p. 234 |
| Formulation of Primitives to Maximize Transfer and Recoverability | p. 237 |
| Externalization | p. 238 |
| Unfolding Groups, I | p. 239 |
| Symmetry Group of a Complex Environment | p. 239 |
| Concatenation asSymmetry-Breaking | p. 240 |
| Concatenation asAsymmetry-Building | p. 242 |
| Serial-Link Manipulators as Telescope Groups | p. 248 |
| Constructive Solid Geometry(CSG) | p. 251 |
| Boolean Operations as Symmetry-Breaking | p. 252 |
| Boolean Operations as Telescope Groups | p. 253 |
| Spatial Group Equivalence of Boolean Operations | p. 254 |
| Unfolding Groups, II | p. 257 |
| Importance of Selection in Generativity | p. 257 |
| Super-Local Unfolding | p. 258 |
| Establishing a Target for Super-Local Unfolding | p. 259 |
| Super-Local Unfolding and Wreath Coverings | p. 263 |
| The Symmetry Group of a Complex Object | p. 268 |
| Exploitation of Existing Structure | p. 268 |
| Cross-Hierarchy in Super-Local Unfolding | p. 268 |
| Unfolding Groups, III | p. 271 |
| Introduction | p. 271 |
| Symmetry Group of an Apartment | p. 272 |
| Wreath-Direct Groups | p. 274 |
| Canonical Unfoldings | p. 278 |
| Incorporating the Symmetry of Referents | p. 282 |
| Why Internal Symmetry Groups | p. 284 |
| Base and Subsidiary Alignment Kernels | p. 284 |
| Cloning | p. 285 |
| The Inference Structure | p. 286 |
| Group Elements | p. 286 |
| Adding the Anomaly | p. 288 |
| Adding more Primitives | p. 293 |
| Multi-index Notation | p. 295 |
| Symmetry Streaming | p. 296 |
| Complex Shape Generation | p. 298 |
| Mechanical Design and Manufacturing | p. 299 |
| Introduction | p. 299 |
| Parametric, Feature-Based, Solid Modeling | p. 299 |
| A Generative Theory of Physical Features | p. 300 |
| Datum Features | p. 303 |
| Parent-Child Structures as Wreath Products | p. 305 |
| Complex Shape Generation | p. 305 |
| Review of Part Design | p. 305 |
| Complex Parts | p. 311 |
| A Theory of Resolution | p. 311 |
| A Theory of Sketching | p. 318 |
| A Mathematical Theory of the Designer's Mental Analysis | p. 318 |
| Constraints and Unfolding | p. 325 |
| Theory of the Sketch Plane | p. 326 |
| Solidity | p. 329 |
| A Comment on Resolution | p. 329 |
| Adding Features | p. 330 |
| Model Structure | p. 334 |
| Intent Manager | p. 335 |
| Intent Managers: Gestalt Principles | p. 336 |
| Slicing asUnfolding | p. 336 |
| Assembly: Symmetry-Breaking Theory | p. 338 |
| Unfolding Groups, Boolean Operations, and Assembly | p. 339 |
| The Designer's Conceptual Planning | p. 343 |
| Holesthrough Several Layers | p. 345 |
| Analogy with Quantum Mechanics | p. 346 |
| Fiber-Relative Actions | p. 346 |
| The Full Group of the Robot Serial-Link Manipulator | p. 353 |
| Machining | p. 357 |
| A Mathematical Theory of Architecture | p. 365 |
| Introduction | p. 365 |
| The Design Process | p. 366 |
| Massing Studies | p. 366 |
| Mass Elements | p. 367 |
| The Hierarchy of Mass Groups | p. 367 |
| Symmetry Group of a Massing Structure | p. 368 |
| Massing Structure and Generativity | p. 374 |
| Slicing the Massing Study to Create Floorplates | p. 375 |
| Space Planning: Unfolding of Space Volumes | p. 378 |
| Space Planning: Unfolding the Boundary and Void Spaces | p. 379 |
| Unfolding the Room Volumes | p. 380 |
| Unfolding the Wall Structure | p. 380 |
| Complex Slicing | p. 381 |
| Design Development Phase | p. 383 |
| Choice of Materials | p. 383 |
| Doorsand Windows | p. 384 |
| Structural Column Grid | p. 386 |
| Ceiling Grid | p. 388 |
| Stairs | p. 388 |
| Shafts | p. 389 |
| Roof | p. 390 |
| Development of Accuracy | p. 390 |
| Construction Documents | p. 391 |
| Sectionsand Elevations | p. 391 |
| Conclusion | p. 393 |
| Summary of a Mathematical Theory of Architecture | p. 393 |
| Solid Structure | p. 397 |
| Introduction | p. 397 |
| The Solid Primitives | p. 397 |
| The Solid n-Cube | p. 398 |
| The Hyperoctahedral Wreath Hyperplane Group | p. 398 |
| CubesasCartesian Frames | p. 400 |
| The Symmetry Group of the Solid n-Cube | p. 402 |
| Solid Interval and Solid Square | p. 409 |
| The Other Solid Primitives | p. 411 |
| The Solid Sphere | p. 413 |
| The Solid Cross-Section Cylinder | p. 413 |
| The Solid Ruled Cylinder | p. 415 |
| TheSolidCross-SectionBlock | p. 416 |
| TheSolidRuledorPlanarBlock | p. 417 |
| The Full Set of Solid Primitives | p. 417 |
| Externalization in the Solid Primitives | p. 418 |
| The Unfolding Group of a Solid | p. 420 |
| Wreath Formulation of Splines | p. 423 |
| TheGoalofThisChapter | p. 423 |
| CurvesasMachines | p. 428 |
| Cubic Hermite Curves | p. 429 |
| Parametrized SurfacesasMachines | p. 432 |
| Bicubic Hermite Surfaces | p. 433 |
| Parametrized 3-SolidsasMachines | p. 436 |
| Tricubic Hermite Solid | p. 438 |
| Final Comment | p. 440 |
| Wreath Formulation of Sweep Representations | p. 443 |
| Sweep Representations | p. 443 |
| Aesthetics and Sweep Representations | p. 449 |
| Ray Representations | p. 450 |
| Multiple Sweeping | p. 453 |
| Process Grammar | p. 455 |
| Introduction | p. 455 |
| Inference from a Single Shape | p. 455 |
| Intervening History | p. 461 |
| Process Grammar | p. 463 |
| Other Literature | p. 466 |
| Conservation Laws of Physics | p. 467 |
| Wreath Products and Commutators | p. 467 |
| Transfer in Quantum Mechanics | p. 469 |
| Symmetriesof the Schrodinger Equation | p. 469 |
| Space-Time Transfer in Quantum Mechanics | p. 470 |
| Non-solvability of the Galilean Lie Algebra | p. 473 |
| Semisimple Lie Algebras in Quantum Mechanics | p. 474 |
| Music | p. 477 |
| Introduction | p. 477 |
| Motival Material | p. 477 |
| Modulation as a Wreath Product | p. 478 |
| Psychological Studies of Sequential Structure | p. 479 |
| Transfer in Musical Sequence Structure | p. 480 |
| Meter | p. 481 |
| AlgebraicTheoryofMeter | p. 485 |
| TheoryofMetricalMovement(Pulse) | p. 489 |
| Algebraic Structure of Grouping | p. 491 |
| Against the Erlanger Program | p. 495 |
| Introduction | p. 495 |
| Orientation-and-Form | p. 497 |
| The Generative Structure of Quadrilaterals | p. 497 |
| Non-coordinate-freedom | p. 503 |
| Theorem-Proving in Geometry | p. 506 |
| The Geometry Hierarchy | p. 507 |
| Projective Asymmetrization: Extrinsic View | p. 509 |
| Deriving Projective CoordinateSystems | p. 513 |
| Non-transitivity of the Geometry Group | p. 517 |
| Regular Translation Structure | p. 518 |
| 3D ProjectiveAsymmetrization | p. 519 |
| Against the Erlanger Program: Summary | p. 526 |
| Semi-direct Products | p. 531 |
| Normal Subgroups | p. 531 |
| Semi-direct Products | p. 533 |
| The Extending Group H as an Automorphism Group | p. 535 |
| Multiplication in a Semi-direct Product | p. 536 |
| Direct Products | p. 537 |
| Symbols | p. 539 |
| References | p. 541 |
| Index | p. 549 |
| Table of Contents provided by Publisher. All Rights Reserved. |
ISBN: 9783540427179
ISBN-10: 3540427171
Series: Lecture Notes in Computer Science
Published: 1st October 2006
Format: Paperback
Language: English
Number of Pages: 576
Audience: General Adult
Publisher: Springer Nature B.V.
Country of Publication: DE
Dimensions (cm): 22.86 x 15.24 x 1.91
Weight (kg): 0.79
Shipping
| Standard Shipping | Express Shipping | |
|---|---|---|
| Metro postcodes: | $9.99 | $14.95 |
| Regional postcodes: | $9.99 | $14.95 |
| Rural postcodes: | $9.99 | $14.95 |
Orders over $89.00 qualify for free shipping.
How to return your order
At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.
Additional postage charges may be applicable.
Defective items
If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.
For more info please visit our Help Centre.
You Can Find This Book In

Innovations in Management, Technology, and Performance
Driving Sustainable Solutions and Business Value
Hardcover
RRP $273.00
$236.99
OFF

Next-Generation Computing and Information Systems
Taylor and Francis Proceedings in Computer Science and Engineering
Hardcover
RRP $305.00
$263.75
OFF
This product is categorised by
- Non-FictionMathematicsTopology
- Non-FictionMathematicsGeometry
- Non-FictionMedicineMedicine in General
- Non-FictionComputing & I.T.Computer ScienceImage Processing
- Non-FictionMathematicsGroups & Group Theory
- Non-FictionComputing & I.T.DatabasesData Capture & Analysis
- Non-FictionEducation
- Non-FictionMathematicsAlgebra
- Non-FictionComputing & I.T.Computer Programming & Software Development
- Non-FictionComputing & I.T.Graphical & Digital Media ApplicationsComputer-Aided Design CAD
- Non-FictionComputing & I.T.Computer ScienceArtificial IntelligenceComputer Vision
- Non-FictionComputing & I.T.Business Applications
- Non-FictionComputing & I.T.Graphical & Digital Media Applications






















