Minimum area enclosure and alpha hull of a set of freeform planar closed curves

نویسندگان

  • A. V. Vishwanath
  • Rangaprasad Arun Srivatsan
  • M. Ramanathan
چکیده

Of late, researchers appear to be intrigued with the question; Given a set of points, what is the region occupied by them? The answer appears to be neither straight forward nor unique. Convex hull, which gives a convex enclosure of the given set, concave hull, which generates nonconvex polygons and other variants such as α-hull, poly hull, r-shape and s-shape etc. have been proposed. In this paper, we extend the question of finding a minimum area enclosure (MAE) to a set of closed planar freeform curves, not resorting to sampling them. An algorithm to compute MAE has also been presented. The curves are represented as NURBS (non-uniform rational Bsplines). We also extend the notion of α-hull of a point set to the set of closed curves and explore the relation between alpha hull (using negative alpha) and the MAE.

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

ثبت نام

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

منابع مشابه

3D Freeform Surfaces from Planar Sketches Using Neural Networks

A novel intelligent approach into 3D freeform surface reconstruction from planar sketches is proposed. A multilayer perceptron (MLP) neural network is employed to induce 3D freeform surfaces from planar freehand curves. Planar curves were used to represent the boundaries of a freeform surface patch. The curves were varied iteratively and sampled to produce training data to train and test the ne...

متن کامل

Freeform surface induction from projected planar curves via neural networks

We propose a novel intelligent approach into 2D to 3D of on-line sketching in conceptual design. A Multilayer Perceptron (MLP) neural network is employed to construct 3D freeform surfaces from 2D freehand curves. Planar curves were used to represent the boundary strokes of a freeform surface patch and varied iteratively to produce a training set. Sampled curves were used to train and test the n...

متن کامل

Algorithm for computing positive α-hull for a set of planar closed curves

In this paper, the computation of positiveα-hull for a set of planar closedC-continuous curves has been addressed without sampling the curves into point-sets or polylines. Positive α-hull, so far, has been computed only for a set of points, using the farthest Delaunay triangulation, a dual of farthest Voronoi diagram. However, Delaunay triangulation does not exist for a set of curved boundaries...

متن کامل

Metamorphosis of Planar Parametric Curves Via Curvature Interpolation

This work considers the problem of metamorphosis interpolation between two freeform planar curves. Given two planar parametric curves, the curvature signature of the two curves is linearly blended, yielding a gradual change that is not only smooth but also employs intrinsic curvature shape properties, and hence is highly appealing. In order to be able to employ this curvature blending, we prese...

متن کامل

Alpha-Concave Hull, a Generalization of Convex Hull

Bounding hull, such as convex hull, concave hull, alpha shapes etc. has vast applications in different areas especially in computational geometry. Alpha shape and concave hull are generalizations of convex hull. Unlike the convex hull, they construct non-convex enclosure on a set of points. In this paper, we introduce another generalization of convex hull, named alpha-concave hull, and compare ...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:
  • Computer-Aided Design

دوره 45  شماره 

صفحات  -

تاریخ انتشار 2013