2014/09/09 by Micha A. Perles, Perles, Micha A., Moriah Sigron +1 · 1 citation
Computer Science · Mathematics · #Advanced Topology and Set Theory #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #FOS: Mathematics #Limits and Structures in Graph Theory #math.CO
paper · pdf · doi:10.48550/arxiv.1409.2899
arxiv created 2014/09/09 · openalex publication_date 2014/09/09 · arxiv updated 2014/09/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We say that a finite set S of points in Rd is in "strong general position" if for any collection F1,..., Fr of r pairwise disjoint subsets of S (1 <= r <= |S|) we have: d-dim (the intersection of aff F1,aff F2,...,aff Fr) = mind+1, (d-dim aff F1)+(d-dim aff F2)+...+(d-dim aff Fr). In this paper we reduce the set of conditions that one has to check in order to determine if S is in "strong general position".