This is particularly inconvenient if models have been generated inside the lots. Successive steps of the skeleton subdivision algorithm Consistent IndexingДЄs a result of the recursive nature of the subdivision algorithm and the different criteria dictated by shape attributes, the ordering of the lots resulting from subdivision might significantly vary after an editing operation. Finally each of the face-groups are sliced in a direction perpendicular to their street edges to create lots, and small lots are merged together until they are larger than lotAreaMin. For each corner, the alignment priority (see cornerAlignment) determines how we assign the corner sections of these face-groups (below, bottom left). Given a set of skeleton faces, we identify those whose street edges are adjacent and of a similar curvature (below, top right). The skeleton subdivision algorithm uses the straight skeleton (below, top left) to identify the center lines of the block. Lines orthogonal to the offset at the sample points and passing through the sample points are used to split the stripe between the block contour and the offset. Consecutive points are separated by a distance computed as a function of the user-specified lot areas. A set of sample points is computed along the offset. The offset subdivision algorithm computes the inwards offset of the block contour and subdivides into lots the stripe between the block contour and its offset.

Successive steps of the recursive OBB algorithm Offset algorithm Random seeds: To increase the stability of subdivisions under interactive editing operations, the random seeds for the children lots of a given lot are computed before the recursive call to the subdivision function.Edge alignment: To increase the stability of subdivisions under interactive editing operations, the sampling angle space to compute an approximation of the OBB uses one of the lot edges as reference.Snap to block contour vertices: If the split line is within a threshold distance from one of the vertices of the contour of the original block, the pivot point of the split line is set to that vertex.Street access: If one of the lots resulting from a split has no street access, the orthogonal vector to the initial direction vector is used.The split line pivot and direction can be modified by three criteria: By default, the pivot point is set to the midpoint of the largest edge of the OBB, and the split line direction is set to the direction of the smallest edge of the OBB. To determine the pivot point and direction of the split line, the minimum-area oriented bounding box (OBB) of the lot is computed. If the two lots resulting from the split meet the user-specified constraints, the algorithm recurses on them. The recursive OBB algorithm computes a split line at each step. There is an option to remove the lot's corners.Дescription of algorithms Recursive OBB algorithm This simple subdivision technique subdivides the block into a single lot of the same shape.

Offset cityengine