# Tag Archives: orthobraces

## Drawing orthogons with an SMT solver

I’m long overdue to finish up my post series on orthogons as promised. First, a quick recap: An orthogon is a polygon with only right angles. Two orthogons are considered the same if you can turn one into the other … Continue reading

Posted in computation, geometry | | 1 Comment

## Why drawing orthogons is hard

We’re nearing the end of this little diversion on orthogons. We now know that orthogons are in 1-1 correspondence with orthobraces, and we can efficiently generate orthobraces. The only thing left is to find a way to turn orthobraces into … Continue reading

Posted in computation, geometry | | 3 Comments

## Efficiently listing orthobraces

In my last couple posts, we talked about a simple yet inefficient method for listing all orthobraces of a particular size. So how do we generate them efficiently? It turns out that it can be done: in 2011, Karim, Sawada, … Continue reading

Posted in combinatorics, computation | | 1 Comment

## Haskell code to naively list orthobraces

Let’s see some simple Haskell code to generate orthobraces, by generating all sequences and throwing away ones we’ve already generated. First, some library imports we’ll need. > import Data.List > import qualified Data.Set as S Here’s a function to generate … Continue reading

Posted in combinatorics, computation | | 1 Comment

## Listing orthobraces

I took a bit of a break to finish writing a paper for submission to the International Conference on Functional Programming—which I should write about here! All in good time. (I tend to accumulate things to write about faster than … Continue reading

Posted in combinatorics, computation | | 2 Comments