struct PK_FACE_change_o_s { int o_t_version; --- version number of option --- structure PK_LOGICAL_t merge_face; --- whether changed faces are to --- be merged with their --- neighbours, if feasible --- (PK_LOGICAL_true) PK_LOGICAL_t allow_disjoint; --- whether disjoint body can --- be produced --- (PK_LOGICAL_false) PK_check_fa_fa_t check_fa_fa; --- check for face-face --- inconsistencies --- (PK_check_fa_fa_yes_c) PK_replace_edge_data_t edge_data; --- replace data for edges PK_replace_vertex_data_t vertex_data; --- replace data for vertices PK_replace_help_points_t edge_help; --- edge help points PK_replace_help_points_t vertex_help; --- vertex help points }; typedef struct PK_FACE_change_o_s PK_FACE_change_o_t; This structure contains optional controls for PK_FACE_change. Description of fields: merge_face If this flag is set to PK_LOGICAL_true, the new faces produced by the operation will be merged with their neighbouring faces, if it is feasible. The default value is PK_LOGICAL_true. allow_disjoint If this flag is set to PK_LOGICAL_true, and if the resulting body is split by the operation, all the disjoint components of that body will be preserved within a single body. If this flag is set to PK_LOGICAL_false, only one disjoint part of the body will be returned. The default value is PK_LOGICAL_false. check_fa_fa Check for face-face inconsistencies. Permitted values are: PK_check_fa_fa_yes_c PK_check_fa_fa_no_c The default value is PK_check_fa_fa_yes_c. edge_data Structure containing the data relative to the edge curve replacements. Refer to its documentation for details. vertex_data Structure containing the data relative to the vertex point replacements. Refer to its documentation for details. edge_help Structure containing the data relative to the edge help points. Help points are used to pick new edge curves. In case of multiple solutions, the closest curve to the related help point is chosen. vertex_help Structure containing the data relative to the vertex help points. Help points are used to pick new vertex positions. In case of multiple solutions, the closest point to the related help point is chosen.