Data imprecision under λ-geometry model: Range searching problem

Scientia Iranica

Volumn 20, Issue 3, 2013, Pages 663-669

  Davoodi, M ^a   Mohades, A ^b  

^a INSTITUTE FOR ADVANCED STUDIES IN BASIC SCIENCES IASBS   (Iran)

^b AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

Computational geometry; Dynamic imprecision; Imprecise data; Modeling; Range searching problem

Indexed keywords

DECISION MAKING; MODELS;

DECISION MAKING PROCESS; EXACT ALGORITHMS; GEOMETRIC ALGORITHM; IMPRECISE DATA; RANGE SEARCHING; REAL-WORLD PROBLEM; REGION-BASED MODELS; TWO DIMENSIONAL SPACES;

COMPUTATIONAL GEOMETRY;

ALGORITHM; DATA INTERPRETATION; DECISION MAKING; ERROR ANALYSIS; GEOMETRY; PRECISION; TWO-DIMENSIONAL MODELING;

EID: 84888366696     PISSN: 10263098     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.scient.2013.04.008     Document Type: Article

References (35)

1. Walley, P. Towards a unified theory of imprecise probability, International Journal of Approximate Reasoning, 24(23), pp. 125-148 (2000).
2. Zadeh, L.A. Fuzzy sets, Information and Control, 8(3), pp. 338-353 (1965).
3. Pawlak, Z. Rough sets, International Journal of Computer and Information Sciences, 11, pp. 341-356 (1982).
4. Löffler, M. Data imprecision in computational geometry, Ph.D. Thesis, University Utrecht (2009).
5. Khanban, A.A. Basic algorithms of computational geometry with imprecise input, Ph.D. Thesis, Department of Computing Imperial College, University of London (2005).
6. Joskowicz, L., Ostrovsky-Berman, Y. and Myers, Y. Efficient representation and computation of geometric uncertainty: the linear parametric model, Precision Engineering, 34(1), pp. 2-6 (2010).
7. Nievergelt, J. and Widmayer, P. Spatial data structures: concepts and design choices, In Algorithmic Foundations of Geographic Information Systems, M. van Kreveld, J. Nievergelt, T. Roos and P. Widmayer, Eds., In Lecture Notes in Computer Science, 1340, Springer-Verlag (1997).
8. LaValle, S.M., Planning Algorithms, University of Illinois, Cambridge University press (2006).
9. Davoodi, M. and Mohades, A. Solving the constrained coverage problem, Applied Soft Computing, 11(1), pp. 963-969 (2011).
10. Ostrovsky-Berman, Y. and Joskowicz, L. Tolerance envelopes of planar mechanical parts with parametric tolerances, Computer-Aided Design, 37(5), pp. 531-544 (2005).
11. Fadili, M.J., Melkemi, M. and El Moataz, A. Non-convex onion-peeling using a shape hull algorithm, Pattern Recognition Letters, 25, pp. 1577-1585 (2004).
12. Gheibi, A., Davoodi, M., Javad, A., Panahi, F., Aghdam, M.M., Asgaripour, M. and Mohades, A. Polygonal shape reconstruction, IET Computer Vision, 5(2), pp. 97-106 (2011).
13. Guibas, L., Salesin, D. and Stolfi, J. Epsilon geometry: building robust algorithms for imprecise computations, Proceeding of the 5th ACM Annual Symposium on Computational Geometry, pp. 208-217 (1989).
14. Segal, M. Using tolerances to guarantee valid polyhedral modeling results, Computer Graphics, 24, pp. 105-114 (1990).
15. Segal, M. and Sequin, C.H. Consistent calculations of solid modeling, Proceeding of the ACM Annual Symposium on Computational Geometry, 24, pp. 29-38 (1985).
16. Löffler, M. and van Kreveld, M. Largest bounding box, smallest diameter, and related problems on imprecise points, Proc. WADS, pp. 446-457 (2007).
17. Löffler, M. and van Kreveld, M. Largest and smallest convex hulls for imprecise points, Algorithmica, 56, pp. 235-269 (2010).
18. Löffler, M. and Snoeyink, J. Delaunay triangulation of imprecise points in linear time after preprocessing, Computational Geometry: Theory and Applications, 43, pp. 234-242 (2010).
19. Myers, Y. and Joskowicz, L. Point distance and orthogonal range problems with dependent geometric uncertainties, Proc. 14th ACM Symp. on Solid and Physical Modeling, NY, USA (2010).
20. Jorgensen, A., Löffler, M. and Phillips, M.J. Geometric computation on indecisive points, 12th Algorithms and Data Structure Symposium (WADS), pp. 536-547 (2011).
21. Introduction to the Global Positioning System for GIS and TRAVERSE, http://www.cmtinc.com/gpsbook/, 2012-06-20.
22. Tasdizen, T. and Whitaker, R. Feature preserving variational smoothing of terrain data, Proc. 2nd Workshop on Variational Geometric and Level Set Methods in Computer Vision (2003).
23. Huising, E.J. and Pereira, L.M.G. Errors and accuracy estimates of laser data acquired by various laser scanning systems for topographic applications, ISPRS Journal of Photogrammetry and Remote Sensing, 53(5), pp. 245-261 (1998).
24. Davoodi, M., Khanteimouri, P., Sheikhi, F. and Mohades, A. Data imprecision under -geometry: finding the largest axis-aligned bounding box, EuroCG 2011, pp. 135-138 (2011).
25. Löffler, M. and Phillips, J. Shape fitting on point sets with probability distributions, In Proc. 17th European Symposium on Algorithms, In LNCS, 5757, pp. 313-324, (2009).
26. Jooyandeh, M.R., Mohades, A. and Mirzakhah, M. Uncertain Voronoi diagram, Information Processing Letters, 109(13), pp. 709-712 (2009).
27. Yap, C.K. Robust geometric computation, in J.E. Goodman and J. ORourke, Eds., In Handbook of Discrete Computational Geometry, CRC Press (2004).
28. Drezner, Z., Facility location: a survey of applications and methods, In Springer Series in Operations Research, Springer Verlag, New York, NY (1995).
29. Shen, Z.J.M., Coullard, C.R. and Daskin, M.S. A joint location inventory model, Transportation Science, 37(1), pp. 40-55 (2003).
30. Rezaei, J. and Davoodi, M. Multi-objective models for lot-sizing with supplier selection, International Journal of Production Economics, 130(1), pp. 77-86 (2011).
31. Davoodi, M., Mohades, A. and Rezaei, J. Solving the constrained pcenter problem using heuristic algorithms, Applied Soft Computing, 11(4), pp. 3321-3328 (2011).
32. Abam, M.A. New data structures and algorithms for mobile data, Ph.D. Thesis, Eindhoven (2007).
33. Speckmann, B. Kinetic data structures, In Encyclopedia of Algorithms, M.-Y. Kao, Ed., pp. 417-419, Springer Verlag (2008).
34. de Berg, M., Cheong, O., van Kreveld, M. and Overmans, M., Computational Geometry: Algorithms and Applications, 3rd. Rev. Ed., Springer-Verlag, Berlin (2008).
35. Lueker, G.S. A data structure for orthogonal range queries, Proc. 19th Annual IEEE Symposium Foundation Computer Science, pp. 28-34 (1978).