This paper describes algorithms for computing global accessibility cones for each face (i.e., the set of directions from which faces are accessible) on 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 on the object. By utilizing the algorithm to compute the exact inaccessibility region for a face, we present algorithms for computing global accessibility cones for each face on the object. These global accessibility cones are represented as a matrix structure and can be used to support a wide variety of accessibility queries for the object.
Algorithms for Computing Global Accessibility Cones
Contributed by the Computer-Aided Product Development (CAPD) Committee for publication in the JOURNAL OF COMPUTING AND INFORMATION SCIENCE IN ENGINEERING. Manuscript received Jul. 2002; revised Jul. 2003. Associate Editor: P. Wright.
- Views Icon Views
- Share Icon Share
- Cite Icon Cite
- Search Site
Dhaliwal , S., Gupta, S. K., Huang , J., and Priyadarshi, A. (September 16, 2003). "Algorithms for Computing Global Accessibility Cones ." ASME. J. Comput. Inf. Sci. Eng. September 2003; 3(3): 200–209. https://doi.org/10.1115/1.1606475
Download citation file:
- Ris (Zotero)
- Reference Manager