vix.ing · top · new · best · stats

On the shape of a set of points in the plane

1983/07/01 by H. Edelsbrunner, Herbert Edelsbrunner, D. Kirkpatrick +3 · 1,853 citations
Business, Management and Accounting · Computer Science · Mathematics · Social Sciences · #Algorithm #Artificial intelligence #Combinatorics #Computational Geometry and Mesh Generation #Computer science #Convex hull #Delaunay triangulation #Discrete mathematics #Facility Location and Emergency Management #Generalization #Geographic Information Systems Studies #Geometry #Mathematical analysis #Mathematics #Plane (geometry) #Point (geometry) #Regular polygon #Set (abstract data type)

paper · doi:10.1109/tit.1983.1056714

published in IEEE Transactions on Information Theory 29(4), 551-559 (Institute of Electrical and Electronics Engineers)

openalex publication_date 1983/07/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05

Abstract

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, "α-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 optimalO(n log n)algorithm that constructsα-shapes is developed.

Cited by

Related