Filling N-sided Holes Using Combined Subdivision Schemes

Abstract

A new method is presented for calculating N-sided surface patches. The algorithm generates a subdivision surface which satisfies arbitrary C(sup 1) boundary conditions. The proposed subdivision scheme is based on a Catmull-Clark type subdivision scheme that operates in the surface interior. Near the boundary we introduce new subdivision rules that involve the given boundary conditions. The generated subdivision surface is C(sup 2)-continuous except at one extraordinary point. In the neighborhood of this point the surface curvature is bounded.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 2000
Accession Number
ADP012032

Entities

People

  • Adi Levin

Organizations

  • Tel Aviv University

Tags

Communities of Interest

  • Air Platforms
  • C4I

DTIC Thesaurus Topics

  • Algorithms
  • Boundaries
  • Computer Graphics
  • Computers
  • Continuity
  • Curvature
  • Equations
  • Geometry
  • Graphics
  • Intervals
  • Iterations
  • Technical Information Centers
  • Topology

Fields of Study

  • Mathematics

Readers

  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)
  • Fluid Dynamics.