algorithm - Meeting of people -


i have dataset of group of person using mobile phone track places (a list of time milliseconds level) , gps coordinates in building (a list of x,y).

given 2 people , timestamp, there way detect whether have met? note mobile phone might have signal delayed when sending coordinate.

a solution think of:

  1. organise time in tree format, merge neighbouring time stamp within 100ms:

enter image description here

  1. for intersection of time frame, check whether have met (i not have concrete idea how check here)

sample data:

datetime x-coordinate y-coordinate floor# user

2016-07-19t16:00:06.071z 103.79321 71.50419428 1 user1

2016-07-19t16:00:06.074z 110.33623 100.6828323 2 user1

2016-07-19t16:00:06.076z 110.066325 86.48873525 1 user2

....


Comments

Popular posts from this blog

java - SSE Emitter : Manage timeouts and complete() -

jquery - uncaught exception: DataTables Editor - remote hosting of code not allowed -

java - How to resolve error - package com.squareup.okhttp3 doesn't exist? -