메뉴 건너뛰기




Volumn 25, Issue 4, 1998, Pages 559-576

On the generation of linear representations of spatial configuration

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR REPRESENTATION; SPACE SYNTAX; SPATIAL ANALYSIS;

EID: 0031663481     PISSN: 02658135     EISSN: None     Source Type: Journal    
DOI: 10.1068/b250559     Document Type: Article
Times cited : (79)

References (29)
  • 4
    • 0000955797 scopus 로고
    • A linear algorithm for computing the visibility polygon from a point
    • El Gindy H, Avis D, 1981, "A linear algorithm for computing the visibility polygon from a point" Journal of Algorithms 2 186-197
    • (1981) Journal of Algorithms , vol.2 , pp. 186-197
    • El Gindy, H.1    Avis, D.2
  • 5
    • 0029703219 scopus 로고    scopus 로고
    • A threshold of in n for approximating set cover
    • Association for Computing Machinery, New York
    • Fiege U, 1996, "A threshold of In n for approximating set cover", in Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (Association for Computing Machinery, New York) pp 314-318
    • (1996) Proceedings of the 28th Annual ACM Symposium on the Theory of Computing , pp. 314-318
    • Fiege, U.1
  • 7
    • 25044439454 scopus 로고
    • London as it might have been: An analysis of the post fire plans for the rebuilding of the city of London after the Great Fire of 1666
    • Hanson J, 1989, "London as it might have been: an analysis of the post fire plans for the rebuilding of the city of London after the Great Fire of 1666" Ekistics 334-335 22-42
    • (1989) Ekistics , vol.334-335 , pp. 22-42
    • Hanson, J.1
  • 8
    • 0024870084 scopus 로고
    • The architecture of the urban object
    • Hillier B, 1989, "The architecture of the urban object" Ekistics 334-335 5-21
    • (1989) Ekistics , vol.334-335 , pp. 5-21
    • Hillier, B.1
  • 10
    • 0003438346 scopus 로고    scopus 로고
    • Cambridge University Press, Cambridge
    • Hillier B, 1996 Space is the Machine (Cambridge University Press, Cambridge)
    • (1996) Space Is the Machine
    • Hillier, B.1
  • 11
    • 84959594630 scopus 로고
    • Visible colleges. Structure and randomness in the place of discovery
    • Hillier B, Penn A, 1991, "Visible colleges. Structure and randomness in the place of discovery" Science in Context 4(1) 23-49
    • (1991) Science in Context , vol.4 , Issue.1 , pp. 23-49
    • Hillier, B.1    Penn, A.2
  • 16
    • 0023577153 scopus 로고
    • Corrections to Lee's Visibility Polygon Algorithm
    • Joe B, Simpson R B, 1987, "Corrections to Lee's Visibility Polygon Algorithm" BIT 27 458-473
    • (1987) BIT , vol.27 , pp. 458-473
    • Joe, B.1    Simpson, R.B.2
  • 17
    • 0022161363 scopus 로고
    • Decomposing a polygon into simpler components
    • Keil J M, 1985, "Decomposing a polygon into simpler components" SIAM Journal on Computing 14 799-817
    • (1985) SIAM Journal on Computing , vol.14 , pp. 799-817
    • Keil, J.M.1
  • 22
    • 0002803714 scopus 로고    scopus 로고
    • The space of innovation: Interaction and communication in the work environment
    • UCL Press, London
    • Penn A, 1997, "The space of innovation: interaction and communication in the work environment", in First International Space Syntax Symposium Proceedings (UCL Press, London) pp 12.1-12.24
    • (1997) First International Space Syntax Symposium Proceedings
    • Penn, A.1
  • 24
    • 0031418418 scopus 로고    scopus 로고
    • On the description of shape and spatial configuration inside buildings: Convex partitions and their local properties
    • Peponis J, Wineman J, Rashid M, Kim S H, Bafna S, 1997, "On the description of shape and spatial configuration inside buildings: convex partitions and their local properties" Environment and Planning B: Planning and Design 24 761-781
    • (1997) Environment and Planning B: Planning and Design , vol.24 , pp. 761-781
    • Peponis, J.1    Wineman, J.2    Rashid, M.3    Kim, S.H.4    Bafna, S.5
  • 26
    • 0029723340 scopus 로고    scopus 로고
    • A tight analysis of the greedy algorithm for set cover
    • Association for Computing Machinery, New York
    • Slavik P, 1996, "A tight analysis of the greedy algorithm for set cover", in Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (Association for Computing Machinery, New York) pp 435-439
    • (1996) Proceedings of the 28th Annual ACM Symposium on the Theory of Computing , pp. 435-439
    • Slavik, P.1
  • 28
    • 0025387891 scopus 로고
    • On some link distance problems in a simple polygon
    • Suri S, 1990, "On some link distance problems in a simple polygon" IEEE Transactions on Robotics and Automation 6(1) 108-113
    • (1990) IEEE Transactions on Robotics and Automation , vol.6 , Issue.1 , pp. 108-113
    • Suri, S.1
  • 29
    • 0347433181 scopus 로고    scopus 로고
    • Polygons
    • Eds J E Goodman, J O'Rourke (CRC Press, New York)
    • Suri S, 1997, "Polygons", in Handbook of Computational Geometry Eds J E Goodman, J O'Rourke (CRC Press, New York) pp 429-444
    • (1997) Handbook of Computational Geometry , pp. 429-444
    • Suri, S.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.