This paper studies the advancement of geometric logic through tessellations and sweeping nets, addressing the challenge of arranging reflecting points for efficient ray tracing under limited time constraints. We introduce the concept of a sweeping subnet alongside a causal barrier to encapsulate the geometrical limitations posed by time, thereby delineating the boundary of influence for light propagation within a defined space. This work delves into the underpinnings of tessellation dynamics, revealing how the spatial arrangement and temporal evolution of tessellated patterns can be navigated and optimized through a novel algorithmic framework. Through a combination of theoretical exploration and practical implementation, including Python code for simulation and visualization, we provide a platform for approximating optimal tessellations that adapt to the constraints dictated by the causal barrier. This paper formalizes quasi-quanta notation in such a way that it may be implemented.