Conference Paper2015

Efficient construction of UV-diagram

M Zahid Hossain, Mahady Hasan, M Ashraful Amin

Advances in Swarm and Computational Intelligence: 6th International Conference, ICSI 2015 held in conjunction with the Second BRICS Congress, CCI 2015, Beijing, China, June 25-28, 2015, Proceedings, Part III 6

Springer International Publishing, pp. 329–340, ISBN: 9783319204680

Keywords

  • proximity relations
  • uncertain objects
  • computational geometry algorithms
  • algorithm efficiency
  • proximity graphs

CCDS Authors

Prof. M Ashraful Amin, PhD
M Ashraful Amin, PhD

Prof. M Ashraful Amin, PhD

  • Founder Director, CCDS
  • Director, AI/ML, HCI & DS Wings

Professor

+1 more affiliation

Department of Information Sciences and Technology

George Mason University, USA

Published at

ACL, CHI, UbiComp, ECAI, WACV, PAKDD, IJCNN, ICPR, ICIP, HCII, CLEF, BLP, Scientific Reports, JMIR, IEEE Access, Smart Agricultural Technology, Frontiers in Computational Neuroscience, Diabetes Research and Clinical Practice, PLOS ONE

Research Interests

Machine Learning, Cognitive & Vision Science, Cybernetics, Surveillance & Security, ICT in Education, Health, & Agriculture, Human-Computer Interaction, Internet of Things, Robotics

References

  1. 1.Antonin Guttman. (1984). R-trees. , 47[10.1145/602259.602266]
  2. 2.Franz Aurenhammer. (1991). Voronoi diagrams—a survey of a fundamental geometric data structure. ACM Computing Surveys, 23(3), 345–405[10.1145/116873.116880]
  3. 3.Norbert Beckmann, Hans‐Peter Kriegel, Ralf Schneider, Bernhard Seeger. (1990). The R*-tree: an efficient and robust access method for points and rectangles. , 322–331[10.1145/93597.98741]
  4. 4.Nguyễn Xuân Vinh, Julien Epps, James Bailey. (2010). Information Theoretic Measures for Clusterings Comparison: Variants, Properties, Normalization and Correction for Chance. Minerva Access (University of Melbourne), 11(95), 2837–2854[10.5555/1756006.1953024]
  5. 5.Antonin Guttman. (1984). R-trees. ACM SIGMOD Record, 14(2), 47–57[10.1145/971697.602266]
  6. 6.Arindam Banerjee, Srujana Merugu, Inderjit S. Dhillon, Joydeep Ghosh. (2004). Clustering with Bregman Divergences. , 234–245[10.1137/1.9781611972740.22]
  7. 7.Norbert Beckmann, Hans‐Peter Kriegel, Ralf Schneider, Bernhard Seeger. (1990). The R*-tree: an efficient and robust access method for points and rectangles. ACM SIGMOD Record, 19(2), 322–331[10.1145/93605.98741]
  8. 8.Leonidas Guibas, Jorge Stolfi. (1985). Primitives for the manipulation of general subdivisions and the computation of Voronoi. ACM Transactions on Graphics, 4(2), 74–123[10.1145/282918.282923]
  9. 9.Joseph O’Rourke. (1998). Computational Geometry in C. Cambridge University Press eBooks[10.1017/cbo9780511804120]
  10. 10.Reynold Cheng, Dmitri V. Kalashnikov, Sunil Prabhakar. (2004). Querying imprecise data in moving object environments. IEEE Transactions on Knowledge and Data Engineering, 16(9), 1112–1127[10.1109/tkde.2004.46]
  11. 11.Joseph O’Rourke. (1998). Computational geometry in C (2nd ed.). Cambridge University Press eBooks
  12. 12.Rex A. Dwyer. (1987). A faster divide-and-conquer algorithm for constructing delaunay triangulations. Algorithmica, 2(1-4), 137–151[10.1007/bf01840356]
  13. 13.Jürgen Richter-Gebert. (2011). Perspectives on Projective Geometry. [10.1007/978-3-642-17286-1]
  14. 14.Mehdi Sharifzadeh, Cyrus Shahabi. (2010). VoR-tree. Proceedings of the VLDB Endowment, 3(1-2), 1231–1242[10.14778/1920841.1920994]
  15. 15.Pankaj K. Agarwal, Siu-Wing Cheng, Yufei Tao, Ke Yi. (2009). Indexing uncertain data. , 137–146[10.1145/1559795.1559816]
  16. 16.Ben Kao, Sau Dan Lee, Foris K F Lee, David W. Cheung, Wai-Shing Ho. (2010). Clustering Uncertain Data Using Voronoi Diagrams and R-Tree Index. IEEE Transactions on Knowledge and Data Engineering, 22(9), 1219–1233[10.1109/tkde.2010.82]
  17. 17.Peter Su, Robert L. Scot Drysdale. (1997). A comparison of sequential Delaunay triangulation algorithms. Computational Geometry, 7(5-6), 361–385[10.1016/s0925-7721(96)00025-9]
  18. 18.Arseniy Akopyan, A. Zaslavsky. (2007). Geometry of Conics. Mathematical world[10.1090/mawrld/026]
  19. 19.William Evans. (2008). Guaranteed Voronoi Diagrams of Uncertain Sites.
  20. 20.Reynold Cheng, Xike Xie, Man Lung Yiu, Jinchuan Chen, Liwen Sun. (2010). UV-diagram: A Voronoi diagram for uncertain data. , 796–807[10.1109/icde.2010.5447917]
  21. 21.Rui Li, Bir Bhanu, Chinya V. Ravishankar, Michael Kurth, Jinfeng Ni. (2006). Uncertain spatial data handling: Modeling, indexing and query. Computers & Geosciences, 33(1), 42–61[10.1016/j.cageo.2006.05.011]
  22. 22.Xike Xie, Reynold Cheng, Man Lung Yiu, Liwen Sun, Jinchuan Chen. (2012). UV-diagram: a voronoi diagram for uncertain spatial databases. The VLDB Journal, 22(3), 319–344[10.1007/s00778-012-0290-x]
  23. 23.Jürgen Richter-Gebert. (2011). Perspectives on Projective Geometry: A Guided Tour Through Real and Complex Geometry. [10.1007/978-3-642-17286-1]
  24. 24.Joseph K. P. Kuan, Paul Lewis. (2002). Fast k nearest neighbour search for R-tree family. , 924–928[10.1109/icics.1997.652114]