DISCRETE CURVATURE BASED ON AREA

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hierarchical Isosurface Segmentation Based on Discrete Curvature

A high-level approach to describe the characteristics of a surface is to segment it into regions of uniform curvature behavior and construct an abstract representation given by a (topology) graph. We propose a surface segmentation method based on discrete mean and Gaussian curvature estimates. The surfaces are obtained from three-dimensional imaging data sets by isosurface extraction after data...

متن کامل

Discrete Curvature Based on Osculating Circle Estimation

In this paper, we make an overview of the existing algorithms concerning the discrete curvature estimation. We extend the Worring and Smeulders [WS93] classification to new algorithms and we present a new and purely discrete algorithm based on discrete osculating circle estimation.

متن کامل

Parabola - Based Discrete Curvature Estimation †

The local geometric properties such as curvatures and normal vectors play important roles in analyzing the local shape of objects. The result of the geometric operations such as mesh simplification and mesh smoothing is dependent on how to compute the curvatures of meshes, because there is no exact definition of the discrete curvature in meshes. In this paper, we indicate the fatal error in com...

متن کامل

A curvature theory for discrete surfaces based on mesh parallelity

We consider a general theory of curvatures of discrete surfaces equipped with edgewise parallel Gauss images, and where mean and Gaussian curvatures of faces are derived from the faces’ areas and mixed areas. Remarkably these notions are capable of unifying notable previously defined classes of surfaces, such as discrete isothermic minimal surfaces and surfaces of constant mean curvature.We dis...

متن کامل

Constructing Minimal Triangular Mesh Based on Discrete Mean Curvature

In this paper, a so-called Plateau-Mesh problem is proposed, that is, to find a triangular mesh with the boundary formed by a given spacial closed polygon, whose area is minimum among all triangular meshes with the same boundary. To solve this problem, the former work by minimizing a function describing the mesh area directly, cannot obtain the global minimum of the function, only obtain its lo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Honam Mathematical Journal

سال: 2010

ISSN: 1225-293X

DOI: 10.5831/hmj.2010.32.1.053