Troy A. Baker

Computer Science Professional

August, 2018. ACM TOMS.

“Algorithm 990: Efficient Atlasing and Search of Configuration Spaces of Point-Sets Constrained by Distance Intervals”

An explanation of the software architecture and the novel algorithms (and their theoretical backing) present in the EASAL software. EASAL is a suite of algorithms for understanding the structure and geometric properties of rigid point sets that are pairwise constrained by distance intervals. This is done by exploring the configuration spaces of these constraint systems.

July, 2018. Handbook of Geometric Constraint Systems Principles.

Book Chapter: “Overview and Preliminaries”

An introduction to fundamental concepts in rigidity theory: the study of rigidity in systems with a variety of geometric objects and constraints, which can be embedded in a variety of spaces. Additionally attempts to unify some contradictory abuse of terminology that has developed over the past century of study.

July, 2018. Handbook of Geometric Constraint Systems Principles.

Book Chapter: “Geometric Constraint Decomposition: The General Case”

An introduction to the various techniques for decomposing geometric constraint systems. Discusses the different benefits, uses, and limitations of such techniques, which depends on the variety of geometric system being decomposed.

July, 2015. CAGD 40.

“Optimal Decomposition and Recombination of Isostatic Geometric Constraint Systems for Designing Layered Materials”

Presents a new form of

*optimal*decomposition for minimally rigid 2D bar-joint constraint systems. Introduces the new theory, the proof of existence, and an O(n^{3}) algorithm. Emphasizes the application of this algorithm to material design and medical science.
December, 2012. ApJ, 761, 141.

“The Faint End of the Cluster Luminosity Function at High Redshift”

Investigating the parameters of the field luminosity function at redshift ~1.3 through analysis of images from the Spitzer IRAC Shallow Cluster Survey.