- // If a house was found make sure there isn't an interpolation line
- // that is closer
- if ($bDoInterpolation && !$bPlaceIsLine && $aPlace && $aPlace['rank_search'] == 30) {
- // get the distance of the house to the search point
- $sSQL = 'SELECT ST_distance('.$sPointSQL.', house.geometry)';
- $sSQL .= ' FROM placex as house WHERE house.place_id='.$iPlaceID;
-
- $fDistancePlacex = chksql(
- $this->oDB->getOne($sSQL),
- "Could not determine distance between searched point and placex house."
- );
-
- // look for an interpolation that is closer
- $aPlaceLine = $this->lookupInterpolation($sPointSQL, $fDistancePlacex);
-
- if ($aPlaceLine) {
- // interpolation is closer to point than placex house
- $bPlaceIsLine = true;
- $aPlace = $aPlaceLine;
- $iPlaceID = $aPlaceLine['place_id'];
- $iParentPlaceID = $aPlaceLine['parent_place_id']; // the street
- $fFraction = $aPlaceLine['fraction'];
+ return null;
+ }
+
+ /**
+ * Search for areas or nodes for areas or nodes between state and suburb level.
+ *
+ * @param string $sPointSQL Search point as SQL string.
+ * @param int $iMaxRank Maximum address rank of the feature.
+ *
+ * @return Record of the found feature or null.
+ *
+ * Searches first for polygon that contains the search point.
+ * If such a polygon is found, place nodes with a higher rank are
+ * searched inside the polygon.
+ */
+ protected function lookupPolygon($sPointSQL, $iMaxRank)
+ {
+ // polygon search begins at suburb-level
+ if ($iMaxRank > 25) $iMaxRank = 25;
+ // no polygon search over country-level
+ if ($iMaxRank < 5) $iMaxRank = 5;
+ // search for polygon
+ $sSQL = 'SELECT place_id, parent_place_id, rank_address, rank_search FROM';
+ $sSQL .= '(select place_id, parent_place_id, rank_address, rank_search, country_code, geometry';
+ $sSQL .= ' FROM placex';
+ $sSQL .= ' WHERE ST_GeometryType(geometry) in (\'ST_Polygon\', \'ST_MultiPolygon\')';
+ $sSQL .= ' AND rank_address Between 5 AND ' .$iMaxRank;
+ $sSQL .= ' AND geometry && '.$sPointSQL;
+ $sSQL .= ' AND type != \'postcode\' ';
+ $sSQL .= ' AND name is not null';
+ $sSQL .= ' AND indexed_status = 0 and linked_place_id is null';
+ $sSQL .= ' ORDER BY rank_address DESC LIMIT 50 ) as a';
+ $sSQL .= ' WHERE ST_CONTAINS(geometry, '.$sPointSQL.' )';
+ $sSQL .= ' ORDER BY rank_address DESC LIMIT 1';
+
+ $aPoly = $this->oDB->getRow($sSQL, null, 'Could not determine polygon containing the point.');
+
+ if ($aPoly) {
+ // if a polygon is found, search for placenodes begins ...
+ $iParentPlaceID = $aPoly['parent_place_id'];
+ $iRankAddress = $aPoly['rank_address'];
+ $iRankSearch = $aPoly['rank_search'];
+ $iPlaceID = $aPoly['place_id'];
+
+ if ($iRankAddress != $iMaxRank) {
+ $sSQL = 'SELECT place_id FROM ';
+ $sSQL .= '(SELECT place_id, rank_search, country_code, geometry,';
+ $sSQL .= ' ST_distance('.$sPointSQL.', geometry) as distance';
+ $sSQL .= ' FROM placex';
+ $sSQL .= ' WHERE osm_type = \'N\'';
+ // using rank_search because of a better differentiation
+ // for place nodes at rank_address 16
+ $sSQL .= ' AND rank_search > '.$iRankSearch;
+ $sSQL .= ' AND rank_search <= '.$iMaxRank;
+ $sSQL .= ' AND class = \'place\'';
+ $sSQL .= ' AND type != \'postcode\'';
+ $sSQL .= ' AND name IS NOT NULL ';
+ $sSQL .= ' AND indexed_status = 0 AND linked_place_id is null';
+ $sSQL .= ' AND ST_DWithin('.$sPointSQL.', geometry, reverse_place_diameter('.$iRankSearch.'::smallint))';
+ $sSQL .= ' ORDER BY distance ASC,';
+ $sSQL .= ' rank_address DESC';
+ $sSQL .= ' limit 500) as a';
+ $sSQL .= ' WHERE ST_CONTAINS((SELECT geometry FROM placex WHERE place_id = '.$iPlaceID.'), geometry )';
+ $sSQL .= ' AND distance <= reverse_place_diameter(rank_search)';
+ $sSQL .= ' ORDER BY distance ASC, rank_search DESC';
+ $sSQL .= ' LIMIT 1';
+
+ if (CONST_Debug) var_dump($sSQL);
+ $aPlacNode = $this->oDB->getRow($sSQL, null, 'Could not determine place node.');
+ if ($aPlacNode) {
+ return $aPlacNode;
+ }