메뉴 건너뛰기




Volumn 1619, Issue , 1999, Pages 114-128

Practical point-in-polygon tests using CSG representations of polygons

Author keywords

[No Author keywords available]

Indexed keywords

QUERY PROCESSING;

EID: 84978971009     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48518-x_7     Document Type: Conference Paper
Times cited : (7)

References (14)
  • 1
    • 0012063719 scopus 로고
    • Faster line segment intersection
    • David Kirk, editor, Academic Press, Boston, MA, USA
    • Franklin Antonio. Faster line segment intersection. In David Kirk, editor, Graphics Gems III, chapter 1.4, pages 199-202. Academic Press, Boston, MA, USA, 1992.
    • (1992) Graphics Gems III, chapter 1.4 , pp. 199-202
    • Antonio, F.1
  • 2
    • 84944057155 scopus 로고
    • An efficient ray-polygon intersection
    • Andrew S. Glassner, editor, Academic Press, Boston, MA
    • Didier Badouel. An efficient ray-polygon intersection. In Andrew S. Glassner, editor, Graphics Gems, pages 390-393. Academic Press, Boston, MA, 1990.
    • (1990) Graphics Gems , pp. 390-393
    • Badouel, D.1
  • 3
    • 0030246260 scopus 로고    scopus 로고
    • Improving the variable ordering of OBDDs is NP-complete
    • B. Bollig and I. Wegener. Improving the variable ordering of OBDDs is NP-complete. IEEE Transactions on Computers, 45(9):993-1002, 1996.
    • (1996) IEEE Transactions on Computers , vol.45 , Issue.9 , pp. 993-1002
    • Bollig, B.1    Wegener, I.2
  • 4
    • 0022769976 scopus 로고
    • Graph-based algorithms for Boolean function manipulation
    • August
    • Randal E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35(6):677-691, August 1986.
    • (1986) IEEE Transactions on Computers , vol.C-35 , Issue.6 , pp. 677-691
    • Bryant, R.E.1
  • 5
    • 0026913667 scopus 로고
    • Symbolic Boolean manipulation with ordered binary-decision diagrams
    • September
    • Randal E. Bryant. Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys, 24(3):293-318, September 1992.
    • (1992) ACM Computing Surveys , vol.24 , Issue.3 , pp. 293-318
    • Bryant, R.E.1
  • 6
    • 71649089719 scopus 로고
    • An efficient algorithm for finding the CSG representation of a simple polygon
    • John Dill, editor, August
    • David Dobkin, Leonidas Guibas, John Hershberger, and Jack Snoeyink. An efficient algorithm for finding the CSG representation of a simple polygon. In John Dill, editor, Computer Graphics (SIGGRAPH '88 Proceedings), volume 22, pages 31-40, August 1988.
    • (1988) Computer Graphics (SIGGRAPH '88 Proceedings) , vol.22 , pp. 31-40
    • Dobkin, D.1    Guibas, L.2    Hershberger, J.3    Snoeyink, J.4
  • 7
    • 84936148691 scopus 로고
    • Simple, fast triangle intersection
    • Chris Green. Simple, fast triangle intersection. Ray Tracing News, 6(1), 1993. ftp://ftp.princeton.edu/pub/Graphics/RTNews.
    • (1993) Ray Tracing News , vol.6 , Issue.1
    • Green, C.1
  • 8
    • 1942466899 scopus 로고
    • Certification of algorithm 112: Position of point relative to polygon
    • R. Hacker. Certification of algorithm 112: position of point relative to polygon. Communications of the ACM, 5:606, 1962.
    • (1962) Communications of the ACM , vol.5 , pp. 606
    • Hacker, R.1
  • 9
    • 0002196757 scopus 로고
    • Point in polygon strategies
    • Paul S. Heckbert, editor, chapter 1.4, Academic Press, Boston, MA, USA
    • Eric Haines. Point in polygon strategies. In Paul S. Heckbert, editor, Graphics Gems IV, chapter 1.4, pages 24-46. Academic Press, Boston, MA, USA, 1994.
    • (1994) Graphics Gems IV , pp. 24-46
    • Haines, E.1
  • 11
    • 1942531109 scopus 로고
    • Algorithm 112: Position of point relative to polygon
    • M. Shimrat. Algorithm 112: position of point relative to polygon. Communications of the ACM, 5:434, 1962.
    • (1962) Communications of the ACM , vol.5 , pp. 434
    • Shimrat, M.1
  • 12
    • 84971383995 scopus 로고
    • Ray tracing complex models containing surface tessellations
    • July
    • John M. Snyder and Alan H. Barr. Ray tracing complex models containing surface tessellations. Computer Graphics (SIGGRAPH '87 Proceedings), 21(4):119-128, July 1987.
    • (1987) Computer Graphics (SIGGRAPH '87 Proceedings) , vol.21 , Issue.4 , pp. 119-128
    • Snyder, J.M.1    Barr, A.H.2
  • 13
    • 84979022511 scopus 로고
    • Simple, fast triangle intersection, part II
    • John Spackman. Simple, fast triangle intersection, part II. Ray Tracing News, 6(2), 1993. ftp://ftp.princeton.edu/pub/Graphics/RTNews.
    • (1993) Ray Tracing News , vol.6 , Issue.2
    • Spackman, J.1


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