Audrey Lee-St. John

Learn More
Motivated by constraint-based CAD software, we develop the foundation for the rigidity theory of a very general model: the <i>body-and-cad structure</i>, composed of rigid bodies in 3D constrained by pairwise coincidence, angle and distance constraints. We identify 21 relevant geometric constraints and develop the corresponding infinitesimal rigidity theory(More)
A dilemma within computer science departments is developing sustainable ways to expand capacity within introductory computer science courses while remaining committed to inclusive practices. Training near-peer mentors for peer code review is one solution. This paper describes the preparation of near-peer mentors for their role, with a focus on regular,(More)
How many pair-wise distances must be prescribed between an unknown set of points, and how should they be distributed, to determine only a discrete set of possible solutions? These questions, and related generalizations, are central in a variety of applications. Combinatorial rigidity shows that in two-dimensions one can get the answer, generically, via an(More)
Geometric constraint systems underly popular Computer Aided Design software. Automated approaches for detecting dependencies in a design are critical for developing robust solvers and providing informative user feedback, and we provide algorithms for two types of dependencies. First, we give a pebble game algorithm for detecting generic dependencies. Then,(More)
Given a weighted, undirected simple graph G = (V,E, d) (where d : E → R+), the Distance Geometry Problem (DGP) is to determine an embedding x : V → R K such that ∀{i, j} ∈ E ‖xi − xj‖ = dij . Although, in general, the DGP is solved using continuous methods, under certain conditions the search is reduced to a discrete set of points. We give one such(More)