A list-processing approach to compute Voronoi diagrams and the Euclidean distance transform
| Autor: | Weiguang Guan, Songde Ma |
|---|---|
| Rok vydání: | 1998 |
| Předmět: |
business.industry
Applied Mathematics Pattern recognition Lloyd's algorithm Weighted Voronoi diagram Euclidean distance Fortune's algorithm Computational Theory and Mathematics Artificial Intelligence Computer Science::Computer Vision and Pattern Recognition Power diagram Computer Vision and Pattern Recognition Artificial intelligence business Centroidal Voronoi tessellation Voronoi diagram Distance transform Software Mathematics |
| Zdroj: | IEEE Transactions on Pattern Analysis and Machine Intelligence. 20:757-761 |
| ISSN: | 0162-8828 |
| Popis: | We propose an efficient Voronoi transform algorithm for constructing Voronoi diagrams using segment lists of rows. A significant feature of the algorithm is that it takes segments rather than pixels as the basic units to represent and propagate the nearest neighbor information. The segment lists are dynamically updated as they are scanned. A distance map can then be easily computed from the segment list representation of the Voronoi diagram. Experimental results have demonstrated its high efficiency. Extension of the algorithm to higher dimensions is also discussed. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|