Representing ordered order-k Voronoi diagrams
Wang, Ye, Lee, Kyungmi, and Lee, Ickjai (2011) Representing ordered order-k Voronoi diagrams. Proceedings of the 7th International Conference on Information Processing and Management. ICIPM 2011 7th International Conference on Information Processing and Management , 29 November- 1 December 2011, Jeju Island, Korea , pp. 71-75.
|PDF (Published Version) - Repository staff only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader|
View at Publisher Website: http://www.aicit.org/icipm2011/
The ordered order-k Voronoi diagram is a popular generalization of the ordinary Voronoi diagram modeling ordered k nearest sites. Despite of the usefulness of the ordered order-k Voronoi diagram, its structural complexity and wealth of information captured result in poor readability. Most research has focused on computational complexity, and visualization/representation of the ordered order-k Voronoi diagram has received little attention. This paper attempts to represent the ordered order-k Voronoi diagram through its relationship with other higher order Voronoi diagrams. The proposed method highlights topological relationships between/among higher order Voronoi diagram families, and enhances the readability of the ordered order-k diagram.
|Item Type:||Conference Item (Refereed Research Paper - E1)|
|FoR Codes:||08 INFORMATION AND COMPUTING SCIENCES > 0801 Artificial Intelligence and Image Processing > 080109 Pattern Recognition and Data Mining @ 100%|
|SEO Codes:||89 INFORMATION AND COMMUNICATION SERVICES > 8902 Computer Software and Services > 890202 Application Tools and System Utilities @ 100%|
|Deposited On:||20 Feb 2012 15:24|
|Last Modified:||20 Feb 2012 15:24|
Last 12 Months: 0
Repository Staff Only: item control page