Consider if you will polygon A of a standard unchanging dimension. For the sake of argument lets call it a simple rectangle 10' x 20' not any irregular shape with hundreds of vertices but not a square or circle either. How can a user assess which of a group of polygons can completely contain polygon A. This appears like it ought to be a frequently occurring question in assessor's offices and planning departments: How many of my town's parcels have both the amount and orientation of land to support a building of a given size and dimensions. Can city engine do something like this easily?