메뉴 건너뛰기




Volumn Part F129372, Issue , 1995, Pages 297-305

Strategies for polyhedral surface decomposition: An experimental study

Author keywords

[No Author keywords available]

Indexed keywords


EID: 85022119322     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/220279.220311     Document Type: Conference Paper
Times cited : (36)

References (19)
  • 1
    • 0000925758 scopus 로고
    • Triangles in space or building (and analyzing) castles in the air
    • Aronov, B., Sharir, M. Triangles in space or building (and analyzing) castles in the air, Com-binatorica, 10(1990), 137-173.
    • (1990) Com-binatorica , vol.10 , pp. 137-173
    • Aronov, B.1    Sharir, M.2
  • 2
    • 0026998103 scopus 로고
    • Castles in the air revisited
    • To appear in Disc. Comput. Geom
    • Aronov, B., Sharir, M. Castles in the air revisited, Proc. 8th Ann. ACM Symp. Comput. Geom. (1992), 146-156. To appear in Disc. Comput. Geom.
    • (1992) Proc. 8th Ann. ACM Symp. Comput. Geom , pp. 146-156
    • Aronov, B.1    Sharir, M.2
  • 3
    • 0010896742 scopus 로고
    • Autodesk, Inc. Publication
    • AutoCAD Reference Manual, Autodesk, Inc. Publication 100625 (1992).
    • (1992) AutoCAD Reference Manual , pp. 100625
  • 4
    • 0000963270 scopus 로고
    • Convex decompositions of polyhedra and robustness
    • Bajaj, C. L., Dey, T. K. Convex decompositions of polyhedra and robustness, SIAM J. Comput., 21(1992), 339-364.
    • (1992) SIAM J. Comput. , vol.21 , pp. 339-364
    • Bajaj, C.L.1    Dey, T.K.2
  • 6
    • 0001914423 scopus 로고
    • Mesh generation and optimal triangulation
    • World Scientific, ed. D. Z. Du and F. K. Hwang
    • Bern, M., Eppstein, D. Mesh generation and optimal triangulation, in: Computing in Euclidean Geometry, 1, World Scientific, ed. D. Z. Du and F. K. Hwang (1992), 23-90.
    • (1992) Computing in Euclidean Geometry , vol.1 , pp. 23-90
    • Bern, M.1    Eppstein, D.2
  • 8
    • 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 J. Comput., 13(1984), 488-507.
    • (1984) SIAM J. Comput. , vol.13 , pp. 488-507
    • Chazelle, B.1
  • 9
    • 0001516771 scopus 로고
    • Triangulating a noncon-vex polytope
    • Chazelle, B., Palios, L. Triangulating a noncon-vex polytope, Disc. Comput. Geom., 5(1990), 505-526.
    • (1990) Disc. Comput. Geom. , vol.5 , pp. 505-526
    • Chazelle, B.1    Palios, L.2
  • 10
    • 0000212958 scopus 로고
    • Decomposition algorithms in geometry
    • C. Bajaj, Ed., Chap. 27, Springer-Verlag
    • Chazelle, B., Palios, L. Decomposition algorithms in geometry, in Algebraic Geometry and its Applications, C. Bajaj, Ed., Chap. 27, Springer-Verlag, 1994, pp. 419-447.
    • (1994) Algebraic Geometry and its Applications , pp. 419-447
    • Chazelle, B.1    Palios, L.2
  • 13
  • 17
    • 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, Disc. Comput. Geom., 7(1992), 227-253.
    • (1992) Disc. Comput. Geom. , vol.7 , pp. 227-253
    • Ruppert, J.1    Seidel, R.2
  • 18
    • 84945391254 scopus 로고
    • On the form factor between two polygons
    • ACM Press
    • Schroder, P., Hanrahan, P. On the form factor between two polygons, Proc. SIGGRAPH 93, ACM Press (1993), 163-164.
    • (1993) Proc. SIGGRAPH 93 , pp. 163-164
    • Schroder, P.1    Hanrahan, P.2


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