| 61. | Maver, Thomas W. and Petric, Jelena (Eds.) (1994) | The Virtual Studio [Conference Proceedings]
eCAADe Conference Proceedings / ISBN 0-9523687-0-6 / Glasgow (Scotland) 7-10 September 1994, 262 p. https://doi.org/10.52842/conf.ecaade.1994 | |
| 62. | Maver, Thomas W. (1982) | Computer Aided Architectural Design. Implication for Practice + Education
Proceedings of Aicographics 82 Conference, Milano (Italy), 26/29 October, pp. 21-39 https://papers.cumincad.org/cgi-bin/works/Show?maver_102 | |
| 63. | Minsky, Marvin (editor) (1982) | Semantic Information Processing
viii, 438 p. : ill. Cambridge, Mass.: the MIT Press, 1982, [c1968]. includes bibliography.--- 3rd. printing https://papers.cumincad.org/cgi-bin/works/Show?0c01 | |
| 64. | Nestor, J. A. and Thomas, Donald E. (1982) | Defining and Implementing a Multilevel Design Representation with Simulation Applications
Design Research Center, CMU, December, 1982. [7] p. includes bibliography https://papers.cumincad.org/cgi-bin/works/Show?46bd | |
| 65. | Newell, Allen and Rosenbloom, Paul S. (1982) | Mechanisms of Skill Acquisition and the Law of Practice
[2], III, 52 p. : ill Design Research Center, CMU, April, 1982. DRC-15-16-82. includes bibliography. https://papers.cumincad.org/cgi-bin/works/Show?e55f | |
| 66. | Newell, Allen (1982) | The Knowledge Level
[2]. 46 p. : ill. Design Research Center, CMU, April, 1982. DRC-15-15-82. includes bibliography https://papers.cumincad.org/cgi-bin/works/Show?611a | |
| 67. | Nievergelt, J. and Preparata, Franco P. (1982) | Plane-Sweep Algorithms for Intersecting Geometric Figures
Communications of the ACM. October, 1982. vol. 25: pp. 739-747 : ill. includes bibliography https://papers.cumincad.org/cgi-bin/works/Show?2415 | |
| 68. | O'Rourke, J., Chien, C.-B. and Olson, Th. (et al) (1982) | A New Linear Algorithm for Intersecting Convex Polygons
Computer Graphics and Image Processing. 1982. vol. 19: pp. 384-391 : ill. includes a short bibliography https://papers.cumincad.org/cgi-bin/works/Show?2243 | |
| 69. | Oksala, Tarkko (1982) | Computer Assisted Generation of Houses
1982? pp. 111-120 : ill. includes bibliography https://papers.cumincad.org/cgi-bin/works/Show?0be9 | |
| 70. | Rasdorf, William J. and Kutay, Ali R. (1982) | Maintenance of Integrity During Concurrent Access in a Building Design Database
Computer Aided Design. Butterworth Scientific Ltd., July, 1982. vol. 14: pp. 201-207. includes bibliography https://papers.cumincad.org/cgi-bin/works/Show?4bae | |
| 71. | Schijf, Rik (1986) | CAD in the Netherlands: Integrated CAD
Computer-Aided Architectural Design Futures [CAAD Futures Conference Proceedings / ISBN 0-408-05300-3] Delft (The Netherlands), 18-19 September 1985, pp. 176-184 https://papers.cumincad.org/cgi-bin/works/Show?46b0 | |
| 72. | Shafer, Steven A. and Kanade, Takeo (1982) | Using Shadows in Finding Surface Orientations
61 p. : ill.` Pittsburgh, PA: Department of Computer Science, CMU, January, 1982. CMU-CS- 82-100 https://papers.cumincad.org/cgi-bin/works/Show?e1d1 | |
| 73. | Udupa, Jayaram K., Srihari, Sargur N. and Herman, Gabor T. (1982) | Boundary Detection in Multidimensions
IEEE Transactions on Pattern Analysis and Machine Intelligence. January, 1982. vol. PAM-4: pp. 41-50 : ill. includes bibliography https://papers.cumincad.org/cgi-bin/works/Show?233c | |
| 74. | Vanier, D. J. and Worling, Jamie (1986) | Three-dimensional Visualization: A Case Study
Computer-Aided Architectural Design Futures [CAAD Futures Conference Proceedings / ISBN 0-408-05300-3] Delft (The Netherlands), 18-19 September 1985, pp. 92-102 https://papers.cumincad.org/cgi-bin/works/Show?452c | |
| 75. | Wang, Ming-Hung and Habraken, John N. (1982) | Six Operations : Notations of Design Process
Spring, 1982. pp. 1-18 : ill https://papers.cumincad.org/cgi-bin/works/Show?4617 | |
| 76. | Woodwark, J.R. (1989) | Splitting Set-Theoretic Solid Models into Connected Components
10 p. : ill. Winchester: IBM UK Scientific Center, IBM United Kingdom Laboratories Limited, June, 1989. IBM UKSC 210. includes bibliography In general, there is no way to tell how many pieces (connected components) a set-theoretic (CSG) solid model represents, except via conversion to a boundary model. Recent work on the elimination of redundant primitives has been linked with techniques for identifying connected components in quad-trees and oct-trees into a strategy to attack this problem. Some success has been achieved, and an experimental Prolog program, working in two dimensions, that finds connected components and determines the set-theoretic representation of each component, is reported, and further developments proposed. CSG / quadtree / octree / primitives / algorithms. 43. Woodwark, J. R. and Quinlan K. M. 'Reducing the Effect of Complexity on Volume Model Evaluation.' Computer Aided Design. April, 1982. pp. 89-95 : ill. includes bibliography. https://papers.cumincad.org/cgi-bin/works/Show?2786 | |
