Automatically Building Diagrams for Olympiad Geometry Problems

  title={Automatically Building Diagrams for Olympiad Geometry Problems},
  author={Ryan Krueger and Jesse Michael Han and Daniel Selsam},
We present a method for automatically building diagrams for olympiad-level geometry problems and implement our approach in a new open-source software tool, the Geometry Model Builder (GMB). Central to our method is a new domain-specific language, the Geometry Model-Building Language (GMBL), for specifying geometry problems along with additional metadata useful for building diagrams. A GMBL program specifies (1) how to parameterize geometric objects (or sets of geometric objects) and initialize… 



SciPy 1.0: fundamental algorithms for scientific computing in Python

An overview of the capabilities and development practices of SciPy 1.0 is provided and some recent technical developments are highlighted.

Automatically Proving Plane Geometry Theorems Stated by Text and Diagram

This paper presents an algorithm for proving plane geometry theorems stated by text and diagram in a complementary way by solving the problem of proving two challenging subta...

Solution selectors: A user-oriented answer to the multiple solution problem in constraint solving

It is established that only explicit, independent solution selection declarations can provide a flexible mechanism that is sufficient for all situations and the systematic derivation of a set of solution selector types is described, by considering the occurrences of multiple solutions in combinations of mutually constrained geometric entities.

Geometric Constraint Solving in Parametric Computer-Aided Design

On the Uses of Rigorous Proof. (Book Reviews: Proofs and Refutations. The Logic of Mathematical Discovery)

Taking the form of a dialogue between a teacher and some students, the book considers various solutions to mathematical problems and, in the process, raises important questions about the nature of mathematical discovery and methodology.

Applications of Gro¨bner bases in non-linear computational geometry

This paper gives some examples of applying the Grobner bases method to problems in non-linear computational geometry (inverse kinematics in robot programming, collision detection for superellipsoids, implicitization of parametric representations of curves and surfaces, inversion problem for parametric representation, automated geometrical theorem proving, primary decomposition of implicitly defined geometric objects).

The Cinderella.2 Manual: Working with The Interactive Geometry Software

Cinderella.2, the new version of the well-known interactive geometry software, has become an even more versatile tool than its predecessor and the software includes two major new components: physical simulation such as of mechanical objects, virtual electronic devices, and electromagnetic properties.

Semantics of families of objects