Talk Abstract
Polyomino Visibility Graphs (PVGs) have a 2-dimension or 3-dimension polyomino as each vertex, and they have an edge if there is a non-degenerative rectangle or rectangle prism between them respectively. In this talk, we will show that all PVGs can be represented in 2.5 dimensions, 3D but all polyominoes must touch the xy-plane. We utilize a depth-first algorithm to create a polyomino ordering that can be connected with two separate constructions; handles and nubs.
Talk Subject
Combinatorics
Time Slot
2023-11-11T16:00:00
Room Number
1