메뉴 건너뛰기




Volumn 26, Issue 5, 2002, Pages 733-743

Polyhedral surface decomposition with applications

Author keywords

Metamorphosis; Polyhedral surface decomposition; Retrieval of three dimensional models; Simplification

Indexed keywords

ALGORITHMS; COMPUTER VISION; CONTENT BASED RETRIEVAL;

EID: 0036794695     PISSN: 00978493     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0097-8493(02)00128-0     Document Type: Conference Paper
Times cited : (144)

References (27)
  • 2
    • 0000963270 scopus 로고
    • Convex decompositions of polyhedra and robustness
    • Bajaj C.L., Dey T.K. Convex decompositions of polyhedra and robustness. SIAM Journal on Computing. 21:1992;339-364.
    • (1992) SIAM Journal on Computing , vol.21 , pp. 339-364
    • Bajaj, C.L.1    Dey, T.K.2
  • 4
    • 0021475092 scopus 로고
    • Convex partitions of polyhedra: A lower bound and worst-case optimal algorithm
    • Chazelle B. Convex partitions of polyhedra. a lower bound and worst-case optimal algorithm SIAM Journal on Computing. 13:1984;488-507.
    • (1984) SIAM Journal on Computing , vol.13 , pp. 488-507
    • Chazelle, B.1
  • 6
    • 0000212958 scopus 로고
    • Decomposition algorithms in geometry
    • Bajaj C., editor. Berlin: Springer, Chapter 27
    • Chazelle B, Palios L. Decomposition algorithms in geometry. In: Bajaj C., editor. Algebraic geometry and its applications. Berlin: Springer, 1994. p. 419-47 [Chapter 27].
    • (1994) Algebraic geometry and its applications , pp. 419-447
    • Chazelle, B.1    Palios, L.2
  • 7
    • 0345655516 scopus 로고
    • On the difficulty of triangulating three-dimensional non-convex polyhedra
    • Ruppert J., Seidel R. On the difficulty of triangulating three-dimensional non-convex polyhedra. Discrete & Computational Geometry. 7:1992;227-253.
    • (1992) Discrete & Computational Geometry , vol.7 , pp. 227-253
    • Ruppert, J.1    Seidel, R.2
  • 10
    • 0001362805 scopus 로고
    • Visual object recognition
    • Kosslyn S., Osherson D., editors. Cambridge: MIT Press
    • Biederman, I. Visual object recognition. In: Kosslyn S., Osherson D., editors. An invitation to cognitive science, vol. 2, Visual Cognition. Cambridge: MIT Press, 1995. p. 121-65.
    • (1995) An invitation to cognitive science, vol. 2, Visual Cognition , vol.2 , pp. 121-165
    • Biederman, I.1
  • 13
    • 84958748696 scopus 로고    scopus 로고
    • Triangles as a primary representation
    • Object Recognition in Computer Vision, Berlin: Springer
    • Besl P. Triangles as a primary representation. Object Recognition in Computer Vision, Lecture Notes in Computer Science, vol. 994. Berlin: Springer, p. 191-206.
    • Lecture Notes in Computer Science , vol.994 , pp. 191-206
    • Besl, P.1
  • 20
    • 0026890331 scopus 로고
    • Shape transformation for polyhedral objects
    • Kent J.R., Parent R.E., Carlson W.E. Shape transformation for polyhedral objects. Computer Graphics. 26(2):1992;47-54.
    • (1992) Computer Graphics , vol.26 , Issue.2 , pp. 47-54
    • Kent, J.R.1    Parent, R.E.2    Carlson, W.E.3
  • 21
    • 0032309102 scopus 로고    scopus 로고
    • Polyhedron realization for shape transformation
    • Shapiro A., Tal A. Polyhedron realization for shape transformation. The Visual Computer. 14(8-9):1998;429-444.
    • (1998) The Visual Computer , vol.14 , Issue.8-9 , pp. 429-444
    • Shapiro, A.1    Tal, A.2
  • 22
    • 0033727006 scopus 로고    scopus 로고
    • Merging polyhedral shapes with scattered features
    • Alexa M. Merging polyhedral shapes with scattered features. The Visual computer. 16(1):2000;38-46.
    • (2000) The Visual computer , vol.16 , Issue.1 , pp. 38-46
    • Alexa, M.1
  • 23
    • 0031125921 scopus 로고    scopus 로고
    • Parameterization and smooth approximation of surface triangulations
    • Floater M.S. Parameterization and smooth approximation of surface triangulations. Computer Aided Geometric Design. 14:1997;231-250.
    • (1997) Computer Aided Geometric Design , vol.14 , pp. 231-250
    • Floater, M.S.1
  • 24
    • 0035336812 scopus 로고    scopus 로고
    • A developer's survey of polygonal simplification algorithms
    • Luebke D.P. A developer's survey of polygonal simplification algorithms. IEEE Computer Graphics and Applications. 21(3):2001;24-35.
    • (2001) IEEE Computer Graphics and Applications , vol.21 , Issue.3 , pp. 24-35
    • Luebke, D.P.1
  • 26
    • 0033719911 scopus 로고    scopus 로고
    • Multi-level sensitive reconstruction of polyhedral surfaces from parallel slices
    • Barequet G., Shapiro D., Tal A. Multi-level sensitive reconstruction of polyhedral surfaces from parallel slices. The Visual Computer. 16(2):2000;116-133.
    • (2000) The Visual Computer , vol.16 , Issue.2 , pp. 116-133
    • Barequet, G.1    Shapiro, D.2    Tal, A.3
  • 27
    • 0030107634 scopus 로고    scopus 로고
    • Piecewise-linear interpolation between polygonal slices
    • Barequet G., Sharir M. Piecewise-linear interpolation between polygonal slices. Computer Vision and Image Understanding. 63(2):1996;251-272.
    • (1996) Computer Vision and Image Understanding , vol.63 , Issue.2 , pp. 251-272
    • Barequet, G.1    Sharir, M.2


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