Clusters of stars
Ileana Streinu
Abstract
Open-access reader
Ileana Streinu
Abstract
Open-access reader
We solve two open problems posed by Goodman and Pollack[GP84] about sets of signed circular permutations (clusters of stars) arising from generalized configurations of points: recognition and efficient reconstruction (drawing).As a biproduct we get an (7(n2 ) space data structure constructible in 0(n2 ) time, representing the order type of a (generalized) configuration of points and from which the orientation of each tride can be found in constant time.a moblem Dosed in '~HNJ.
OpenAlex reports 12 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We solve two open problems posed by Goodman and Pollack[GP84] about sets of signed circular permutations (clusters of stars) arising from generalized configurations of points: recognition and efficient reconstruction (drawing).As a biproduct we get an (7(n2 ) space data structure constructible in 0(n2 ) time, representing the order type of a (generalized) configuration of points and from which the orientation of each tride can be found in constant time.a moblem Dosed in '~HNJ.
Key concepts: Citation, Computer science, Library science, World Wide Web