The Computer Art of Mason's Mark Design: with VanDeGraphGenerator
BoD – Books on Demand, 30.07.2018 - 152 Seiten
Mason's marks (Steinmetzzeichen) are symbols carved by stonecutters on dressed stone. These signs go back about 4500 years. In Europe, one can mainly find quarrier's marks from the medieval ages. In Architectural History, stonemason's marks allow to reconstruct the construction process of a building. Mason's marks can be concisely represented by planar line graphs using basic Computational Geometry. This text shortly introduces mason's marks and the implementation of the software tool VanDeGraphGenerator to draw, analyse, and generate graphs in the declarative programming language Constraint Handling Rules. This book then features sixty choice mason's marks from Ulm Minster, Strasbourg Cathedral, and Iglesia Arciprestal de Santiago in Spain. Exploiting the inherent structural regularities of mason's marks, VanDeGraphGenerator can assemble new designs automatically using methods from Artificial Intelligence research to achieve a kind of Computational Creativity. The main part of the book showcases more than thousand new designs produced by the tool.
Was andere dazu sagen - Rezension schreiben
Es wurden keine Rezensionen gefunden.
Constraint Handling Rules Programming Language
Andere Ausgaben - Alle anzeigen
Álvaro Rendón Gómez angles Arciprestal de Santiago Artificial Intelligence B.3 Derived backtracking C.1 Derived C.3 Derived CHR rules computed Connected Lines Connecting Graph Constraint Handling Rules Constraints for Exhaustive contd Derived From Strasbourg Derived From Ulm Dürst endpoints existing mason’s marks Figure A.3 Figure B.5 geometric Given Node Constraints Gothic Mason’s Marks Identical Identifier Iglesia Arciprestal Kiiko left-hand side line constraint line lengths Lines with Identical logical Mark from Ulm mark graph Marks Mason’s marks Marks of Strasbourg Marks of Ulm Mason’s Mark Designs Mason’s Marks Mason’s Minster with Arcs module multiset node N2 node-centric representation node(Il NodeList numbers planar graphs polar coordinates primary node propagation rule Random Node Constraints randomly representation of graphs resulting graph right-hand side rule corresponds rule is applied Ržiha Santiago in Villena scalable vector graphics scale and rotate simpagation rule straight lines Strasbourg Cathedral symbol Tamassia Transform Line transform(N1,F,A Ulm and Strasbourg Ulm Minster Wielemaker