Planar domain simplification for modeling virtual-solids in plant and machinery layout
Complex mechanical systems involve functionality constraints implying empty volumes that must exist at specific locations. These may be modeled as virtual-solids using standard solid modeling techniques. This approach requires an efficient simplification algorithm for planar domains. Such an algorithm is proposed here, which is based on examining all possible sequences of edges that might be simplified. A property is established that limits the parts of the domain's boundary the algorithm must consider. Examples are included that demonstrate the validity of this algorithm. Finally, a detailed analysis establishes the advantages of the new algorithm over published techniques from the fields of automatic nesting of irregular parts and automatic finite-element meshing.
layout functionality constraints nesting extrusions detail suppression polygonization