Algorithms for Computing Global Accessibility Cones
dc.contributor.author | Dhaliwal, Savinder | en_US |
dc.contributor.author | Gupta, Satyandra K. | en_US |
dc.contributor.author | Huang, Jun | en_US |
dc.contributor.author | Priyadarshi, Alok | en_US |
dc.contributor.department | ISR | en_US |
dc.date.accessioned | 2007-05-23T10:12:02Z | |
dc.date.available | 2007-05-23T10:12:02Z | |
dc.date.issued | 2002 | en_US |
dc.description.abstract | This paper describes algorithms for computing global accessibility cones for various faces (i.e., the set of directions from which faces are accessible) in a polyhedral object. We describe exact mathematical conditions and the associated algorithm for determining the set of directions from which a planar face with triangular boundary is inaccessible due to another face in the object. By utilizing the algorithm to compute the exact inaccessibility region for a face, we present algorithms for computing global accessibility cones for various faces in the object. These global accessibility cones are represented in a matrix structure and can be used to support a wide variety of accessibility queries for the object. We provide several examples to show computational performance of our algorithm. | en_US |
dc.format.extent | 204791 bytes | |
dc.format.mimetype | application/pdf | |
dc.identifier.uri | http://hdl.handle.net/1903/6269 | |
dc.language.iso | en_US | en_US |
dc.relation.ispartofseries | ISR; TR 2002-30 | en_US |
dc.subject | Next-Generation Product Realization Systems | en_US |
dc.title | Algorithms for Computing Global Accessibility Cones | en_US |
dc.type | Technical Report | en_US |
Files
Original bundle
1 - 1 of 1