• On Linear-Sized Farthest-Color...

Result: On Linear-Sized Farthest-Color Voronoi Diagrams : Foundations of Computer Science - Mathematical Foundations and Applications of Computer Science and Algorithms

Title:
On Linear-Sized Farthest-Color Voronoi Diagrams : Foundations of Computer Science - Mathematical Foundations and Applications of Computer Science and Algorithms
Authors:
SANG WON BAE
Source:
IEICE transactions on information and systems. 95(3):731-736
Publisher Information:
Oxford: Oxford University Press, 2012.
Publication Year:
2012
Physical Description:
print, 15 ref
Original Material:
INIST-CNRS
Subject Terms:
Electronics, Electronique, Computer science, Informatique, Telecommunications, Télécommunications, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Intelligence artificielle, Artificial intelligence, Reconnaissance des formes. Traitement numérique des images. Géométrie algorithmique, Pattern recognition. Digital image processing. Computational geometry, Telecommunications et theorie de l'information, Telecommunications and information theory, Théorie de l'information, du signal et des communications, Information, signal and communications theory, Traitement du signal, Signal processing, Traitement des images, Image processing, Complexité linéaire, Linear complexity, Complejidad lineal, Diagramme Voronoï, Voronoï diagram, Diagrama Voronoi, Distance minimale, Minimal distance, Distancia mínima, Géométrie algorithmique, Computational geometry, Geometría computacional, Méthode cas pire, Worst case method, Método caso peor, Méthode combinatoire, Combinatorial method, Método combinatorio, Traitement image, Image processing, Procesamiento imagen, Géométrie numérique, Digital geometry, Voronoi diagrams, computational geometry, farthest-color Voronoi diagrams, realistic models
Document Type:
Academic journal Article
File Description:
text
Language:
English
Author Affiliations:
Department of Computer Science, Kyonggi University, Suwon, Korea, Republic of
ISSN:
0916-8532
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=25577216
Rights:
Copyright 2015 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems

Telecommunications and information theory
Accession Number:
edscal.25577216
Database:
PASCAL Archive

Further Information

Given a collection of k sets consisting of a total of n points in the plane, the distance from any point in the plane to each of the sets is defined to be the minimum among distances to each point in the set. The farthest-color Voronoi diagram is defined as a generalized Voronoi diagram of the k sets with respect to the distance functions for each of the k sets. The combinatorial complexity of the diagram is known to be Θ(kn) in the worst case. This paper initiates a study on farthest-color Voronoi diagrams having O(n) complexity. We introduce a realistic model, which defines a certain class of the diagrams with desirable geometric properties observed. We finally show that the farthest-color Voronoi diagrams under the model have linear complexity.