Name
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. |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1016/0925-7721(92)90009-H | Computational Geometry: Theory and Applications |
Keywords | DocType | Volume |
lifting equipment,three dimensional,rods,binary trees,computer graphic,layout,computational geometry,combinatorial geometry,computer graphics,lines,sorting | Journal | 1 |
Issue | ISSN | Citations |
6 | Computational Geometry: Theory and Applications | 29 |
PageRank | References | Authors |
2.50 | 10 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bernard Chazelle | 1 | 6848 | 814.04 |
| Herbert Edelsbrunner | 2 | 6787 | 1112.29 |
| Leonidas J. Guibas | 3 | 13084 | 1262.73 |
| Richard Pollack | 4 | 912 | 203.75 |
| Raimund Seidel | 5 | 29 | 2.50 |
| Micha Sharir | 6 | 8405 | 1183.84 |
| Jack Snoeyink | 7 | 2842 | 231.68 |