An Edge‐Face Relational Scheme for Boundary Representations
暂无分享,去创建一个
[1] Joseph JáJá,et al. Parallel Algorithms in Graph Theory: Planarity Testing , 1982, SIAM J. Comput..
[2] N.R. Malik,et al. Graph theory with applications to engineering and computer science , 1975, Proceedings of the IEEE.
[3] ARISTIDES A. G. REQUICHA,et al. Representations for Rigid Solids: Theory, Methods, and Systems , 1980, CSUR.
[4] Bruce G. Baumgart,et al. Geometric modeling for computer vision. , 1974 .
[5] Kenneth Steiglitz,et al. A new planarity test based on 3-connectivity , 1970 .
[6] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..
[7] J. Hopcroft,et al. Efficient algorithms for graph manipulation , 1971 .
[8] Joseph JáJá,et al. Fast, Efficient Parallel Algorithms for Some Graph Problems , 1981, SIAM J. Comput..
[9] Mantyla,et al. GWB: A Solid Modeler with Euler Operators , 1982, IEEE Computer Graphics and Applications.
[10] Pat Hanrahan,et al. Creating volume models from edge-vertex graphs , 1982, SIGGRAPH.
[11] Robert E. Tarjan,et al. Dividing a Graph into Triconnected Components , 1973, SIAM J. Comput..