Fitting Voronoi diagrams to planar tesselations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8288 LNCS, Issue , 2013, Pages 349-361

  Aloupis, Greg ^a   Pérez Rosés, Hebert ^b,c   Pineda Villavicencio, Guillermo ^d,e   Taslakian, Perouz ^f   Trinchet Almaguer, Dannier ^g  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b UNIVERSITY OF LLEIDA   (Spain)

^c UNIVERSITY OF NEWCASTLE   (Australia)

^d UNIVERSITY OF BALLARAT   (Australia)

^e BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^f AMERICAN UNIVERSITY OF ARMENIA   (Armenia)

^g AlessTidyCraft Software Solutions   (Cuba)

Author keywords

Dirichlet tesselation; inverse Voronoi problem; planar tesselation; Voronoi diagram

Indexed keywords

GENERALIZED INVERSE; PLANAR STRAIGHT-LINE GRAPHS; TESSELATION; VORONOI; VORONOI DIAGRAMS;

ALGORITHMS; COMPUTATIONAL GEOMETRY; GRAPH THEORY; GRAPHIC METHODS;

INVERSE PROBLEMS;

EID: 84893129809     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-45278-9_30     Document Type: Conference Paper

References (15)

1. Ash, P., Bolker, E.D.: Recognizing Dirichlet Tesselations. Geometriae Dedicata 19, 175-206 (1985)
2. Aurenhammer, F.: Recognising Polytopical Cell Complexes and Constructing Projection Polyhedra. J. Symbolic Computation 3, 249-255 (1987)
3. Banerjee, S., Bhattacharya, B.B., Das, S., Karmakar, A., Maheshwari, A., Roy, S.: On the Construction of a Generalized Voronoi Inverse of a Rectangular Tesselation. In: Procs. 9th Int. IEEE Symp. on Voronoi Diagrams in Science and Engineering, pp. 132-137. IEEE, New Brunswick (2012)
4. de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry. Algorithms and Applications, 3rd edn. Springer, Berlin (2008)
5. Hartvigsen, D.: Recognizing Voronoi Diagrams with Linear Programming. ORSA J. Comput. 4, 369-374 (1992)
6. Martínez, A., Martínez, J., Pérez-Rosés, H., Quirós, R.: Image Processing using Voronoi diagrams. In: Procs. 2007 Int. Conf. on Image Proc., Comp. Vision, and Pat. Rec., pp. 485-491. CSREA Press (2007)
7. Ratti, B., Sommer, C.: Approximating Shortest Paths in Spatial Social Networks. In: Procs. 2012 ASE/IEEE Int. Conf. on Social Computing and 2012 ASE/IEEE Int. Conf. on Privacy, Security, Risk and Trust, pp. 585-586. IEEE Comp. Soc. (2012)
8. Schoenberg, F.P., Ferguson, T., Li, C.: Inverting Dirichlet Tesselations. The Computer J. 46, 76-83 (2003)
9. Sommer, C.: Approximate Shortest Path and Distance Queries in Networks. PhD Thesis, Department of Computer Science, The University of Tokyo, Japan (2010)
10. Sugihara, K., Iri, M.: Construction of the Voronoi Diagram for 'One Million' Generators in Single-Precision Arithmetic. Procs. IEEE 80, 1471-1484 (1992)
11. Trinchet-Almaguer, D.: Algorithm for Solving the Generalized Inverse Voronoi Problem. Honour's Thesis, Department of Computer Science, University of Oriente, Cuba (2005) (in Spanish)
12. Trinchet-Almaguer, D., Pérez-Rosés, H.: Algorithm for Solving the Generalized Inverse Voronoi Problem (in Spanish). Revista Cubana de Ciencias Informaticas 1(4), 58-71 (2007)
13. Yeganova, L., Falk, J.E., Dandurova, Y.V.: Robust Separation of Multiple Sets. Nonlinear Analysis 47, 1845-1856 (2001)
14. Yeganova, L.E.: Robust linear separation of multiple finite sets. Ph.D. Thesis, George Washington University (2001)
15. Zhou, B., Pei, J., Luk, W.-S.: A brief survey on anonymization techniques for privacy preserving publishing of social network data. ACM SIGKDD Explorations Newsletter 10, 12-22 (2008)