Algorithms for Computing Global Accessibility Cones

dc.contributor.authorDhaliwal, Savinderen_US
dc.contributor.authorGupta, Satyandra K.en_US
dc.contributor.authorHuang, Junen_US
dc.contributor.authorPriyadarshi, Aloken_US
dc.contributor.departmentISRen_US
dc.date.accessioned2007-05-23T10:12:02Z
dc.date.available2007-05-23T10:12:02Z
dc.date.issued2002en_US
dc.description.abstractThis 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.extent204791 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/6269
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 2002-30en_US
dc.subjectNext-Generation Product Realization Systemsen_US
dc.titleAlgorithms for Computing Global Accessibility Conesen_US
dc.typeTechnical Reporten_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
TR_2002-30.pdf
Size:
199.99 KB
Format:
Adobe Portable Document Format