{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T02:09:21Z","timestamp":1774058961805,"version":"3.50.1"},"reference-count":17,"publisher":"ASME International","issue":"3","content-domain":{"domain":["asmedigitalcollection.asme.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2003,9,1]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.1115\/1.1606475","type":"journal-article","created":{"date-parts":[[2003,9,18]],"date-time":"2003-09-18T22:54:57Z","timestamp":1063925697000},"page":"200-209","update-policy":"https:\/\/doi.org\/10.1115\/crossmarkpolicy-asme","source":"Crossref","is-referenced-by-count":43,"title":["Algorithms for Computing Global Accessibility Cones"],"prefix":"10.1115","volume":"3","author":[{"given":"Savinder","family":"Dhaliwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satyandra K.","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alok","family":"Priyadarshi","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD 20742"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"33","published-online":{"date-parts":[[2003,9,16]]},"reference":[{"key":"2019100611035811600_r1","doi-asserted-by":"crossref","unstructured":"Kang, J. K., and Suh, S. H., 1997, \u201cMachinability and Set-Up Orientation for Five-Axis Numerically Controlled Machining of Free Surfaces,\u201d International Journal of Advanced Manufacturing Technology, 13, pp. 311\u2013325.","DOI":"10.1007\/BF01178251"},{"key":"2019100611035811600_r2","doi-asserted-by":"crossref","unstructured":"Suh, S. H., and Kang, J. K., 1995, \u201cProcess Planning for Multi-Axis NC Machining of Free Surfaces,\u201d Int. J. Prod. Res., 33(10), pp. 2723\u20132738.","DOI":"10.1080\/00207549508904841"},{"key":"2019100611035811600_r3","doi-asserted-by":"crossref","unstructured":"Balasubramaniam, M., Laxmiprasad, P., Sarma, S., and Shaikh, Z., 2000, \u201cGenerating 5-Axis NC Roughing Paths Directly From a Tessellated Representation,\u201d Comput.-Aided Des., 32, pp. 261\u2013277.","DOI":"10.1016\/S0010-4485(99)00103-7"},{"key":"2019100611035811600_r4","doi-asserted-by":"crossref","unstructured":"Chen, L. L., Chou, S. Y., and Woo, T. C., 1993, \u201cParting Directions for Mould and Die Design,\u201d Comput.-Aided Des., 25, pp. 763\u2013767.","DOI":"10.1016\/0010-4485(93)90103-U"},{"key":"2019100611035811600_r5","doi-asserted-by":"crossref","unstructured":"Dhaliwal, S., Gupta, S. K., Huang, J., and Kumar, M., 2001, \u201cA Feature Based Approach to Automated Design of Multi-Piece Sacrificial Molds,\u201d ASME J. Comput. Inf. Sci Eng., 1(3), pp. 225\u2013234.","DOI":"10.1115\/1.1419195"},{"key":"2019100611035811600_r6","doi-asserted-by":"crossref","unstructured":"Weinstein, M., and Manoochehri, S., 1997, \u201cOptimum Parting Line Design of Molded and Cast Parts for Manufacturability,\u201d J. Manuf. Syst., 16(1), pp. 1\u201311.","DOI":"10.1016\/S0278-6125(97)88401-4"},{"key":"2019100611035811600_r7","doi-asserted-by":"crossref","unstructured":"Spitz, S. N., Spyridi, A. J., and Requicha, A. A. G., 1999, \u201cAccessibility Analysis for Planning of Dimensional Inspection With Coordinate Measuring Machines,\u201d IEEE Trans. Rob. Autom., 15(4), pp. 714\u2013727, 1042-296X.","DOI":"10.1109\/70.782025"},{"key":"2019100611035811600_r8","doi-asserted-by":"crossref","unstructured":"Woo, T. C. , 1994, \u201cVisibility Maps and Spherical Algorithms,\u201d Comput.-Aided Des., 26(1), pp. 6-1.","DOI":"10.1016\/0010-4485(94)90003-5"},{"key":"2019100611035811600_r9","doi-asserted-by":"crossref","unstructured":"Kim, D. S., Papalambros, P. Y., and Woo, T. C., 1995, \u201cTangent, Normal, and Visibility Cones on Be\u00b4zier Surfaces,\u201d Comput. Aided Geom. Des., 12, pp. 305\u2013320.","DOI":"10.1016\/0167-8396(94)00016-L"},{"key":"2019100611035811600_r10","doi-asserted-by":"crossref","unstructured":"Elber, G., and Cohen, E., 1995, \u201cArbitrarily Precise Computation of Gauss Maps and Visibility Sets for Freeform Surfaces,\u201d in Proceedings of 3th Symposium on Solid Modeling and Applications, May, Salt Lake City, Utah.","DOI":"10.1145\/218013.218073"},{"key":"2019100611035811600_r11","doi-asserted-by":"crossref","unstructured":"Stage, R., and Roberts, C., 1997, \u201cA Framework for Representing and Computing Tool Accessibility,\u201d Proceedings of DETC\u201997, September 14\u201317, Sacramento, California.","DOI":"10.1115\/DETC97\/DFM-4323"},{"key":"2019100611035811600_r12","unstructured":"Lenthem, J. G., 1949, \u201cSpherical Trigonometry, for the Use of Colleges and Schools,\u201d London, Macmillan."},{"key":"2019100611035811600_r13","doi-asserted-by":"crossref","unstructured":"Chen, L.-L., and Woo, T. C., 1992, \u201cComputational Geometry on the Sphere With Application to Automated Machining,\u201d J. Mech. Des., 114, pp. 288\u2013295.","DOI":"10.1115\/1.2916945"},{"key":"2019100611035811600_r14","doi-asserted-by":"crossref","unstructured":"Lo, S. H. , 1989, \u201cDelaunay Triangulation of Non-Convex Planar Domains,\u201d Int. J. Numer. Methods Eng., 28, pp. 2695\u20132707.","DOI":"10.1002\/nme.1620281113"},{"key":"2019100611035811600_r15","doi-asserted-by":"crossref","unstructured":"Hoffmann, C., Hopcroft, J., and Karasick, M., 1988, \u201cTowards Implementing Robust Geometric Computations,\u201d in 4th Annual ACM Symposium of Computational Geometry, pp. 106\u2013117.","DOI":"10.1145\/73393.73405"},{"key":"2019100611035811600_r16","unstructured":"Sahni, S., 1998, Data Structures, Algorithms, and Applications in C++, McGraw-Hill."},{"key":"2019100611035811600_r17","unstructured":"Berg, M. de, Kreveld, M. van, Overmars, M., and Schwarzkopf, O., 2000, Computational Geometry: Algorithm and Applications, Springer-Verlag."}],"container-title":["Journal of Computing and Information Science in Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/asmedigitalcollection.asme.org\/computingengineering\/article-pdf\/3\/3\/200\/5635475\/200_1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/asmedigitalcollection.asme.org\/computingengineering\/article-pdf\/3\/3\/200\/5635475\/200_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,11]],"date-time":"2021-06-11T08:13:41Z","timestamp":1623399221000},"score":1,"resource":{"primary":{"URL":"https:\/\/asmedigitalcollection.asme.org\/computingengineering\/article\/3\/3\/200\/460132\/Algorithms-for-Computing-Global-Accessibility"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9,1]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,9,1]]}},"URL":"https:\/\/doi.org\/10.1115\/1.1606475","relation":{},"ISSN":["1530-9827","1944-7078"],"issn-type":[{"value":"1530-9827","type":"print"},{"value":"1944-7078","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,9,1]]}}}