graph TD A[physdes] --> B[generic ๐ ๏ธ] A --> C[interval ๐] A --> D[point ๐] A --> E[vector2 โ๏ธ] A --> F[recti ๐ฒ] A --> G[merge_obj ๐ถ] A --> H[polygon ๐ท] A --> I[rpolygon ๐ถ] style A fill:#fff3e0,stroke:#e65100,stroke-width:3px style B fill:#c8e6c9,stroke:#2e7d32,stroke-width:3px style C fill:#e3f2fd,stroke:#1565c0,stroke-width:3px style D fill:#c8e6c9,stroke:#2e7d32,stroke-width:3px style F fill:#e3f2fd,stroke:#1565c0,stroke-width:3px style H fill:#f3e5f5,stroke:#7b1fa2,stroke-width:3px style I fill:#f3e5f5,stroke:#7b1fa2,stroke-width:3px
graph LR A[Two Objects] --> B{overlap} A --> C{contain} A --> D{intersection} A --> E{min_dist} A --> F{hull} A --> G{enlarge} B --> H[Boolean] C --> H D --> I[Common Region] E --> J[Distance] F --> K[Bounding Box] G --> L[Expanded Shape] style A fill:#fff3e0,stroke:#e65100,stroke-width:3px style B fill:#ffcdd2,stroke:#c62828,stroke-width:3px style D fill:#c8e6c9,stroke:#2e7d32,stroke-width:3px style F fill:#e3f2fd,stroke:#1565c0,stroke-width:3px style G fill:#f3e5f5,stroke:#7b1fa2,stroke-width:3px
graph TD B[Interval ๐] --> D[Point ๐] D --> F[Rectangle ๐ฒ] D --> G[Segment ๐] F --> H[RPolygon ๐ถ] G --> H D --> I[MergeObj ๐ถ] D --> J[Vector2 โ๏ธ] G --> K[Routing Tree ๐ณ] style B fill:#e3f2fd,stroke:#1565c0,stroke-width:3px style D fill:#fff3e0,stroke:#e65100,stroke-width:3px style F fill:#c8e6c9,stroke:#2e7d32,stroke-width:3px style H fill:#f3e5f5,stroke:#7b1fa2,stroke-width:3px style K fill:#c8e6c9,stroke:#2e7d32,stroke-width:3px