Representing ordered order-k Voronoi diagrams
Conference Publication ResearchOnline@JCUAbstract
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.
Journal
N/A
Publication Name
ICIPM 2011 7th International Conference on Information Processing and Management
Volume
N/A
ISBN/ISSN
N/A
Edition
N/A
Issue
N/A
Pages Count
5
Location
Jeju Island, Korea
Publisher
Advanced Institute of Convergence Information Technology
Publisher Url
N/A
Publisher Location
Busan, Korea
Publish Date
N/A
Url
N/A
Date
N/A
EISSN
N/A
DOI
N/A