相关论文: On reconstructing n-point configurations from the …

In a previous paper we showed that, for any $n \ge m+2$, most sets of $n$ points in $\RR^m$ are determined (up to rotations, reflections, translations and relabeling of the points) by the distribution of their pairwise distances. But there…

Point configurations have been widely used as model systems in condensed matter physics, materials science and biology. Statistical descriptors such as the $n$-body distribution function $g_n$ is usually employed to characterize the point…

We investigate rigidity-type problems on the real line and the circle in the non-generic setting. Specifically, we consider the problem of uniquely determining the positions of $n$ distinct points $V = {v_1, \ldots, v_n}$ given a set of…

Let $n$ points be in crescent configurations in $\mathbb{R}^d$ if they lie in general position in $\mathbb{R}^d$ and determine $n-1$ distinct distances, such that for every $1 \leq i \leq n-1$ there is a distance that occurs exactly $i$…

The curse of dimensionality is a common phenomenon which affects analysis of datasets characterized by large numbers of variables associated with each point. Problematic scenarios of this type frequently arise in classification algorithms…

We investigate the enumerative geometry of point configurations in projective space. We define "projective configuration counts": these enumerate configurations of points in projective space such that certain specified subsets are in fixed…

We start by introducing the basics of configurations of points and lines, and then move into discussing symmetry groups of these configurations. Specifically, we explore how we might classify the symmetries of $(9_3)$ and $(10_3)$ geometric…

We study the problem of determining the configuration of $n$ points by using their distances to $m$ nodes, referred to as anchor nodes. One sampling scheme is Nystrom sampling, which assumes known distances between the anchors and between…

We address the problem of comparing and aligning spatial point configurations in $\mathbb{R}^3$ arising from structured geometric patterns. Each pattern is decomposed into arms along which we define a normalized finite-difference operator…

Several real-world and abstract structures and systems are characterized by marked hierarchy to the point of being expressed as trees. Because the study of these entities often involves sampling (or discovering) the tree nodes in a specific…

Consider the diagonal action of the projective group $\PGL_3$ on $n$ copies of ${\mathbb P}^2$. In addition, consider the action of the symmetric group $\Sigma_n$ by permuting the copies. In this paper we find a set of generators for the…

We characterize the topological configurations of points and lines that may arise when placing n points on a circle and drawing the n perpendicular bisectors of the sides of the corresponding convex cyclic n-gon. We also provide exact and…

Reconstructing a finite set of curves from an unordered set of sample points is a well studied topic. There has been less effort that considers how much better the reconstruction can be if tangential information is given as well. We show…

We address the problem of reconstructing a set of points on a line or a loop from their unassigned noisy pairwise distances. When the points lie on a line, the problem is known as the turnpike; when they are on a loop, it is known as the…

We investigate the set of limit points of averages of rearrangements of a given sequence. We study how the properties of the sequence determine the structure of that set and what type of sets we can expect as the set of such accessible…

A typical computational geometry problem begins: Consider a set P of n points in R^d. However, many applications today work with input that is not precisely known, for example when the data is sensed and has some known error model. What if…

The appropriate selection of recurrence thresholds is a key problem in applications of recurrence quantification analysis and related methods across disciplines. Here, we discuss the distribution of pairwise distances between state vectors…

Finitely many hypersurfaces are removed from unordered configuration spaces of $n$ points in $\mathbb{C}$ to obtain a fibration over unordered configuration spaces of $n-1$ complex points. Fundamental groups of these restricted…

To reconstruct the points in three dimensional space, we need at least two images. In this paper we compared two different methods: the first uses only two images, the second one uses three. During the research we measured how camera…

We investigate point arrangements $v_i\in\mathbb R^d,i\in \{1,...,n \}$ with certain prescribed symmetries. The arrangement space of $v$ is the column span of the matrix in which the $v_i$ are the rows. We characterize properties of $v$ in…