Meshless geometric subdivision

  • Authors:
  • C. Moenning;F. Mémoli;G. Sapiro;N. Dyn;N. A. Dodgson

  • Affiliations:
  • Computer Laboratory, University of Cambridge, 15 JJ Thomson Avenue, Cambridge CB3 0FD, UK;Electrical and Computer Engineering Department, University of Minnesota, Minneapolis, MN 55455, USA;Electrical and Computer Engineering Department, University of Minnesota, Minneapolis, MN 55455, USA;School of Mathematical Sciences, Tel Aviv University, Tel Aviv 69978, Israel;Computer Laboratory, University of Cambridge, 15 JJ Thomson Avenue, Cambridge CB3 0FD, UK

  • Venue:
  • Graphical Models
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Point-based surface processing has developed into an attractive alternative to mesh-based processing tools for a number of geometric modeling applications. By working with point clouds directly, processing is based on the raw data and its underlying geometry rather than any arbitrary intermediate representations and generally artificial connectivity relations. We extend this principle into the area of subdivision surfaces by introducing the notion of meshless geometric subdivision. Our approach replaces the role of mesh connectivity with intrinsic point proximity thereby avoiding a number of limitations of mesh-based surface subdivision schemes. Apart from introducing this idea of meshless subdivision, we put forward a first intrinsic meshless subdivision scheme and present a new method for the computation of intrinsic means on Euclidean manifolds.