需求:
根据用户当前坐标,在地图上标注附近的门店。
方案一、使用百度云存储服务
1. 导入所有门店的坐标数据至百度云存储
2. 使用百度地图接口获取附近的坐标点
1. 导入所有门店的坐标数据至百度云存储
2. 使用百度地图接口获取附近的坐标点
方案二、本地实现范围搜索
1. 收集门店坐标
2. 本地实现范围搜索
与项目经理确认后,由于百度云存储方案具有接口及数据的约束,因此采用方案二。
具体流程如下:
1. 采集门店坐标,及坐标对应的geohash入库,其中geohash为索引列
2. 输入用户坐标,并换算为geohash, 并设定其精确度(模糊查询的长度),获取其相邻的8个邻居,共得到9个点
3. 依次左like查询这九个点的范围,获得目标子集
<?php
$lng = $this->_getParam('lng') ? $this->_getParam('lng') : '';
$lat = $this->_getParam('lat') ? $this->_getParam('lat') : '';
//固定范围,很远了还有意义吗
$level = 6;
$geohash = new Com_geohash();
//$geohash->Geohash();
$hash = $geohash->encode($lat , $lng);
//取前缀,前缀约长范围越小
$prefix = substr($hash, 0, $level);
//取出相邻八个区域
$neighbors = $geohash->neighbors($prefix);
array_push($neighbors, $prefix);
$data = array();
foreach($neighbors as $_hash){
$like = array( 'key' => 'geohash',
'value' => $_hash,
);
$store = models_store::getDataList(array(), 0, 0, '', '',$like);
if(!empty($store)) {
foreach ($store as $key => $val) {
$data[] = $val;
}
}
}
给出附件基础类,并感谢原作者。
<?php
/**
* Geohash generation class for php
*
* This file copyright (C) 2013 Bruce Chen (http://weibo.com/smcz)
*
* Author: Bruce Chen (weibo: @一个开发者)
*
*/
/**
*
* Encode and decode geohashes
*
* Find neighbors
*
*/
class Com_geohash {
private $bitss = array(16, 8, 4, 2, 1);
private $neighbors = array();
private $borders = array();
private $coding = "0123456789bcdefghjkmnpqrstuvwxyz";
private $codingMap = array();
function __construct() {
$this->neighbors['right']['even'] = 'bc01fg45238967deuvhjyznpkmstqrwx';
$this->neighbors['left']['even'] = '238967debc01fg45kmstqrwxuvhjyznp';
$this->neighbors['top']['even'] = 'p0r21436x8zb9dcf5h7kjnmqesgutwvy';
$this->neighbors['bottom']['even'] = '14365h7k9dcfesgujnmqp0r2twvyx8zb';
$this->borders['right']['even'] = 'bcfguvyz';
$this->borders['left']['even'] = '0145hjnp';
$this->borders['top']['even'] = 'prxz';
$this->borders['bottom']['even'] = '028b';
$this->neighbors['bottom']['odd'] = $this->neighbors['left']['even'];
$this->neighbors['top']['odd'] = $this->neighbors['right']['even'];
$this->neighbors['left']['odd'] = $this->neighbors['bottom']['even'];
$this->neighbors['right']['odd'] = $this->neighbors['top']['even'];
$this->borders['bottom']['odd'] = $this->borders['left']['even'];
$this->borders['top']['odd'] = $this->borders['right']['even'];
$this->borders['left']['odd'] = $this->borders['bottom']['even'];
$this->borders['right']['odd'] = $this->borders['top']['even'];
//build map from encoding char to 0 padded bitfield
for($i=0; $i<32; $i++) {
$this->codingMap[substr($this->coding, $i, 1)] = str_pad(decbin($i), 5, "0", STR_PAD_LEFT);
}
}
/**
* Decode a geohash and return an array with decimal lat,long in it
* Author: Bruce Chen (weibo: @一个开发者)
*/
public function decode($hash) {
//decode hash into binary string
$binary = "";
$hl = strlen($hash);
for ($i=0; $i<$hl; $i++) {
$binary .= $this->codingMap[substr($hash, $i, 1)];
}
//split the binary into lat and log binary strings
$bl = strlen($binary);
$blat = "";
$blong = "";
for ($i=0; $i<$bl; $i++) {
if ($i%2)
$blat=$blat.substr($binary, $i, 1);
else
$blong=$blong.substr($binary, $i, 1);
}
//now concert to decimal
$lat = $this->binDecode($blat, -90, 90);
$long = $this->binDecode($blong, -180, 180);
//figure out how precise the bit count makes this calculation
$latErr = $this->calcError(strlen($blat), -90, 90);
$longErr = $this->calcError(strlen($blong), -180, 180);
//how many decimal places should we use? There's a little art to
//this to ensure I get the same roundings as geohash.org
$latPlaces = max(1, -round(log10($latErr))) - 1;
$longPlaces = max(1, -round(log10($longErr))) - 1;
//round it
$lat = round($lat, $latPlaces);
$long = round($long, $longPlaces);
return array($lat, $long);
}
private function calculateAdjacent($srcHash, $dir) {
$srcHash = strtolower($srcHash);
$lastChr = $srcHash[strlen($srcHash) - 1];
$type = (strlen($srcHash) % 2) ? 'odd' : 'even';
$base = substr($srcHash, 0, strlen($srcHash) - 1);
if (isset($this->borders[$dir][$type]) && strpos($this->borders[$dir][$type], $lastChr) !== false) {
$base = $this->calculateAdjacent($base, $dir);
}
return $base . $this->coding[strpos($this->neighbors[$dir][$type], $lastChr)];
}
public function neighbors($srcHash) {
$geohashPrefix = substr($srcHash, 0, strlen($srcHash) - 1);
$neighbors['top'] = $this->calculateAdjacent($srcHash, 'top');
$neighbors['bottom'] = $this->calculateAdjacent($srcHash, 'bottom');
$neighbors['right'] = $this->calculateAdjacent($srcHash, 'right');
$neighbors['left'] = $this->calculateAdjacent($srcHash, 'left');
$neighbors['topleft'] = $this->calculateAdjacent($neighbors['left'], 'top');
$neighbors['topright'] = $this->calculateAdjacent($neighbors['right'], 'top');
$neighbors['bottomright'] = $this->calculateAdjacent($neighbors['right'], 'bottom');
$neighbors['bottomleft'] = $this->calculateAdjacent($neighbors['left'], 'bottom');
return $neighbors;
}
/**
* Encode a hash from given lat and long
* Author: Bruce Chen (weibo: @一个开发者)
*/
public function encode($lat, $long) {
//how many bits does latitude need?
$plat = $this->precision($lat);
$latbits = 1;
$err = 45;
while($err > $plat) {
$latbits++;
$err /= 2;
}
//how many bits does longitude need?
$plong = $this->precision($long);
$longbits = 1;
$err = 90;
while($err > $plong) {
$longbits++;
$err /= 2;
}
//bit counts need to be equal
$bits = max($latbits, $longbits);
//as the hash create bits in groups of 5, lets not
//waste any bits - lets bulk it up to a multiple of 5
//and favour the longitude for any odd bits
$longbits = $bits;
$latbits = $bits;
$addlong = 1;
while (($longbits + $latbits) % 5 != 0) {
$longbits += $addlong;
$latbits += !$addlong;
$addlong = !$addlong;
}
//encode each as binary string
$blat = $this->binEncode($lat, -90, 90, $latbits);
$blong = $this->binEncode($long, -180, 180, $longbits);
//merge lat and long together
$binary = "";
$uselong = 1;
while (strlen($blat) + strlen($blong)) {
if ($uselong) {
$binary = $binary.substr($blong, 0, 1);
$blong = substr($blong, 1);
} else {
$binary = $binary.substr($blat, 0, 1);
$blat = substr($blat, 1);
}
$uselong = !$uselong;
}
//convert binary string to hash
$hash = "";
for ($i=0; $i<strlen($binary); $i+=5) {
$n = bindec(substr($binary, $i, 5));
$hash = $hash.$this->coding[$n];
}
return $hash;
}
/**
* What's the maximum error for $bits bits covering a range $min to $max
*/
private function calcError($bits, $min, $max) {
$err = ($max - $min) / 2;
while ($bits--)
$err /= 2;
return $err;
}
/*
* returns precision of number
* precision of 42 is 0.5
* precision of 42.4 is 0.05
* precision of 42.41 is 0.005 etc
*
* Author: Bruce Chen (weibo: @一个开发者)
*/
private function precision($number) {
$precision = 0;
$pt = strpos($number,'.');
if ($pt !== false) {
$precision = -(strlen($number) - $pt - 1);
}
return pow(10, $precision) / 2;
}
/**
* create binary encoding of number as detailed in http://en.wikipedia.org/wiki/Geohash#Example
* removing the tail recursion is left an exercise for the reader
*
* Author: Bruce Chen (weibo: @一个开发者)
*/
private function binEncode($number, $min, $max, $bitcount) {
if ($bitcount == 0)
return "";
#echo "$bitcount: $min $max<br>";
//this is our mid point - we will produce a bit to say
//whether $number is above or below this mid point
$mid = ($min + $max) / 2;
if ($number > $mid)
return "1" . $this->binEncode($number, $mid, $max, $bitcount - 1);
else
return "0" . $this->binEncode($number, $min, $mid, $bitcount - 1);
}
/**
* decodes binary encoding of number as detailed in http://en.wikipedia.org/wiki/Geohash#Example
* removing the tail recursion is left an exercise for the reader
*
* Author: Bruce Chen (weibo: @一个开发者)
*/
private function binDecode($binary, $min, $max) {
$mid = ($min + $max) / 2;
if (strlen($binary) == 0)
return $mid;
$bit = substr($binary, 0, 1);
$binary = substr($binary, 1);
if ($bit == 1)
return $this->binDecode($binary, $mid, $max);
else
return $this->binDecode($binary, $min, $mid);
}
}
参考资料:
GeoHash核心原理解析