메뉴 건너뛰기




Volumn 4698 LNCS, Issue , 2007, Pages 669-680

Exact minkowksi sums of polyhedra and exact and efficient decomposition of polyhedra in convex pieces

Author keywords

[No Author keywords available]

Indexed keywords

MOTION PLANNING; OPTIMIZATION; PROBLEM SOLVING; THREE DIMENSIONAL;

EID: 38049013361     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75520-3_59     Document Type: Conference Paper
Times cited : (21)

References (20)
  • 1
    • 31244436999 scopus 로고    scopus 로고
    • Agarwal, P.K., Flato, E., Halperin, D.: Polygon decomposition for efficient construction of Minkowski sums. Comp. Geom.: Theory and Appl. 21, 39-61 (2002)
    • Agarwal, P.K., Flato, E., Halperin, D.: Polygon decomposition for efficient construction of Minkowski sums. Comp. Geom.: Theory and Appl. 21, 39-61 (2002)
  • 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(3), 488-507 (1984)
    • (1984) SIAM Journal on Computing , vol.13 , Issue.3 , pp. 488-507
    • Chazelle, B.1
  • 5
    • 0000957907 scopus 로고    scopus 로고
    • Strategies for polyhedral surface decomposition: An experimental study
    • Chazelle, B., Dobkin, D., Shouraboura, N., Tal, A.: Strategies for polyhedral surface decomposition: an experimental study. Comput. Geom. Theory Appl. 7(5-6), 327-342 (1997)
    • (1997) Comput. Geom. Theory Appl , vol.7 , Issue.5-6 , pp. 327-342
    • Chazelle, B.1    Dobkin, D.2    Shouraboura, N.3    Tal, A.4
  • 7
    • 0035801068 scopus 로고    scopus 로고
    • Accurate and fast proximity queries between polyhedra using convex surface decomposition
    • Ehrnann, S.A., Lin, M.C.: Accurate and fast proximity queries between polyhedra using convex surface decomposition. In: Comp. Graph. Forum (Proc. Eurographics 2001), vol. 20(3), pp. 500-510 (2001)
    • (2001) Comp. Graph. Forum (Proc. Eurographics , vol.20 , Issue.3 , pp. 500-510
    • Ehrnann, S.A.1    Lin, M.C.2
  • 11
    • 84867969517 scopus 로고    scopus 로고
    • Hachenberger, P., Kettner, L., Mehlhorn, K.: Boolean operations on 3D selective Nef complexes: Data structure, algorithms, optimized implementation and experiments. Comp. Geometry: Theory and Applications 38(1-2), 64-99 (2007)
    • Hachenberger, P., Kettner, L., Mehlhorn, K.: Boolean operations on 3D selective Nef complexes: Data structure, algorithms, optimized implementation and experiments. Comp. Geometry: Theory and Applications 38(1-2), 64-99 (2007)
  • 12
    • 0026226275 scopus 로고
    • A software package for the generation of meshes using geometric algorithms
    • Joe, B.: A software package for the generation of meshes using geometric algorithms. Advances in Engineering Software and Workstations 13(5-6), 325-331 (1991)
    • (1991) Advances in Engineering Software and Workstations , vol.13 , Issue.5-6 , pp. 325-331
    • Joe, B.1
  • 13
    • 0026461546 scopus 로고
    • Solid-interpolating deformations: Construction and animation of pips
    • Kaul, A., Rossignac, J.: Solid-interpolating deformations: Construction and animation of pips. Computers & Graphics 16(1), 107-115 (1992)
    • (1992) Computers & Graphics , vol.16 , Issue.1 , pp. 107-115
    • Kaul, A.1    Rossignac, J.2
  • 15
    • 0003896351 scopus 로고
    • Kluwer Academic Publishers, Norwell, MA, USA
    • Latombe, J.-C.: Robot Motion Planning. Kluwer Academic Publishers, Norwell, MA, USA (1991)
    • (1991) Robot Motion Planning
    • Latombe, J.-C.1
  • 18
    • 0003062048 scopus 로고    scopus 로고
    • Extraction of feature lines on triangulated surfaces using morphological operators
    • AAAI Symp, 2000
    • Rossi, C., Kobbelt, L., Seidel, H.-P.: Extraction of feature lines on triangulated surfaces using morphological operators. In: Proc. of the 2000 AAAI Symp. (2000)
    • (2000) Proc. of the
    • Rossi, C.1    Kobbelt, L.2    Seidel, H.-P.3
  • 19
    • 17444395597 scopus 로고    scopus 로고
    • Accurate Minkowski sum approximation of polyhedral models
    • IEEE Computer Society Press, Los Alamitos
    • Varadhan, G., Manocha, D.: Accurate Minkowski sum approximation of polyhedral models. In: Proc. Comp. Graphics and Appl., 12th Pacific Conf. on (PG'04), pp. 392-401. IEEE Computer Society Press, Los Alamitos (2004)
    • (2004) Proc. Comp. Graphics and Appl., 12th Pacific Conf. on (PG'04) , pp. 392-401
    • Varadhan, G.1    Manocha, D.2
  • 20
    • 33750715105 scopus 로고    scopus 로고
    • Wein, R.: Exact and efficient construction of planar Minkowski sums using the convolution method. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, 4168, pp. 829-840. Springer, Heidelberg (2006)
    • Wein, R.: Exact and efficient construction of planar Minkowski sums using the convolution method. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 829-840. Springer, Heidelberg (2006)


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