Faster Phong shading via angular interpolation:
Gespeichert in:
| Beteiligte Personen: | , |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Amsterdam
1989
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
89,9 |
| Schlagwörter: | |
| Abstract: | Abstract: "One of the most successful algorithms that brought realism in the world of 3D image generation is Phong shading. It is an algorithm for smooth shading meshes of planar polygons used to represent curved surfaces. The level of realism and depth perception that can be obtained by Phong shading is attractive for 3D CAD applications. However, too high per pixel computation costs and/or artifacts, introduced by some of the more efficient evaluation methods and apparent only when displaying moving objects, are major factors that blocked the common usage of Phong shading in highly interactive applications. In this paper we present angular interpolation for Phong shading planar polygons. Angular interpolation appears to be an efficient method that reduces artifacts when displaying moving objects. Ideally a shading algorithm imposes no need for subdivision of patches as presented by the solid modelling system Shading calculation via angular interpolation yields such an ideal algorithm. We will describe two alternative evaluation methods that trade off evaluation cost against level of accuracy. They both can handle light source and view point at arbitrary distances, but differ in level of accuracy. As a consequence these alternative evaluation methods do impose restrictions on the topology of patches and light sources. Generally, the limitations imposed by these alternative shading methods are much more liberal than the limitations on patch size imposed by the geometry. The most economic evaluation method presented can incrementally compute the colour intensity along a scanline by two additions per pixel. The methods presented are generally applicable and can easily be implemented in hardware. |
| Umfang: | 18 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009245988 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t| | ||
| 008 | 940313s1989 xx |||| 00||| eng d | ||
| 035 | |a (OCoLC)20959362 | ||
| 035 | |a (DE-599)BVBBV009245988 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Kuijk, Alphonsus A. M. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Faster Phong shading via angular interpolation |c A. A. M. Kuijk, E. H. Blake |
| 264 | 1 | |a Amsterdam |c 1989 | |
| 300 | |a 18 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |v 89,9 | |
| 520 | 3 | |a Abstract: "One of the most successful algorithms that brought realism in the world of 3D image generation is Phong shading. It is an algorithm for smooth shading meshes of planar polygons used to represent curved surfaces. The level of realism and depth perception that can be obtained by Phong shading is attractive for 3D CAD applications. However, too high per pixel computation costs and/or artifacts, introduced by some of the more efficient evaluation methods and apparent only when displaying moving objects, are major factors that blocked the common usage of Phong shading in highly interactive applications. In this paper we present angular interpolation for Phong shading planar polygons. Angular interpolation appears to be an efficient method that reduces artifacts when displaying moving objects. Ideally a shading algorithm imposes no need for subdivision of patches as presented by the solid modelling system | |
| 520 | 3 | |a Shading calculation via angular interpolation yields such an ideal algorithm. We will describe two alternative evaluation methods that trade off evaluation cost against level of accuracy. They both can handle light source and view point at arbitrary distances, but differ in level of accuracy. As a consequence these alternative evaluation methods do impose restrictions on the topology of patches and light sources. Generally, the limitations imposed by these alternative shading methods are much more liberal than the limitations on patch size imposed by the geometry. The most economic evaluation method presented can incrementally compute the colour intensity along a scanline by two additions per pixel. The methods presented are generally applicable and can easily be implemented in hardware. | |
| 650 | 4 | |a Approximation theory | |
| 650 | 4 | |a Computer graphics | |
| 650 | 4 | |a Image processing | |
| 700 | 1 | |a Blake, E. H. |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 89,9 |w (DE-604)BV008928356 |9 89,9 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-006152327 | |
Datensatz im Suchindex
| _version_ | 1818951470251245568 |
|---|---|
| any_adam_object | |
| author | Kuijk, Alphonsus A. M. Blake, E. H. |
| author_facet | Kuijk, Alphonsus A. M. Blake, E. H. |
| author_role | aut aut |
| author_sort | Kuijk, Alphonsus A. M. |
| author_variant | a a m k aam aamk e h b eh ehb |
| building | Verbundindex |
| bvnumber | BV009245988 |
| ctrlnum | (OCoLC)20959362 (DE-599)BVBBV009245988 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02821nam a2200337 cb4500</leader><controlfield tag="001">BV009245988</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">940313s1989 xx |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)20959362</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009245988</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kuijk, Alphonsus A. M.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Faster Phong shading via angular interpolation</subfield><subfield code="c">A. A. M. Kuijk, E. H. Blake</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">18 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS</subfield><subfield code="v">89,9</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "One of the most successful algorithms that brought realism in the world of 3D image generation is Phong shading. It is an algorithm for smooth shading meshes of planar polygons used to represent curved surfaces. The level of realism and depth perception that can be obtained by Phong shading is attractive for 3D CAD applications. However, too high per pixel computation costs and/or artifacts, introduced by some of the more efficient evaluation methods and apparent only when displaying moving objects, are major factors that blocked the common usage of Phong shading in highly interactive applications. In this paper we present angular interpolation for Phong shading planar polygons. Angular interpolation appears to be an efficient method that reduces artifacts when displaying moving objects. Ideally a shading algorithm imposes no need for subdivision of patches as presented by the solid modelling system</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Shading calculation via angular interpolation yields such an ideal algorithm. We will describe two alternative evaluation methods that trade off evaluation cost against level of accuracy. They both can handle light source and view point at arbitrary distances, but differ in level of accuracy. As a consequence these alternative evaluation methods do impose restrictions on the topology of patches and light sources. Generally, the limitations imposed by these alternative shading methods are much more liberal than the limitations on patch size imposed by the geometry. The most economic evaluation method presented can incrementally compute the colour intensity along a scanline by two additions per pixel. The methods presented are generally applicable and can easily be implemented in hardware.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Approximation theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer graphics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Image processing</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Blake, E. H.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Report CS</subfield><subfield code="t">Centrum voor Wiskunde en Informatica <Amsterdam></subfield><subfield code="v">89,9</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">89,9</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006152327</subfield></datafield></record></collection> |
| id | DE-604.BV009245988 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T09:34:59Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006152327 |
| oclc_num | 20959362 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 18 S. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Kuijk, Alphonsus A. M. Verfasser aut Faster Phong shading via angular interpolation A. A. M. Kuijk, E. H. Blake Amsterdam 1989 18 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 89,9 Abstract: "One of the most successful algorithms that brought realism in the world of 3D image generation is Phong shading. It is an algorithm for smooth shading meshes of planar polygons used to represent curved surfaces. The level of realism and depth perception that can be obtained by Phong shading is attractive for 3D CAD applications. However, too high per pixel computation costs and/or artifacts, introduced by some of the more efficient evaluation methods and apparent only when displaying moving objects, are major factors that blocked the common usage of Phong shading in highly interactive applications. In this paper we present angular interpolation for Phong shading planar polygons. Angular interpolation appears to be an efficient method that reduces artifacts when displaying moving objects. Ideally a shading algorithm imposes no need for subdivision of patches as presented by the solid modelling system Shading calculation via angular interpolation yields such an ideal algorithm. We will describe two alternative evaluation methods that trade off evaluation cost against level of accuracy. They both can handle light source and view point at arbitrary distances, but differ in level of accuracy. As a consequence these alternative evaluation methods do impose restrictions on the topology of patches and light sources. Generally, the limitations imposed by these alternative shading methods are much more liberal than the limitations on patch size imposed by the geometry. The most economic evaluation method presented can incrementally compute the colour intensity along a scanline by two additions per pixel. The methods presented are generally applicable and can easily be implemented in hardware. Approximation theory Computer graphics Image processing Blake, E. H. Verfasser aut Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 89,9 (DE-604)BV008928356 89,9 |
| spellingShingle | Kuijk, Alphonsus A. M. Blake, E. H. Faster Phong shading via angular interpolation Approximation theory Computer graphics Image processing |
| title | Faster Phong shading via angular interpolation |
| title_auth | Faster Phong shading via angular interpolation |
| title_exact_search | Faster Phong shading via angular interpolation |
| title_full | Faster Phong shading via angular interpolation A. A. M. Kuijk, E. H. Blake |
| title_fullStr | Faster Phong shading via angular interpolation A. A. M. Kuijk, E. H. Blake |
| title_full_unstemmed | Faster Phong shading via angular interpolation A. A. M. Kuijk, E. H. Blake |
| title_short | Faster Phong shading via angular interpolation |
| title_sort | faster phong shading via angular interpolation |
| topic | Approximation theory Computer graphics Image processing |
| topic_facet | Approximation theory Computer graphics Image processing |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT kuijkalphonsusam fasterphongshadingviaangularinterpolation AT blakeeh fasterphongshadingviaangularinterpolation |