메뉴 건너뛰기




Volumn 2005, Issue , 2005, Pages 326-331

Fast processing of triangle meshes using triangle fans

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; COMPUTATIONAL METHODS; FANS; RAY TRACING;

EID: 33846106717     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SMI.2005.20     Document Type: Conference Paper
Times cited : (8)

References (16)
  • 3
    • 84976826673 scopus 로고
    • Voronoï Diagrams: A Survey of a Fundamental Geometric Data Structure
    • F. Aurenhammer. Voronoï Diagrams: a Survey of a Fundamental Geometric Data Structure. ACM Computing Surveys, 23, 345-405, 1991.
    • (1991) ACM Computing Surveys , vol.23 , pp. 345-405
    • Aurenhammer, F.1
  • 4
    • 84944057155 scopus 로고
    • An Efficient Ray-Polygon Intersection
    • Academic Press
    • D. Badouel. An Efficient Ray-Polygon Intersection. Graphics Gems, Academic Press, 390-393, 1990.
    • (1990) Graphics Gems , pp. 390-393
    • Badouel, D.1
  • 5
    • 84902947554 scopus 로고    scopus 로고
    • Geometric Tools for Computer Graphics
    • ISBN 1-55860-594-0
    • P. Schneider and D. Eberly. Geometric Tools for Computer Graphics. Morgan Kaufmann, ISBN 1-55860-594-0, 2003.
    • (2003) Morgan Kaufmann
    • Schneider, P.1    Eberly, D.2
  • 6
    • 0023998710 scopus 로고
    • A Fast Procedure for Computing the Distance Between Complex Objects in Three Dimensional Space
    • E.G. Gilbert, D.W. Johnson and S.S. Keerthi. A Fast Procedure for Computing the Distance Between Complex Objects in Three Dimensional Space. IEEE Journal of Robotics and Automation, 4 (2), 1988.
    • (1988) IEEE Journal of Robotics and Automation , vol.4 , Issue.2
    • Gilbert, E.G.1    Johnson, D.W.2    Keerthi, S.S.3
  • 7
    • 0035030533 scopus 로고    scopus 로고
    • MeshSweeper: Dynamic Point-to-Polygonal-Mesh Distance and Applications
    • A. Gueziec. MeshSweeper: Dynamic Point-to-Polygonal-Mesh Distance and Applications. IEEE Transactions on Visualization and Computer Graphics, 7(1), 47-61, 2001.
    • (2001) IEEE Transactions on Visualization and Computer Graphics , vol.7 , Issue.1 , pp. 47-61
    • Gueziec, A.1
  • 8
    • 0002196757 scopus 로고
    • Point in Polygon Strategies
    • Academic Press
    • E. Haines. Point in Polygon Strategies. Graphics Gems IV, Academic Press, 24-46, 1994.
    • (1994) Graphics Gems , vol.4 , pp. 24-46
    • Haines, E.1
  • 10
    • 33846044857 scopus 로고    scopus 로고
    • A fast algorithm for computing the closest point and distance transform
    • S. Mauch. A fast algorithm for computing the closest point and distance transform. SIAM Journal on Scientific Computing, 2003.
    • (2003) SIAM Journal on Scientific Computing
    • Mauch, S.1
  • 11
    • 0001773799 scopus 로고    scopus 로고
    • Fast, Minimum Storage Ray-Triangle Intersection
    • T. Möller and B. Trumbore. Fast, Minimum Storage Ray-Triangle Intersection. Journal of Graphic Tools, 2(1), 21-28, 1997.
    • (1997) Journal of Graphic Tools , vol.2 , Issue.1 , pp. 21-28
    • Möller, T.1    Trumbore, B.2
  • 15
    • 85040889046 scopus 로고
    • The design and Analysis of Spatial Data Structures
    • H. Samet. The design and Analysis of Spatial Data Structures. Addison-Wesley, 1989.
    • (1989) Addison-Wesley
    • Samet, H.1
  • 16
    • 1442278652 scopus 로고    scopus 로고
    • An Efficient Rejection Test for Ray Triangle Mesh Intersection
    • Z.-Y. Xu, Z.-S. Tang and L. Tang. An Efficient Rejection Test for Ray Triangle Mesh Intersection. Journal of Software., 14(10), 1787-1795, 2003.
    • (2003) Journal of Software , vol.14 , Issue.10 , pp. 1787-1795
    • Xu, Z.-Y.1    Tang, Z.-S.2    Tang, L.3


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