*** Error in routine dbShapeQuery:

You will have to filter the shapes you get from dbShapeQuery as it returns the shapes whose BOUNDING BOX intersects your search box. Any shape which crosses the search box or any shape outside the search box whose bounding box will be returned as well as those you are looking for. This is illustrated in the documentation for the function dbGetOverlaps.

The simple method is to compare the search box with the transformed bounding box of the shapes found. If the shape is not at the top level of the hierarchy, the return value will be a list of the hierarchical instances leading to that shape. Get the instance transform using dbGetInstTransform and then transform the bBox of the shape with dbTransformBBox.

To find if the resulting bBox is inside the search box, compare the lower left points and the upper right points of the boxes.

You can enclose all of this in the setof statement, the search box points have been put into variables before the loop for performance:

shapesToBeModified = setof( shape listOfFoundShapes
                                                if(listp(shape) then
                                                      shapeBox = dbTransformBBox( car(last(shape))~>bBox dbGetInstTransform(shape) )
                                                      shape = car(last(shape))
                                               else
                                                      shapeBox = shape~>bBox )
                                                when( xCoord(lowerLeft(shapeBox)) >= llxSearchBox && yCoord(lowerLeft(shapeBox)) >= llySearchBox &&
                                                           xCoord(upperRight(shapeBox)) <= urxSearchBox && yCoord(upperRight(shapeBox)) <= urySearchBox
                                                          shape )
                                          ) ; setof

This code has not been tested.

You will have to filter the shapes you get from dbShapeQuery as it returns the shapes whose BOUNDING BOX intersects your search box. Any shape which crosses the search box or any shape outside the search box whose bounding box will be returned as well as those you are looking for. This is illustrated in the documentation for the function dbGetOverlaps.

The simple method is to compare the search box with the transformed bounding box of the shapes found. If the shape is not at the top level of the hierarchy, the return value will be a list of the hierarchical instances leading to that shape. Get the instance transform using dbGetInstTransform and then transform the bBox of the shape with dbTransformBBox.

To find if the resulting bBox is inside the search box, compare the lower left points and the upper right points of the boxes.

You can enclose all of this in the setof statement, the search box points have been put into variables before the loop for performance:

shapesToBeModified = setof( shape listOfFoundShapes
                                                if(listp(shape) then
                                                      shapeBox = dbTransformBBox( car(last(shape))~>bBox dbGetInstTransform(shape) )
                                                      shape = car(last(shape))
                                               else
                                                      shapeBox = shape~>bBox )
                                                when( xCoord(lowerLeft(shapeBox)) >= llxSearchBox && yCoord(lowerLeft(shapeBox)) >= llySearchBox &&
                                                           xCoord(upperRight(shapeBox)) <= urxSearchBox && yCoord(upperRight(shapeBox)) <= urySearchBox
                                                          shape )
                                          ) ; setof

This code has not been tested.