## FAST : Fast Adaptive Silhouette Area based Template Matching

- Daniel Mohr dmoh
- 2013

- Published 2002 in CCCG

We provide a polynomial-time algorithm to partition an orthogonal polygon of n vertices into isothetic rectangles so that the shortest rectangle side is maximized over all rectangles. Thus no rectangle is “thin”; all rectangles are “fat.”

### Presentations referencing similar topics