Referenced Items are not available for this document.
This paper presents an efficient algorithm to find the shape of a set of digital points. We compute the true digital Voronoi tessellation in O(m2) complexity. The algorithm needs an m×m image and the coordinates of the n initial points. The shape is then computed, in O(n) expected time, as a subgraph of the Delaunay triangulation
Published in:
Image Processing, 1994. Proceedings. ICIP-94., IEEE International Conference
(Volume:1
)
Date of Conference: 13-16 Nov 1994
- Page(s):
- 705 - 709 vol.1
- Meeting Date :
- 13 Nov 1994-16 Nov 1994
- Print ISBN:
- 0-8186-6952-7
- INSPEC Accession Number:
- 4997677
- Conference Location :
- Austin, TX
- Digital Object Identifier :
- 10.1109/ICIP.1994.413406
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
