An e-graph efficiently represents a congruence relation over many expressions. Although
they were originally developed in the late 1970s for use in automated theorem provers, a …

Library learning compresses a given corpus of programs by extracting common structure
from the corpus into reusable library functions. Prior work on library learning suffers from two …

Recent program synthesis techniques help users customize CAD models (eg, for 3D
printing) by decompiling low-level triangle meshes to Constructive Solid Geometry (CSG) …

Programs offer compactness and structure that makes them an attractive representation for
visual data. We explore how code rewriting can be used to improve systems for inferring …

We introduce ShapeCoder, the first system capable of taking a dataset of shapes,
represented with unstructured primitives, and jointly discovering (i) useful abstraction …

Procedural models (ie symbolic programs that output visual data) are a historically‐popular
method for representing graphics content: vegetation, buildings, textures, etc. They offer …

Many compilers, synthesizers, and theorem provers rely on rewrite rules to simplify
expressions or prove equivalences. Developing rewrite rules can be difficult: rules may be …

A popular way to create detailed yet easily controllable 3D shapes is via procedural
modeling, ie generating geometry using programs. Such programs consist of a series of …

Interlocking puzzles are intriguing geometric games where the puzzle pieces are held
together based on their geometric arrangement, preventing the puzzle from falling apart …

The packing problem, also known as cutting or nesting, has diverse applications in logistics,
manufacturing, layout design, and atlas generation. It involves arranging irregularly shaped …