메뉴 건너뛰기




Volumn 31, Issue 6, 2012, Pages

Example-based synthesis of 3D object arrangements

Author keywords

3D scenes; Automatic layout; Data driven methods; Probabilistic modeling; Procedural modeling

Indexed keywords

3D SCENES; AUTOMATIC LAYOUT; DATA-DRIVEN METHODS; PROBABILISTIC MODELING; PROCEDURAL MODELING;

EID: 84870171542     PISSN: 07300301     EISSN: 15577368     Source Type: Journal    
DOI: 10.1145/2366145.2366154     Document Type: Conference Paper
Times cited : (361)

References (23)
  • 1
    • 0000501656 scopus 로고
    • Information theory and an extension of the maximum likelihood principle
    • AKAIKE, H. 1973. Information theory and an extension of the maximum likelihood principle. In Second International Symposium on Information Theory, vol. 1, 267-281.
    • (1973) Second International Symposium on Information Theory , vol.1 , pp. 267-281
    • Akaike, H.1
  • 6
    • 84872258317 scopus 로고    scopus 로고
    • Characterizing structural relationships in scenes using graph kernels
    • papers
    • FISHER, M., SAVVA, M., AND HANRAHAN, P. 2011. Characterizing structural relationships in scenes using graph kernels. In ACM SIGGRAPH 2011 papers, 34:1-34:12.
    • (2011) ACM SIGGRAPH 2011 , pp. 341-3412
    • Fisher, M.1    Savva, M.2    Hanrahan, P.3
  • 9
    • 0030150058 scopus 로고    scopus 로고
    • Superfaces: Polygonal mesh simplification with bounded error
    • KALVIN, A., AND TAYLOR, R. 1996. Superfaces: Polygonal mesh simplification with bounded error. Computer Graphics and Applications, IEEE 16, 3, 64-77.
    • (1996) Computer Graphics and Applications IEEE , vol.16 , Issue.3 , pp. 64-77
    • Kalvin, A.1    Taylor, R.2
  • 10
    • 34249685005 scopus 로고    scopus 로고
    • An approximate and efficient method for optimal rotation alignment of 3d models. Pattern Analysis and Machine Intelligence
    • (July)
    • KAZHDAN, M. 2007. An approximate and efficient method for optimal rotation alignment of 3d models. Pattern Analysis and Machine Intelligence, IEEE Transactions on 29, 7 (july), 1221-1229.
    • (2007) IEEE Transactions on , vol.29 , Issue.7 , pp. 1221-1229
    • Kazhdan, M.1
  • 11
    • 0002719797 scopus 로고
    • The hungarian method for the assignment problem
    • KUHN, H. 1955. The hungarian method for the assignment problem. Naval research logistics quarterly 2, 1-2, 83-97.
    • (1955) Naval Research Logistics Quarterly , vol.2 , Issue.12 , pp. 83-97
    • Kuhn, H.1
  • 13
  • 14
    • 0000034040 scopus 로고
    • Complexities of hierarchic clustering algorithms: State of the art
    • MURTAGH, F. 1984. Complexities of hierarchic clustering algorithms: state of the art. Computational Statistics Quarterly 1, 2, 101-113.
    • (1984) Computational Statistics Quarterly , vol.1 , Issue.2 , pp. 101-113
    • Murtagh, F.1
  • 20
    • 0036450403 scopus 로고    scopus 로고
    • Constraint-based automatic placement for scene composition
    • XU, K., STEWART, J., AND FIUME, E. 2002. Constraint-based automatic placement for scene composition. In Graphics Interface 2002, 25-34.
    • (2002) Graphics Interface , vol.2002 , pp. 25-34
    • X, U.K.1    Stewart, J.2    Fiume, E.3
  • 21
  • 22


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