๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Computing the shape of a planar points set

โœ Scribed by Mahmoud Melkemi; Mourad Djebali

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
701 KB
Volume
33
Category
Article
ISSN
0031-3203

No coin nor oath required. For personal study only.

โœฆ Synopsis

In this article, we introduce a mathematical formalism de"ning the shape of a "nite point set which we call A-shape. The parameter A is a "nite set of points which positions variation allows A-shape to generate a family of graphs extracted from Delaunay triangulation. Each graph corresponds to an element of a shapes set presenting more and more details and going from the convex hull of the points set to the points set itself. It is obvious that the shape having the suitable level of details is obtained by a judicious choice of A. We also propose a method to determine A for which A-shape gives the adequate shape for points sets containing dense and sparse regions.

๐Ÿ“œ SIMILAR VOLUMES

The santalo point of a planar convex set
The santalo point of a planar convex set
โœ M.J. Kaiser ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 505 KB

An algorithm is described to determine the minimum area polar set of a planar convex polygon described in terms of its vertices. We adopt a result due to Santalo to verify our minimizing solution, and then demonstrate the search procedure on a few examples. 'For triangular (and centrally symmetric)

Off-line dynamic maintenance of the widt
Off-line dynamic maintenance of the width of a planar point set
โœ Pankaj K. Agarwal; Micha Sharir ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 967 KB

In this paper we present an efficient algorithm for the off-line dynamic maintenance of the width of a planar point set in the following restricted case: We are given a real parameter W and a sequence X = (a,, , a,,) of n insert and delete operations on a set S of points in R2, initially consisting