On the shape of a set of points in the plane

@inproceedings{Edelsbrunner1983OnTS,
  title={On the shape of a set of points in the plane},
  author={Herbert Edelsbrunner and David G. Kirkpatrick and Raimund Seidel},
  booktitle={IEEE Transactions on Information Theory},
  year={1983}
}
A generalization of the convex hull of a finite set of points in the plane is introduced and analyzed. This generalization leads to a family of straight-line graphs, " \alpha -shapes," which seem to capture the intuitive notions of "fine shape" and "crude shape" of point sets. It is shown that a-shapes are subgraphs of the closest point or furthest point Delaunay triangulation. Relying on this result an optimal O(n \log n) algorithm that constructs \alpha -shapes is developed. 
View via Publisher
cs.jhu.edu
1,546 Citations
Highly Influential Citations
61
Background Citations
418
Methods Citations
456
Results Citations
2

Figures from this paper

1,546 Citations

A-shapes of a finite point set

A family of straightline graphs, derived from the Delaunay triangulation, is developed which is called A-shape of a finite point set (A is an arbitrary point set).

Computing the shape of a point set in digital images

Iterative algorithm for computing the shape of a finite set of points

An efficient algorithm for constructing the shape of a set of points is presented based on the relationship between the k-connected hulls sets an the Voronoi diagram.

Efficient generation of simple polygons for characterizing the shape of a set of points in the plane

Quickly Placing a Point to Maximize Angles

This work seeks to place a new point q such that the constrained Delaunay triangulation of P[fqg has the largest possible minimum angle, and develops a simpler cubic-time algorithm quite dierent from the ones already known.

Fast algorithm for computing the shape of a set of digital points

  • M. MelkemiD. Vandorpe
  • Computer Science
    Proceedings of 1st International Conference on Image Processing
  • 1994
The true digital Voronoi tessellation in O(m/sup 2/) complexity is computed as a subgraph of the Delaunay triangulation as well as an image and the coordinates of the n initial points.

An efficient incremental algorithm for generating the characteristic shape of a dynamic set of points in the plane

This paper presents for the first time an incremental χ-shape algorithm, capable of processing point data streams, that allows both insertion and deletion operations, and can handle streaming individual points and multiple point sets.

Boundaries through Scattered Points of Unknown Density

  • R. Veltkamp
  • Mathematics
    CVGIP Graph. Model. Image Process.
  • 1995
A method for the (re)construction of a simple closed polygon (2D) or polyhedron (3D) passing through all the points of a given set, based on a parameterized geometric graph, the γ-Neighborhood Graph.

Recursive voids for identifying a nonconvex boundary of a set of points in the plane

Dense point sets have sparse Delaunay triangulations

It is proved that the Delaunay triangulation of any set of n points in R^3 with spread D has complexity O(D^3), and this upper bound is tight in the worst case for all D = O(sqrt{n}.
...

References

SHOWING 1-10 OF 28 REFERENCES

The relative neighbourhood graph of a finite planar set

A Convex Hull Algorithm Optimal for Point Sets in Even Dimensions

It is shown that this algorithm is worst case optimal for even $d \geq 2$ and the main result is an O(n \log n + n^{\lfloor(d+1)/2\rfloor}) algorithm for the construction of the convex hull of n points in R^{d}.

Closest-point problems

  • M. ShamosDan Hoey
  • Computer Science
    16th Annual Symposium on Foundations of Computer Science (sfcs 1975)
  • 1975
The purpose of this paper is to introduce a single geometric structure, called the Voronoi diagram, which can be constructed rapidly and contains all of the relevant proximity information in only linear space, and is used to obtain O(N log N) algorithms for most of the problems considered.

An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set

On the complexity ofd- dimensional Voronoi diagrams

The present paper deals with the complexity of Voronoi diagrams based on n points of E superscript d, where pi consists of all points of O(n log n) that have pi as a nearest point in the set.

A new approach to rectangle intersections part I

Rectangle intersections involving rectilinearly-oriented (hyper-) rectangles in d-dimensional real space are examined from two points of view. First, a data structure is developed which is efficient…

Geometric transforms for fast geometric algorithms

This thesis describes several geometric problems whose solutions illustrate the use of geometric transforms, including fast algorithms for intersecting half-spaces, constructing Voronoi diagrams, and computing the Euclidean diameter of a set of points.

Dynamization of Order Decomposable Set Problems

  • M. Overmars
  • Computer Science, Mathematics
    J. Algorithms
  • 1981

Voronoi Diagrams from Convex Hulls

The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees

Sous l'hypothese que trois points d'entree ne forment pas un triangle isocele, le RNG de n points dans un espace dimension r peut etre trouve en un temps O(n 2 ) pour r≥3.