Blackwork embroidery and algorithms for maze traversals

50 %
50 %
Information about Blackwork embroidery and algorithms for maze traversals

Published on August 13, 2008

Author: joshuarbholden

Source: slideshare.net

Description

Blackwork embroidery is a needlework technique often associated with Elizabethan England. The patterns used in blackwork generally are traversed in a way that can be described by classical algorithms in graph theory, such as those used in “The Labyrinth Problem”. We investigate which of these maze-traversing algorithms can also be used to traverse blackwork patterns.

Blackwork embroidery and algorithms for maze traversals Joshua Holden Joint work with Lana Holden Rose-Hulman Institute of Technology http://www.rose-hulman.edu/~holden Joshua Holden (RHIT) Blackwork embroidery and algorithms 1 / 28

“Spanish Stitch” Figure: Portrait of Catherine of Aragon, by Lucas Horenbout Joshua Holden (RHIT) Blackwork embroidery and algorithms 2 / 28

“Holbein Stitch” Figure: Jane Seymour, Queen of England, by Hans Holbein the Younger Joshua Holden (RHIT) Blackwork embroidery and algorithms 3 / 28

Add a comment

Related presentations

Related pages

maze traversals. - Mathematical Association of America

maze traversals. Blackwork embroidery is a needlework ... blackwork generally are traversed in a way that can be described by classical algorithms in ...
Read more

Preprints, Reprints, and Talks - Rose-Hulman - Top Ranked ...

Reprints and Preprints. ... The Graph Theory of Blackwork Embroidery. In: ... Blackwork Embroidery and Algorithms for Maze Traversals ...
Read more

Curriculum Vitae - Rose-Hulman - Top Ranked Engineering ...

Curriculum Vitae Joshua Brandon ... The graph theory of blackwork embroidery. In: ... Blackwork Embroidery and Algorithms for Maze Traversals", ...
Read more

Joint Mathematics Meetings, Program by Day

Blackwork embroidery and algorithms for maze traversals. Joshua Brandon Holden*, Rose-Hulman Institute of Technology (1035-N1-826) 10:20 a.m.
Read more

Graph traversal - Wikipedia, the free encyclopedia

The algorithm begins with a chosen "root" node; it then iteratively transitions from the current node to an adjacent, ... Maze generation algorithms;
Read more