Pseudotriangle Decomposition is a computational geometry method that partitions a planar region into pseudotriangles—polygonal regions with exactly three convex vertices—such that the resulting decomposition minimizes visibility-based complexity in occlusion culling and visibility query algorithms.