Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5609Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Ponce, Jean | - |
| dc.date | 2004-10-01T20:10:44Z | - |
| dc.date | 2004-10-01T20:10:44Z | - |
| dc.date | 1985-04-01 | - |
| dc.date.accessioned | 2013-10-09T02:40:17Z | - |
| dc.date.available | 2013-10-09T02:40:17Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | AIM-838 | - |
| dc.identifier | http://hdl.handle.net/1721.1/5609 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | Computing surface and/or object intersections is a cornerstone of many algorithms in Geometric Modeling and Computer Graphics, for example Set Operations between solids, or surface Ray Casting display. We present an object centered, information preserving, hierarchical representation for polyhedra called Prism Tree. We use the representation to decompose the intersection algorithms into two steps: the localization of intersections, and their processing. When dealing with polyhedra with many faces (typically more than one thousand), the first step is by far the most expensive. The Prism Tree structure is used to compute efficiently this localization step. A preliminary implementation of the Set Operations and Ray casting algorithms has been constructed. | - |
| dc.format | 22 p. | - |
| dc.format | 4182111 bytes | - |
| dc.format | 3268314 bytes | - |
| dc.format | application/postscript | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.relation | AIM-838 | - |
| dc.subject | computer graphics | - |
| dc.subject | hierarchical structures | - |
| dc.subject | set operations betweenssolids | - |
| dc.subject | geometric modelling | - |
| dc.subject | ray casting display. | - |
| dc.title | Prism Trees: An Efficient Representation for Manipulating and Displaying Polyhedra with Many Faces | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.