Abstract
The interrogation of spatial relations and properties of three-dimensional objects are often involved in applications programs for CAD/CADM and robotics. These interrogations can be expressed in terms of low-level data retrieval queries called access primitives (APs). A data structure is presented for storing spatial relations of three-dimensional objects such that the amount of storage is linearly proportional to the number of entities, and the response time for the APs is constant on the average. Linear storage for this data structure is the lower bound. The data structure is in the form of a symmetric graph. Using E, the total number of edges of the object, as the unit, it is shown that the storage requirement of the symmetric data structure is 6E. By defining nine general data structure accessing primitives, it is shown that any local topological query can be answered in constant time, on the average.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Systems, Man, and Cybernetics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
