Computing the shape of a point set in digital images

The point set here consists of pixels from a digital image. First, the digital Voronoi diagram of the set is constructed using the Euclidean distance. From this diagram a certain planar graph is found which is a subgraph of the Delaunay triangulation of the point set. Finally, the shape of the point...

Full description

Saved in:
Bibliographic Details
Published in:Pattern recognition letters 1993-02, Vol.14 (2), p.89-94
Main Authors: Parui, S.K., Sarkar, S., Chaudhuri, B.B.
Format: Article
Language:English
Subjects:
Applied sciences
Artificial intelligence
Computer science
control theory
systems
digital geometry
Discrete points
Exact sciences and technology
Pattern recognition. Digital image processing. Computational geometry
planar graph
planar shape
Voronoi diagram
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The point set here consists of pixels from a digital image. First, the digital Voronoi diagram of the set is constructed using the Euclidean distance. From this diagram a certain planar graph is found which is a subgraph of the Delaunay triangulation of the point set. Finally, the shape of the point set is computed as a certain subgraph of the planar graph.
ISSN:0167-8655
1872-7344
DOI:10.1016/0167-8655(93)90081-N