{"id":{"repo_id":"vt","oai_identifier":"oai:vtechworks.lib.vt.edu:10919/76033"},"canonical_url":"https://search.dev.ndltd.org/etd/vt/oai:vtechworks.lib.vt.edu:10919/76033","repository":{"repo_id":"vt","name":"Virginia Tech","base_url":"https://vtechworks.lib.vt.edu/oai/request"},"display":{"title":"Computer representations of machined parts for automatic inspection","abstract":"A comparison is made between octrees, which are regular decompositions of volumes, and new, irregular decompositions called R-trees. This comparison is made within the context of the volume intersection problems that might be associated with an automatic inspection system. The results show that the irregular decomposition is independent of object position and can provide a more space efficient encoding for certain shapes. However, detecting intersections between R-trees requires an algorithm of greater complexity due to the irregularity of the decomposition. Algorithms are given for obtaining tree decompositions from a hierarchic relational model of a volume. Among these algorithms is a procedure for finding the minimal enclosing rectangular parallelepiped of a boundary representation, and a generalization of the point-in-polygon algorithm to boundaries on curved surfaces. Both of these algorithms have computation times that are proportional to the total number of components of the boundary's representation.","abstract_html":"A comparison is made between octrees, which are regular decompositions of volumes, and new, irregular decompositions called R-trees. This comparison is made within the context of the volume intersection problems that might be associated with an automatic inspection system. The results show that the irregular decomposition is independent of object position and can provide a more space efficient encoding for certain shapes. However, detecting intersections between R-trees requires an algorithm of greater complexity due to the irregularity of the decomposition. Algorithms are given for obtaining tree decompositions from a hierarchic relational model of a volume. Among these algorithms is a procedure for finding the minimal enclosing rectangular parallelepiped of a boundary representation, and a generalization of the point-in-polygon algorithm to boundaries on curved surfaces. Both of these algorithms have computation times that are proportional to the total number of components of the boundary's representation.","abstract_has_math":false,"creators":["Fiala, John C."],"institution":"Virginia Polytechnic Institute and State University","degree_name":"Master of Science","degree_level":"masters","degree_discipline":"Electrical Engineering","degree_department":"Electrical Engineering","school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":1985,"date_issued":"1985","date_published":"1985","updated_at":"2026-07-22T22:18:55Z","subjects":[],"languages":["en_US"],"rights":["In Copyright"],"rights_urls":["http://rightsstatements.org/vocab/InC/1.0/"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/10919/76033","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.department","label":"Department","values":["Electrical Engineering"]},{"key":"dc:creator","label":"Author","values":["Fiala, John C."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2017-03-09T21:35:21Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2017-03-09T21:35:21Z"]},{"key":"dc:date.issued","label":"Date","values":["1985"]},{"key":"dc:publisher","label":"Institution","values":["Virginia Polytechnic Institute and State University"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"dc:type.dcmitype","label":"Dc Type Dcmitype","values":["Text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Virginia Polytechnic Institute and State University"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]},{"key":"dc:rights","label":"Dc Rights","values":["In Copyright"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://rightsstatements.org/vocab/InC/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10919/76033"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["A comparison is made between octrees, which are regular decompositions of volumes, and new, irregular decompositions called R-trees. This comparison is made within the context of the volume intersection problems that might be associated with an automatic inspection system. The results show that the irregular decomposition is independent of object position and can provide a more space efficient encoding for certain shapes. However, detecting intersections between R-trees requires an algorithm of greater complexity due to the irregularity of the decomposition. Algorithms are given for obtaining tree decompositions from a hierarchic relational model of a volume. Among these algorithms is a procedure for finding the minimal enclosing rectangular parallelepiped of a boundary representation, and a generalization of the point-in-polygon algorithm to boundaries on curved surfaces. Both of these algorithms have computation times that are proportional to the total number of components of the boundary's representation."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Master of Science"]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Computer representations of machined parts for automatic inspection"]}]}],"canonical_facts":{"dc:contributor.department":["Electrical Engineering"],"dc:creator":["Fiala, John C."],"dc:date.accessioned":["2017-03-09T21:35:21Z"],"dc:date.available":["2017-03-09T21:35:21Z"],"dc:date.issued":["1985"],"dc:description.abstract":["A comparison is made between octrees, which are regular decompositions of volumes, and new, irregular decompositions called R-trees. This comparison is made within the context of the volume intersection problems that might be associated with an automatic inspection system. The results show that the irregular decomposition is independent of object position and can provide a more space efficient encoding for certain shapes. However, detecting intersections between R-trees requires an algorithm of greater complexity due to the irregularity of the decomposition. Algorithms are given for obtaining tree decompositions from a hierarchic relational model of a volume. Among these algorithms is a procedure for finding the minimal enclosing rectangular parallelepiped of a boundary representation, and a generalization of the point-in-polygon algorithm to boundaries on curved surfaces. Both of these algorithms have computation times that are proportional to the total number of components of the boundary's representation."],"dc:description.degree":["Master of Science"],"dc:format.mimetype":["application/pdf"],"dc:identifier.uri":["http://hdl.handle.net/10919/76033"],"dc:language.iso":["en_US"],"dc:publisher":["Virginia Polytechnic Institute and State University"],"dc:rights":["In Copyright"],"dc:rights.uri":["http://rightsstatements.org/vocab/InC/1.0/"],"dc:title":["Computer representations of machined parts for automatic inspection"],"dc:type":["Thesis"],"dc:type.dcmitype":["Text"],"thesis:degree_discipline":["Electrical Engineering"],"thesis:degree_level":["masters"],"thesis:degree_name":["Master of Science"],"thesis:institution_name":["Virginia Polytechnic Institute and State University"]},"updated_at":"2026-07-22T22:18:55Z"}