Name
Abstract | ||
|---|---|---|
A new technique is developed for displaying disjoint convex polyhedra. The method has the following properties: It is output-sensitive, displays the objects in scanline mode, and it is naturally robust. There is no complex data structure uniting the different polyhedra, so dynamic insertions and deletions are simple. Its robustnes is based on a novel method of comparing depths by representative "axes" of objects instead of surfaces. The method is based on two extensions of the "critical-points" method for polygon scan conversion: One extension allows the efficient display of planar graphs in scanline mode, and another extension is into the third dimension. Test runs indicate that it compares extremely favorably with other methods that operate in scanline mode, as well as with standard software and hardware techniques of medium-level workstations. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1111/1467-8659.00553 | COMPUTER GRAPHICS FORUM |
Keywords | Field | DocType |
convex polyhedra, scanline mode, robustness, output-sensitive, critical points, scan conversion, planar graph | Disjoint sets,Scan conversion,Computer science,Polyhedron,Robustness (computer science),Artificial intelligence,Scan line,Computer vision,Topology,Polygon,Algorithm,Regular polygon,Planar graph | Journal |
Volume | Issue | ISSN |
20 | 4 | 0167-7055 |
Citations | PageRank | References |
0 | 0.34 | 10 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ella Barkan | 1 | 15 | 5.15 |
| Dan Gordon | 2 | 12 | 2.13 |