메뉴 건너뛰기




Volumn , Issue , 2002, Pages 60-69

Efficient distance computation for quadratic curves and surfaces

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER AIDED DESIGN; GEOMETRY;

EID: 84963836273     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GMAP.2002.1027497     Document Type: Conference Paper
Times cited : (44)

References (11)
  • 1
    • 85010519644 scopus 로고
    • An efficient algorithm for the sparse mixed resultant
    • Proc. Intern. Symp.Applied Algebra, Algebraic Algor. and Error-Corr. Codes
    • J. Canny and I. Emiris. An efficient algorithm for the sparse mixed resultant. In Proc. Intern. Symp.Applied Algebra, Algebraic Algor. and Error-Corr. Codes, volume 263 of Lecture Notes in Computer Science., pages 89-104, 1993.
    • (1993) Lecture Notes in Computer Science , vol.263 , pp. 89-104
    • Canny, J.1    Emiris, I.2
  • 3
    • 0011717680 scopus 로고    scopus 로고
    • Accurate and fast proximity queries between polyhedra using surface decomposition
    • S. Ehmann and M. Lin. Accurate and fast proximity queries between polyhedra using surface decomposition. In Computer Graphics Forum (Proc. Eurographics), 2001.
    • (2001) Computer Graphics Forum (Proc. Eurographics)
    • Ehmann, S.1    Lin, M.2
  • 4
    • 0024703677 scopus 로고
    • Automatic parsing of degenerate quadric-surface intersection
    • R. Farouki, C. Neff, and M. O'Connor. Automatic parsing of degenerate quadric-surface intersection. ACM Transactions on Graphics, 8(3):174-203, 1989.
    • (1989) ACM Transactions on Graphics , vol.8 , Issue.3 , pp. 174-203
    • Farouki, R.1    Neff, C.2    O'Connor, M.3
  • 5
    • 0023998710 scopus 로고
    • A fast procedure for computing the distance between complex objects in 3d space
    • E. Gilbert, D. Johnson, and S. Keerthi. A fast procedure for computing the distance between complex objects in 3d space. IEEE Journ. of Robot. Autom., 4(2):193-203, 1988.
    • (1988) IEEE Journ. of Robot. Autom. , vol.4 , Issue.2 , pp. 193-203
    • Gilbert, E.1    Johnson, D.2    Keerthi, S.3
  • 7
    • 0017006445 scopus 로고
    • A parametric algorithm for drawing pictures of solid objects composed of quadric surfaces
    • J. Levin. A parametric algorithm for drawing pictures of solid objects composed of quadric surfaces. Commun. ACM, 19(10):555-563, 1976.
    • (1976) Commun. ACM , vol.19 , Issue.10 , pp. 555-563
    • Levin, J.1
  • 8
    • 0025724612 scopus 로고
    • Efficient algorithms for incremental distance computation
    • M. C. Lin and J. F. Canny. Efficient algorithms for incremental distance computation. In Proc. IEEE Internat. Conf. Robot. Autom., volume 2, pages 1008-1014, 1991.
    • (1991) Proc. IEEE Internat. Conf. Robot. Autom. , vol.2 , pp. 1008-1014
    • Lin, M.C.1    Canny, J.F.2
  • 11
    • 0031642994 scopus 로고    scopus 로고
    • Computing distances between nurbs-defined convex objects
    • C. Turnbull and S. Cameron. Computing distances between nurbs-defined convex objects. In IEEE Int. Conf. of Robot. Autom., pages 3686-3690, 1998.
    • (1998) IEEE Int. Conf. of Robot. Autom. , pp. 3686-3690
    • Turnbull, C.1    Cameron, S.2


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