Counting and cutting cycles of lines and rods in space

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

Research output: Contribution to journalConference articlepeer-review

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.

Original languageEnglish
Pages (from-to)242-251
Number of pages10
JournalIEEE Transactions on Industry Applications
Volume27
Issue number1 pt 1
StatePublished - Jan 1991
Externally publishedYes
Event1989 Industry Applications Society Annual Meeting - San Diego, CA, USA
Duration: 1 Oct 19895 Oct 1989

Fingerprint

Dive into the research topics of 'Counting and cutting cycles of lines and rods in space'. Together they form a unique fingerprint.

Cite this