Implementing geometric modeling operations in a programming language can be inherently challenging despite their seemingly simple input-to-output descriptions. We propose a program synthesis method to generate executable code from representative examples. We focus on geometric computations in topology-based modeling, where nD objects are decomposed into cells with added geometric information. This domain uses combinatorial structures represented as graphs, with operations formalized as graph transformation rules and geometric modifications given by code-like annotations on the rule’s graph nodes.