• DocumentCode
    274346
  • Title

    Counting and cutting cycles of lines and rods in space

  • Author

    Chazelle, Bernard ; Edelsbrunner, Herbert ; Guibas, Leonidas J. ; Pollack, Richard ; Seidel, Raimund ; Sharir, Micha ; Snoeyink, Jack

  • Author_Institution
    Dept. of Comput. Sci., Princeton Univ., NJ, USA
  • fYear
    1990
  • fDate
    22-24 Oct 1990
  • Firstpage
    242
  • Abstract
    A number of rendering algorithms in computer graphics sort three-dimensional objects by depth and assume that there is no cycle that makes the sorting impossible. One way to resolve the problem caused by cycles is to cut the objects into smaller pieces. The problem of estimating how many such cuts are always sufficient is addressed. A few related algorithmic and combinatorial geometry problems are considered
  • Keywords
    computational geometry; computer graphics; sorting; combinatorial geometry; computer graphics; cutting cycles; lines; rendering algorithms; rods; sorting; three-dimensional objects; Binary trees; Computational geometry; Computer graphics; Layout; Lifting equipment; Partitioning algorithms; Rendering (computer graphics); Sorting;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on
  • Conference_Location
    St. Louis, MO
  • Print_ISBN
    0-8186-2082-X
  • Type

    conf

  • DOI
    10.1109/FSCS.1990.89543
  • Filename
    89543
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=274346