A new global accessibility algorithm for a polyhedral model with convex polygonal facets

Authors:
Kittichai Suthunyatanakit;Erik L. J. Bohez;Kittinan Annanon
Affiliations:
Design and Manufacturing Engineering Program, School of Engineering and Technology, Asian Institute of Technology, P.O. Box 4, Klongluang, Pathumthani 12120, Thailand;Design and Manufacturing Engineering Program, School of Engineering and Technology, Asian Institute of Technology, P.O. Box 4, Klongluang, Pathumthani 12120, Thailand;National Metal and Materials Technology Center, 114 Thailand Science Park, Paholyothin Road, Klong 1, Klongluang, Pathumthani 12120, Thailand
Venue:
Computer-Aided Design
Year:
2009

Citing 10
Cited 1

Computational geometry: an introduction

Computational geometry: an introduction
Tangent, normal, and visibility cones on Be´zier surfaces

Computer Aided Geometric Design
Computational geometry in C (2nd ed.)

Computational geometry in C (2nd ed.)
Computer Graphics and Geometric Modeling for Engineers

Computer Graphics and Geometric Modeling for Engineers
Accessibility Analysis Using Computer Graphics Hardware

IEEE Transactions on Visualization and Computer Graphics
Mold Accessibility via Gauss Map Analysis

SMI '04 Proceedings of the Shape Modeling International 2004
Computing non-visibility of convex polygonal facets on the surface of a polyhedral CAD model

Computer-Aided Design
Computational Geometry: Algorithms and Applications

Computational Geometry: Algorithms and Applications
Finding feasible mold parting directions using graphics hardware

Computer-Aided Design
A Delaunay-based region-growing approach to surface reconstruction from unorganized points

Computer-Aided Design

Geometric covering

Computer-Aided Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

Global accessibility information of a CAD model has been utilized widely in various manufacturing applications. This information needs fast-computing to improve the efficiency of manufacturability analysis. It needs compact representation to increase the effective utilization in its process-planning task. We propose a new geometric algorithm to explicitly find the global accessibility cones (GAC) of a polyhedral model. The proposed algorithm has three main steps. The first is concave region extraction, collecting facets that are not on the convex hull of the entire model. Second, inaccessibility of convex polygonal facets in these concave regions is analyzed in order to find their inaccessibility cones (IAC). The method is done in 2D instead of 3D. Finally, to compute GACs of those facets, the complement of the IACs union is determined for an exact solution, while the slicing-method is proposed to find a near-exact solution. In this paper, geometric examples are demonstrated and a comparison of the computational complexity with existing algorithms is provided.