Surfaces can be generated easily by subdividing polyhedral networks recursively, but over simple or rough polyhedral network, it is difficult to get the surfaces which designers want to model. To solve this problem, complex or precise polyhedral networks have to be defined. In this paper, a set of rules and an automatic adaptive algorithm for making fillet operations with Loop subdivision are presented. The fillet operations are implemented by subdividing a polyhedral network one step with the given sharpness of edges of the polyhedral network. Generally, the number of edges that meet at one vertex is no restriction and the sharpness of every edge can be different. The fillet operations proposed here will strengthen the functions of Computer Graphics system which use subdivision surfaces to model surfaces.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.