Algorithms for Computing Global Accessibility Cones | Zendy

Savinder Dhaliwal | Zendy; Satyandra K. Gupta | Zendy; Jun Huang | Zendy; Alok Priyadarshi | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Algorithms for Computing Global Accessibility Cones

Author(s) -

Savinder Dhaliwal,

Satyandra K. Gupta,

Jun Huang,

Alok Priyadarshi

Publication year - 2003

Publication title -

journal of computing and information science in engineering

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.538

H-Index - 50

eISSN - 1944-7078

pISSN - 1530-9827

DOI - 10.1115/1.1606475

Subject(s) - face (sociological concept) , computer science , object (grammar) , set (abstract data type) , boundary (topology) , variety (cybernetics) , planar , computer vision , algorithm , artificial intelligence , mathematics , computer graphics (images) , mathematical analysis , social science , sociology , programming language

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. DOI: 10.1115/1.1606475

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research