论文信息 - Two algorithms for polyhedral pictures

Two algorithms for polyhedral pictures

We present two algorithms for pictures of polyhedral scenes. These algorithms have been conjectured (and used for some time), but only now been verified. The combinatorial algorithm, proposed by Sugihara, uses counts on the incidence structure to characterize pictures which are generically the projection of sharp polyhedral scenes of planes and points. The geometric algorithm, described by Clerk Maxwell and rediscovered in the last decade, uses a reciprocal diagram in the plane to characterize pictures of strict oriented polyhedra in space.

Walter Whiteley | W. Whiteley

[1] Walter Whiteley,et al. The algebraic geometry of motions of bar-and-body frameworks , 1987 .

[2] E. Bolker,et al. Generalized Dirichlet tessellations , 1986 .

[3] A. Macworth. Interpreting pictures of polyhedral scenes , 1973 .

[4] K. Sugihara. Machine interpretation of line drawings , 1986, MIT Press series in artificial intelligence.

[5] James E. Goehring,et al. THE ENGLISH TRANSLATION , 1986 .

[6] Raimund Seidel,et al. Voronoi diagrams and arrangements , 1985, SCG '85.

[7] Takeo Kanade,et al. A Theory of Origami World , 1979, Artif. Intell..

[8] W. Whiteley. Motions and stresses of projected polyhedra , 1982 .

[9] Ethan D. Bolker,et al. Recognizing Dirichlet tessellations , 1985 .

[10] Kokichi Sugihara,et al. An algebraic and combinatorial approach to the analysis of line drawings of polyhedra , 1984, Discret. Appl. Math..

[11] Hiroshi Imai,et al. On combinatorial structures of line drawings of polyhedra , 1985, Discret. Appl. Math..

[12] Alan K. Mackworth. Interpreting Pictures of Polyhedral Scenes , 1973, IJCAI.