hlfw: binpack

--- a/README.md

+++ b/README.md

@@ -46,10 +46,11 @@

 	|                                               |

 	|-----------------------------------------------|

 	Points are (18,0) (18,7) and (0,7)

+```

-		This essentially creates 3 new points of interest in our available space.

-	The top right, bottom right, and bottom left points of the window we just placed - we're going to keep track of these, and these alone.

+	This essentially creates 3 new points of interest in our available space. The top right, bottom right, and bottom left points of the window we just placed - we're going to keep track of these, and these alone.

+```

 	|------------------|----------------------------|

 	|                  |                            |

 	|                  |                            |

@@ -82,9 +83,14 @@

 	|----------------|                              |

 	|                                               |

 	|-----------------------------------------------|

+```

 	Placing window #3 would see that there is a point, (0,7) with enough space both horizontally and vertically to fit and overlap window #2. Previous versions of binpack checked for windows occupying the same space explicitely, but this is an expensive operation. using and updating an accurate list of applicable points is a means to an end to have a highly efficient packing algorithm.

-Two special cases here require further consideration

+##Two special cases here require further consideration

+```

     |----------------|------|   |-------------|x|--|

     |                |      |   |             |x|  |

     |       #1       |      |   |             |x|  |

@@ -95,12 +101,11 @@

     |            |  #4  |       |       #2      |--|

     |------------|------|       |---------------|

-    # First window

-    In the case of placing window #4, we test previous points for >= y && >= x than a point we're testing. An example where this would be true is the bottom lef

-t corner of window #3 - we attempt to place with our point starting on the same y access as the bottom of #3. In this case it fits.

-    We could even test point 2, and since it's a point on the same axis, we know there's something likely obstructing.

-    # Second window

-    First we test #3 to fit, against the secont point (which is the bottom right of #1). It doesn't fit, as #2 is blocking.

-    We now test future points for >= x && >= y points. The top right of #2 meet both reqs, We use that same x axis to place window 3.

```

+### First window

+	In the case of placing window #4, we test previous points for >= y && >= x than a point we're testing. An example where this would be true is the bottom lef

+t corner of window #3 - we attempt to place with our point starting on the same y access as the bottom of #3. In this case it fits. We could even test point 2, and since it's a point on the same axis, we know there's something likely obstructing.

+### Second window

+	First we test #3 to fit, against the secont point (which is the bottom right of #1). It doesn't fit, as #2 is blocking. We now test future points for >= x && >= y points. The top right of #2 meet both reqs, We use that same x axis to place window 3.