# Efficient Atlasing and Search of Configuration Spaces of Point-Sets Constrained by Distance Intervals

Source: [Efficient Atlasing and Search of Configuration Spaces of Point-Sets Constrained by Distance Intervals](<https://www.sota2.com/research/paper/68fa646e1e209131cea04aff>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-28T13:56:36.129Z

Authors: Aysegul Ozkan, Rahul Prabhu, Troy Baker, James Pence, Jorg Peters, Meera Sitharam

Published: 2018-05-18T21:35:40.000Z

## Abstract

For configurations of point-sets that are pairwise constrained by distance intervals, the EASAL software implements a suite of algorithms that characterize the structure and geometric properties of the configuration space. The algorithms generate, describe and explore these configuration spaces using generic rigidity properties, classical results for stratification of semi-algebraic sets, and new results for efficient sampling by convex parametrization. The paper reviews the key theoretical underpinnings, major algorithms and their implementation. The paper outlines the main applications such as the computation of free energy and kinetics of assembly of supramolecular structures or of clusters in colloidal and soft materials. In addition, the paper surveys select experimental results and comparisons.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1805.07450>)

[PDF](<https://arxiv.org/pdf/1805.07450.pdf>)