Windowing queries using Minkowski sum and their extension to MapReduce

[1]  Sepideh Aghamolaei,et al.  Windowing queries using Minkowski sum and their extension to MapReduce , 2020, The Journal of Supercomputing.

[2]  Leonidas J. Guibas,et al.  Arrangements of Curves in the Plane - Topology, Combinatorics and Algorithms , 2018, Theor. Comput. Sci..

[3]  Micha Sharir,et al.  Separating two simple polygons by a sequence of translations , 2015, Discret. Comput. Geom..

[4]  Nicholas Jing Yuan,et al.  Online Discovery of Gathering Patterns over Trajectories , 2014, IEEE Transactions on Knowledge and Data Engineering.

[5]  Marta Fort,et al.  Computing and visualizing popular places , 2014, Knowledge and Information Systems.

[6]  Karl Bringmann,et al.  Why Walking the Dog Takes Time: Frechet Distance Has No Strongly Subquadratic Algorithms Unless SETH Fails , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[7]  Paraschos Koutris,et al.  Communication steps for parallel query processing , 2013, PODS '13.

[8]  Qin Zhang,et al.  Sorting, Searching, and Simulation in the MapReduce Framework , 2011, ISAAC.

[9]  Xing Xie,et al.  GeoLife: A Collaborative Social Networking Service among User, Location and Trajectory , 2010, IEEE Data Eng. Bull..

[10]  Sariel Har-Peled,et al.  Approximating the Fréchet Distance for Realistic Curves in Near Linear Time , 2010, Discrete & Computational Geometry.

[11]  Sergei Vassilvitskii,et al.  A model of computation for MapReduce , 2010, SODA '10.

[12]  Xing Xie,et al.  Mining interesting locations and travel sequences from GPS trajectories , 2009, WWW '09.

[13]  Wei-Ying Ma,et al.  Understanding mobility based on GPS data , 2008, UbiComp.

[14]  Joachim Gudmundsson,et al.  Finding Popular Places , 2007, Int. J. Comput. Geom. Appl..

[15]  Micha Sharir,et al.  Minkowski Sums of Monotone and General Simple Polygons , 2006, Discret. Comput. Geom..

[16]  Robert Weibel,et al.  Discovering relative motion patterns in groups of moving point objects , 2005, Int. J. Geogr. Inf. Sci..

[17]  Pankaj K. Agarwal,et al.  Approximating extent measures of points , 2004, JACM.

[18]  Sunil Arya,et al.  A simple entropy-based algorithm for planar point location , 2001, SODA '01.

[19]  Gill Barequet,et al.  Translating a Convex Polygon to Contain a Maximum Number of Points , 1997, Comput. Geom..

[20]  Rida T. Farouki,et al.  Computing Minkowski sums of plane curves , 1995, Int. J. Comput. Geom. Appl..

[21]  Gary L. Miller,et al.  Geometric mesh partitioning: implementation and experiments , 1995, Proceedings of 9th International Parallel Processing Symposium.

[22]  Michael T. Goodrich,et al.  Constructing arrangements optimally in parallel , 1993, Discret. Comput. Geom..

[23]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[24]  Michael T. Goodrich,et al.  Intersecting line segments in parallel with an output-sensitive number of processors , 1989, SPAA '89.

[25]  Mark H. Overmars,et al.  New upper bounds in Klee's measure problem , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[26]  Micha Sharir,et al.  Efficient algorithms for planning purely translational collision-free motion in two and three dimensions , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.

[27]  Micha Sharir,et al.  On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles , 1986, Discret. Comput. Geom..

[28]  Leonidas J. Guibas,et al.  Optimal Point Location in a Monotone Subdivision , 1986, SIAM J. Comput..

[29]  Bernard Chazelle,et al.  On a circle placement problem , 1986, Computing.

[30]  I. Haran Efficient Point Location in General Planar Subdivisions using Landmarks , 2006 .

[31]  Marc J. van Kreveld,et al.  Finding REMO - Detecting Relative Motion Patterns in Geospatial Lifelines , 2004, SDH.

[32]  R. Tarjan,et al.  Planar Point Location Using Persistent Search Trees a , 1986, CACM.

[33]  R. V. Benson Euclidean Geometry and Convexity , 1966 .