@@ -31,7 +31,7 @@ discard block |
||
| 31 | 31 | * @return Geometry|GeometryCollection |
| 32 | 32 | */ |
| 33 | 33 | public function read($kml) {
|
| 34 | - return $this->geomFromText($kml); |
|
| 34 | + return $this->geomFromText($kml); |
|
| 35 | 35 | } |
| 36 | 36 | |
| 37 | 37 | /** |
@@ -42,218 +42,218 @@ discard block |
||
| 42 | 42 | * @return string The KML string representation of the input geometries |
| 43 | 43 | */ |
| 44 | 44 | public function write(Geometry $geometry, $namespace = FALSE) {
|
| 45 | - if ($namespace) {
|
|
| 46 | - $this->namespace = $namespace; |
|
| 47 | - $this->nss = $namespace.':'; |
|
| 48 | - } |
|
| 49 | - return $this->geometryToKML($geometry); |
|
| 45 | + if ($namespace) {
|
|
| 46 | + $this->namespace = $namespace; |
|
| 47 | + $this->nss = $namespace.':'; |
|
| 48 | + } |
|
| 49 | + return $this->geometryToKML($geometry); |
|
| 50 | 50 | } |
| 51 | 51 | |
| 52 | 52 | public function geomFromText($text) {
|
| 53 | 53 | |
| 54 | - // Change to lower-case and strip all CDATA |
|
| 55 | - $text = mb_strtolower($text, mb_detect_encoding($text)); |
|
| 56 | - $text = preg_replace('/<!\[cdata\[(.*?)\]\]>/s','',$text);
|
|
| 57 | - |
|
| 58 | - // Load into DOMDOcument |
|
| 59 | - $xmlobj = new DOMDocument(); |
|
| 60 | - @$xmlobj->loadXML($text); |
|
| 61 | - if ($xmlobj === false) {
|
|
| 62 | - throw new Exception("Invalid KML: ". $text);
|
|
| 63 | - } |
|
| 64 | - |
|
| 65 | - $this->xmlobj = $xmlobj; |
|
| 66 | - try {
|
|
| 67 | - $geom = $this->geomFromXML(); |
|
| 68 | - } catch(InvalidText $e) {
|
|
| 69 | - throw new Exception("Cannot Read Geometry From KML: ". $text);
|
|
| 70 | - } catch(Exception $e) {
|
|
| 71 | - throw $e; |
|
| 72 | - } |
|
| 73 | - |
|
| 74 | - return $geom; |
|
| 54 | + // Change to lower-case and strip all CDATA |
|
| 55 | + $text = mb_strtolower($text, mb_detect_encoding($text)); |
|
| 56 | + $text = preg_replace('/<!\[cdata\[(.*?)\]\]>/s','',$text);
|
|
| 57 | + |
|
| 58 | + // Load into DOMDOcument |
|
| 59 | + $xmlobj = new DOMDocument(); |
|
| 60 | + @$xmlobj->loadXML($text); |
|
| 61 | + if ($xmlobj === false) {
|
|
| 62 | + throw new Exception("Invalid KML: ". $text);
|
|
| 63 | + } |
|
| 64 | + |
|
| 65 | + $this->xmlobj = $xmlobj; |
|
| 66 | + try {
|
|
| 67 | + $geom = $this->geomFromXML(); |
|
| 68 | + } catch(InvalidText $e) {
|
|
| 69 | + throw new Exception("Cannot Read Geometry From KML: ". $text);
|
|
| 70 | + } catch(Exception $e) {
|
|
| 71 | + throw $e; |
|
| 72 | + } |
|
| 73 | + |
|
| 74 | + return $geom; |
|
| 75 | 75 | } |
| 76 | 76 | |
| 77 | 77 | protected function geomFromXML() {
|
| 78 | - $geometries = array(); |
|
| 79 | - $geom_types = geoPHP::geometryList(); |
|
| 80 | - $placemark_elements = $this->xmlobj->getElementsByTagName('placemark');
|
|
| 81 | - if ($placemark_elements->length) {
|
|
| 82 | - foreach ($placemark_elements as $placemark) {
|
|
| 83 | - foreach ($placemark->childNodes as $child) {
|
|
| 84 | - // Node names are all the same, except for MultiGeometry, which maps to GeometryCollection |
|
| 85 | - $node_name = $child->nodeName == 'multigeometry' ? 'geometrycollection' : $child->nodeName; |
|
| 86 | - if (array_key_exists($node_name, $geom_types)) {
|
|
| 87 | - $function = 'parse'.$geom_types[$node_name]; |
|
| 88 | - $geometries[] = $this->$function($child); |
|
| 89 | - } |
|
| 90 | - } |
|
| 91 | - } |
|
| 92 | - } |
|
| 93 | - else {
|
|
| 94 | - // The document does not have a placemark, try to create a valid geometry from the root element |
|
| 95 | - $node_name = $this->xmlobj->documentElement->nodeName == 'multigeometry' ? 'geometrycollection' : $this->xmlobj->documentElement->nodeName; |
|
| 96 | - if (array_key_exists($node_name, $geom_types)) {
|
|
| 97 | - $function = 'parse'.$geom_types[$node_name]; |
|
| 98 | - $geometries[] = $this->$function($this->xmlobj->documentElement); |
|
| 99 | - } |
|
| 100 | - } |
|
| 101 | - return geoPHP::geometryReduce($geometries); |
|
| 78 | + $geometries = array(); |
|
| 79 | + $geom_types = geoPHP::geometryList(); |
|
| 80 | + $placemark_elements = $this->xmlobj->getElementsByTagName('placemark');
|
|
| 81 | + if ($placemark_elements->length) {
|
|
| 82 | + foreach ($placemark_elements as $placemark) {
|
|
| 83 | + foreach ($placemark->childNodes as $child) {
|
|
| 84 | + // Node names are all the same, except for MultiGeometry, which maps to GeometryCollection |
|
| 85 | + $node_name = $child->nodeName == 'multigeometry' ? 'geometrycollection' : $child->nodeName; |
|
| 86 | + if (array_key_exists($node_name, $geom_types)) {
|
|
| 87 | + $function = 'parse'.$geom_types[$node_name]; |
|
| 88 | + $geometries[] = $this->$function($child); |
|
| 89 | + } |
|
| 90 | + } |
|
| 91 | + } |
|
| 92 | + } |
|
| 93 | + else {
|
|
| 94 | + // The document does not have a placemark, try to create a valid geometry from the root element |
|
| 95 | + $node_name = $this->xmlobj->documentElement->nodeName == 'multigeometry' ? 'geometrycollection' : $this->xmlobj->documentElement->nodeName; |
|
| 96 | + if (array_key_exists($node_name, $geom_types)) {
|
|
| 97 | + $function = 'parse'.$geom_types[$node_name]; |
|
| 98 | + $geometries[] = $this->$function($this->xmlobj->documentElement); |
|
| 99 | + } |
|
| 100 | + } |
|
| 101 | + return geoPHP::geometryReduce($geometries); |
|
| 102 | 102 | } |
| 103 | 103 | |
| 104 | 104 | protected function childElements($xml, $nodename = '') {
|
| 105 | - $children = array(); |
|
| 106 | - if ($xml->childNodes) {
|
|
| 107 | - foreach ($xml->childNodes as $child) {
|
|
| 108 | - if ($child->nodeName == $nodename) {
|
|
| 109 | - $children[] = $child; |
|
| 110 | - } |
|
| 111 | - } |
|
| 112 | - } |
|
| 113 | - return $children; |
|
| 105 | + $children = array(); |
|
| 106 | + if ($xml->childNodes) {
|
|
| 107 | + foreach ($xml->childNodes as $child) {
|
|
| 108 | + if ($child->nodeName == $nodename) {
|
|
| 109 | + $children[] = $child; |
|
| 110 | + } |
|
| 111 | + } |
|
| 112 | + } |
|
| 113 | + return $children; |
|
| 114 | 114 | } |
| 115 | 115 | |
| 116 | 116 | protected function parsePoint($xml) {
|
| 117 | - $coordinates = $this->_extractCoordinates($xml); |
|
| 118 | - return new Point($coordinates[0][0],$coordinates[0][1]); |
|
| 117 | + $coordinates = $this->_extractCoordinates($xml); |
|
| 118 | + return new Point($coordinates[0][0],$coordinates[0][1]); |
|
| 119 | 119 | } |
| 120 | 120 | |
| 121 | 121 | protected function parseLineString($xml) {
|
| 122 | - $coordinates = $this->_extractCoordinates($xml); |
|
| 123 | - $point_array = array(); |
|
| 124 | - foreach ($coordinates as $set) {
|
|
| 125 | - $point_array[] = new Point($set[0],$set[1]); |
|
| 126 | - } |
|
| 127 | - return new LineString($point_array); |
|
| 122 | + $coordinates = $this->_extractCoordinates($xml); |
|
| 123 | + $point_array = array(); |
|
| 124 | + foreach ($coordinates as $set) {
|
|
| 125 | + $point_array[] = new Point($set[0],$set[1]); |
|
| 126 | + } |
|
| 127 | + return new LineString($point_array); |
|
| 128 | 128 | } |
| 129 | 129 | |
| 130 | 130 | protected function parsePolygon($xml) {
|
| 131 | - $components = array(); |
|
| 132 | - |
|
| 133 | - $outer_boundary_element_a = $this->childElements($xml, 'outerboundaryis'); |
|
| 134 | - $outer_boundary_element = $outer_boundary_element_a[0]; |
|
| 135 | - $outer_ring_element_a = $this->childElements($outer_boundary_element, 'linearring'); |
|
| 136 | - $outer_ring_element = $outer_ring_element_a[0]; |
|
| 137 | - $components[] = $this->parseLineString($outer_ring_element); |
|
| 138 | - |
|
| 139 | - if (count($components) != 1) {
|
|
| 140 | - throw new Exception("Invalid KML");
|
|
| 141 | - } |
|
| 142 | - |
|
| 143 | - $inner_boundary_element_a = $this->childElements($xml, 'innerboundaryis'); |
|
| 144 | - if (count($inner_boundary_element_a)) {
|
|
| 145 | - foreach ($inner_boundary_element_a as $inner_boundary_element) {
|
|
| 146 | - foreach ($this->childElements($inner_boundary_element, 'linearring') as $inner_ring_element) {
|
|
| 147 | - $components[] = $this->parseLineString($inner_ring_element); |
|
| 148 | - } |
|
| 149 | - } |
|
| 150 | - } |
|
| 151 | - |
|
| 152 | - return new Polygon($components); |
|
| 131 | + $components = array(); |
|
| 132 | + |
|
| 133 | + $outer_boundary_element_a = $this->childElements($xml, 'outerboundaryis'); |
|
| 134 | + $outer_boundary_element = $outer_boundary_element_a[0]; |
|
| 135 | + $outer_ring_element_a = $this->childElements($outer_boundary_element, 'linearring'); |
|
| 136 | + $outer_ring_element = $outer_ring_element_a[0]; |
|
| 137 | + $components[] = $this->parseLineString($outer_ring_element); |
|
| 138 | + |
|
| 139 | + if (count($components) != 1) {
|
|
| 140 | + throw new Exception("Invalid KML");
|
|
| 141 | + } |
|
| 142 | + |
|
| 143 | + $inner_boundary_element_a = $this->childElements($xml, 'innerboundaryis'); |
|
| 144 | + if (count($inner_boundary_element_a)) {
|
|
| 145 | + foreach ($inner_boundary_element_a as $inner_boundary_element) {
|
|
| 146 | + foreach ($this->childElements($inner_boundary_element, 'linearring') as $inner_ring_element) {
|
|
| 147 | + $components[] = $this->parseLineString($inner_ring_element); |
|
| 148 | + } |
|
| 149 | + } |
|
| 150 | + } |
|
| 151 | + |
|
| 152 | + return new Polygon($components); |
|
| 153 | 153 | } |
| 154 | 154 | |
| 155 | 155 | protected function parseGeometryCollection($xml) {
|
| 156 | - $components = array(); |
|
| 157 | - $geom_types = geoPHP::geometryList(); |
|
| 158 | - foreach ($xml->childNodes as $child) {
|
|
| 159 | - $nodeName = ($child->nodeName == 'linearring') ? 'linestring' : $child->nodeName; |
|
| 160 | - if (array_key_exists($nodeName, $geom_types)) {
|
|
| 161 | - $function = 'parse'.$geom_types[$nodeName]; |
|
| 162 | - $components[] = $this->$function($child); |
|
| 163 | - } |
|
| 164 | - } |
|
| 165 | - return new GeometryCollection($components); |
|
| 156 | + $components = array(); |
|
| 157 | + $geom_types = geoPHP::geometryList(); |
|
| 158 | + foreach ($xml->childNodes as $child) {
|
|
| 159 | + $nodeName = ($child->nodeName == 'linearring') ? 'linestring' : $child->nodeName; |
|
| 160 | + if (array_key_exists($nodeName, $geom_types)) {
|
|
| 161 | + $function = 'parse'.$geom_types[$nodeName]; |
|
| 162 | + $components[] = $this->$function($child); |
|
| 163 | + } |
|
| 164 | + } |
|
| 165 | + return new GeometryCollection($components); |
|
| 166 | 166 | } |
| 167 | 167 | |
| 168 | 168 | protected function _extractCoordinates($xml) {
|
| 169 | - $coord_elements = $this->childElements($xml, 'coordinates'); |
|
| 170 | - $coordinates = array(); |
|
| 171 | - if (count($coord_elements)) {
|
|
| 172 | - $coord_sets = explode(' ', preg_replace('/[\r\n]+/', ' ', $coord_elements[0]->nodeValue));
|
|
| 173 | - foreach ($coord_sets as $set_string) {
|
|
| 174 | - $set_string = trim($set_string); |
|
| 175 | - if ($set_string) {
|
|
| 176 | - $set_array = explode(',',$set_string);
|
|
| 177 | - if (count($set_array) >= 2) {
|
|
| 178 | - $coordinates[] = $set_array; |
|
| 179 | - } |
|
| 180 | - } |
|
| 181 | - } |
|
| 182 | - } |
|
| 183 | - |
|
| 184 | - return $coordinates; |
|
| 169 | + $coord_elements = $this->childElements($xml, 'coordinates'); |
|
| 170 | + $coordinates = array(); |
|
| 171 | + if (count($coord_elements)) {
|
|
| 172 | + $coord_sets = explode(' ', preg_replace('/[\r\n]+/', ' ', $coord_elements[0]->nodeValue));
|
|
| 173 | + foreach ($coord_sets as $set_string) {
|
|
| 174 | + $set_string = trim($set_string); |
|
| 175 | + if ($set_string) {
|
|
| 176 | + $set_array = explode(',',$set_string);
|
|
| 177 | + if (count($set_array) >= 2) {
|
|
| 178 | + $coordinates[] = $set_array; |
|
| 179 | + } |
|
| 180 | + } |
|
| 181 | + } |
|
| 182 | + } |
|
| 183 | + |
|
| 184 | + return $coordinates; |
|
| 185 | 185 | } |
| 186 | 186 | |
| 187 | 187 | private function geometryToKML($geom) {
|
| 188 | - $type = strtolower($geom->getGeomType()); |
|
| 189 | - switch ($type) {
|
|
| 190 | - case 'point': |
|
| 191 | - return $this->pointToKML($geom); |
|
| 192 | - break; |
|
| 193 | - case 'linestring': |
|
| 194 | - return $this->linestringToKML($geom); |
|
| 195 | - break; |
|
| 196 | - case 'polygon': |
|
| 197 | - return $this->polygonToKML($geom); |
|
| 198 | - break; |
|
| 199 | - case 'multipoint': |
|
| 200 | - case 'multilinestring': |
|
| 201 | - case 'multipolygon': |
|
| 202 | - case 'geometrycollection': |
|
| 203 | - return $this->collectionToKML($geom); |
|
| 204 | - break; |
|
| 205 | - } |
|
| 188 | + $type = strtolower($geom->getGeomType()); |
|
| 189 | + switch ($type) {
|
|
| 190 | + case 'point': |
|
| 191 | + return $this->pointToKML($geom); |
|
| 192 | + break; |
|
| 193 | + case 'linestring': |
|
| 194 | + return $this->linestringToKML($geom); |
|
| 195 | + break; |
|
| 196 | + case 'polygon': |
|
| 197 | + return $this->polygonToKML($geom); |
|
| 198 | + break; |
|
| 199 | + case 'multipoint': |
|
| 200 | + case 'multilinestring': |
|
| 201 | + case 'multipolygon': |
|
| 202 | + case 'geometrycollection': |
|
| 203 | + return $this->collectionToKML($geom); |
|
| 204 | + break; |
|
| 205 | + } |
|
| 206 | 206 | } |
| 207 | 207 | |
| 208 | 208 | private function pointToKML($geom) {
|
| 209 | - return '<'.$this->nss.'Point><'.$this->nss.'coordinates>'.$geom->getX().",".$geom->getY().'</'.$this->nss.'coordinates></'.$this->nss.'Point>'; |
|
| 209 | + return '<'.$this->nss.'Point><'.$this->nss.'coordinates>'.$geom->getX().",".$geom->getY().'</'.$this->nss.'coordinates></'.$this->nss.'Point>'; |
|
| 210 | 210 | } |
| 211 | 211 | |
| 212 | 212 | private function linestringToKML($geom, $type = FALSE) {
|
| 213 | - if (!$type) {
|
|
| 214 | - $type = $geom->getGeomType(); |
|
| 215 | - } |
|
| 213 | + if (!$type) {
|
|
| 214 | + $type = $geom->getGeomType(); |
|
| 215 | + } |
|
| 216 | 216 | |
| 217 | - $str = '<'.$this->nss . $type .'>'; |
|
| 217 | + $str = '<'.$this->nss . $type .'>'; |
|
| 218 | 218 | |
| 219 | - if (!$geom->isEmpty()) {
|
|
| 220 | - $str .= '<'.$this->nss.'coordinates>'; |
|
| 221 | - $i=0; |
|
| 222 | - foreach ($geom->getComponents() as $comp) {
|
|
| 223 | - if ($i != 0) $str .= ' '; |
|
| 224 | - $str .= $comp->getX() .','. $comp->getY(); |
|
| 225 | - $i++; |
|
| 226 | - } |
|
| 219 | + if (!$geom->isEmpty()) {
|
|
| 220 | + $str .= '<'.$this->nss.'coordinates>'; |
|
| 221 | + $i=0; |
|
| 222 | + foreach ($geom->getComponents() as $comp) {
|
|
| 223 | + if ($i != 0) $str .= ' '; |
|
| 224 | + $str .= $comp->getX() .','. $comp->getY(); |
|
| 225 | + $i++; |
|
| 226 | + } |
|
| 227 | 227 | |
| 228 | - $str .= '</'.$this->nss.'coordinates>'; |
|
| 229 | - } |
|
| 228 | + $str .= '</'.$this->nss.'coordinates>'; |
|
| 229 | + } |
|
| 230 | 230 | |
| 231 | - $str .= '</'. $this->nss . $type .'>'; |
|
| 231 | + $str .= '</'. $this->nss . $type .'>'; |
|
| 232 | 232 | |
| 233 | - return $str; |
|
| 233 | + return $str; |
|
| 234 | 234 | } |
| 235 | 235 | |
| 236 | 236 | public function polygonToKML($geom) {
|
| 237 | - $components = $geom->getComponents(); |
|
| 238 | - if (!empty($components)) {
|
|
| 239 | - $str = '<'.$this->nss.'outerBoundaryIs>' . $this->linestringToKML($components[0], 'LinearRing') . '</'.$this->nss.'outerBoundaryIs>'; |
|
| 240 | - foreach (array_slice($components, 1) as $comp) {
|
|
| 241 | - $str .= '<'.$this->nss.'innerBoundaryIs>' . $this->linestringToKML($comp) . '</'.$this->nss.'innerBoundaryIs>'; |
|
| 242 | - } |
|
| 243 | - } |
|
| 244 | - |
|
| 245 | - return '<'.$this->nss.'Polygon>'. $str .'</'.$this->nss.'Polygon>'; |
|
| 237 | + $components = $geom->getComponents(); |
|
| 238 | + if (!empty($components)) {
|
|
| 239 | + $str = '<'.$this->nss.'outerBoundaryIs>' . $this->linestringToKML($components[0], 'LinearRing') . '</'.$this->nss.'outerBoundaryIs>'; |
|
| 240 | + foreach (array_slice($components, 1) as $comp) {
|
|
| 241 | + $str .= '<'.$this->nss.'innerBoundaryIs>' . $this->linestringToKML($comp) . '</'.$this->nss.'innerBoundaryIs>'; |
|
| 242 | + } |
|
| 243 | + } |
|
| 244 | + |
|
| 245 | + return '<'.$this->nss.'Polygon>'. $str .'</'.$this->nss.'Polygon>'; |
|
| 246 | 246 | } |
| 247 | 247 | |
| 248 | 248 | public function collectionToKML($geom) {
|
| 249 | - $components = $geom->getComponents(); |
|
| 250 | - $str = '<'.$this->nss.'MultiGeometry>'; |
|
| 251 | - foreach ($geom->getComponents() as $comp) {
|
|
| 252 | - $sub_adapter = new KML(); |
|
| 253 | - $str .= $sub_adapter->write($comp); |
|
| 254 | - } |
|
| 255 | - |
|
| 256 | - return $str .'</'.$this->nss.'MultiGeometry>'; |
|
| 249 | + $components = $geom->getComponents(); |
|
| 250 | + $str = '<'.$this->nss.'MultiGeometry>'; |
|
| 251 | + foreach ($geom->getComponents() as $comp) {
|
|
| 252 | + $sub_adapter = new KML(); |
|
| 253 | + $str .= $sub_adapter->write($comp); |
|
| 254 | + } |
|
| 255 | + |
|
| 256 | + return $str .'</'.$this->nss.'MultiGeometry>'; |
|
| 257 | 257 | } |
| 258 | 258 | |
| 259 | 259 | } |
@@ -12,14 +12,14 @@ |
||
| 12 | 12 | // MultiPoint or a LineString, since they share the same structure (collection |
| 13 | 13 | // of points). So we need to call out the type explicitly. |
| 14 | 14 | public function asArray() { |
| 15 | - $array = array(); |
|
| 16 | - foreach ($this->components as $component) { |
|
| 17 | - $array[] = array( |
|
| 18 | - 'type' => $component->geometryType(), |
|
| 19 | - 'components' => $component->asArray(), |
|
| 20 | - ); |
|
| 21 | - } |
|
| 22 | - return $array; |
|
| 15 | + $array = array(); |
|
| 16 | + foreach ($this->components as $component) { |
|
| 17 | + $array[] = array( |
|
| 18 | + 'type' => $component->geometryType(), |
|
| 19 | + 'components' => $component->asArray(), |
|
| 20 | + ); |
|
| 21 | + } |
|
| 22 | + return $array; |
|
| 23 | 23 | } |
| 24 | 24 | |
| 25 | 25 | // Not valid for this geomettry |
@@ -9,70 +9,70 @@ discard block |
||
| 9 | 9 | protected $geom_type = 'Polygon'; |
| 10 | 10 | |
| 11 | 11 | public function area($exterior_only = FALSE, $signed = FALSE) { |
| 12 | - if ($this->isEmpty()) return 0; |
|
| 12 | + if ($this->isEmpty()) return 0; |
|
| 13 | 13 | |
| 14 | - if ($this->geos() && $exterior_only == FALSE) { |
|
| 15 | - return $this->geos()->area(); |
|
| 16 | - } |
|
| 14 | + if ($this->geos() && $exterior_only == FALSE) { |
|
| 15 | + return $this->geos()->area(); |
|
| 16 | + } |
|
| 17 | 17 | |
| 18 | - $exterior_ring = $this->components[0]; |
|
| 19 | - $pts = $exterior_ring->getComponents(); |
|
| 18 | + $exterior_ring = $this->components[0]; |
|
| 19 | + $pts = $exterior_ring->getComponents(); |
|
| 20 | 20 | |
| 21 | - $c = count($pts); |
|
| 22 | - if((int)$c == '0') return NULL; |
|
| 23 | - $a = '0'; |
|
| 24 | - foreach($pts as $k => $p){ |
|
| 25 | - $j = ($k + 1) % $c; |
|
| 26 | - $a = $a + ($p->getX() * $pts[$j]->getY()) - ($p->getY() * $pts[$j]->getX()); |
|
| 27 | - } |
|
| 21 | + $c = count($pts); |
|
| 22 | + if((int)$c == '0') return NULL; |
|
| 23 | + $a = '0'; |
|
| 24 | + foreach($pts as $k => $p){ |
|
| 25 | + $j = ($k + 1) % $c; |
|
| 26 | + $a = $a + ($p->getX() * $pts[$j]->getY()) - ($p->getY() * $pts[$j]->getX()); |
|
| 27 | + } |
|
| 28 | 28 | |
| 29 | - if ($signed) $area = ($a / 2); |
|
| 30 | - else $area = abs(($a / 2)); |
|
| 29 | + if ($signed) $area = ($a / 2); |
|
| 30 | + else $area = abs(($a / 2)); |
|
| 31 | 31 | |
| 32 | - if ($exterior_only == TRUE) { |
|
| 33 | - return $area; |
|
| 34 | - } |
|
| 35 | - foreach ($this->components as $delta => $component) { |
|
| 36 | - if ($delta != 0) { |
|
| 37 | - $inner_poly = new Polygon(array($component)); |
|
| 38 | - $area -= $inner_poly->area(); |
|
| 39 | - } |
|
| 40 | - } |
|
| 41 | - return $area; |
|
| 32 | + if ($exterior_only == TRUE) { |
|
| 33 | + return $area; |
|
| 34 | + } |
|
| 35 | + foreach ($this->components as $delta => $component) { |
|
| 36 | + if ($delta != 0) { |
|
| 37 | + $inner_poly = new Polygon(array($component)); |
|
| 38 | + $area -= $inner_poly->area(); |
|
| 39 | + } |
|
| 40 | + } |
|
| 41 | + return $area; |
|
| 42 | 42 | } |
| 43 | 43 | |
| 44 | 44 | public function centroid() { |
| 45 | - if ($this->isEmpty()) return NULL; |
|
| 45 | + if ($this->isEmpty()) return NULL; |
|
| 46 | 46 | |
| 47 | - if ($this->geos()) { |
|
| 48 | - return geoPHP::geosToGeometry($this->geos()->centroid()); |
|
| 49 | - } |
|
| 47 | + if ($this->geos()) { |
|
| 48 | + return geoPHP::geosToGeometry($this->geos()->centroid()); |
|
| 49 | + } |
|
| 50 | 50 | |
| 51 | - $exterior_ring = $this->components[0]; |
|
| 52 | - $pts = $exterior_ring->getComponents(); |
|
| 51 | + $exterior_ring = $this->components[0]; |
|
| 52 | + $pts = $exterior_ring->getComponents(); |
|
| 53 | 53 | |
| 54 | - $c = count($pts); |
|
| 55 | - if((int)$c == '0') return NULL; |
|
| 56 | - $cn = array('x' => '0', 'y' => '0'); |
|
| 57 | - $a = $this->area(TRUE, TRUE); |
|
| 54 | + $c = count($pts); |
|
| 55 | + if((int)$c == '0') return NULL; |
|
| 56 | + $cn = array('x' => '0', 'y' => '0'); |
|
| 57 | + $a = $this->area(TRUE, TRUE); |
|
| 58 | 58 | |
| 59 | - // If this is a polygon with no area. Just return the first point. |
|
| 60 | - if ($a == 0) { |
|
| 61 | - return $this->exteriorRing()->pointN(1); |
|
| 62 | - } |
|
| 59 | + // If this is a polygon with no area. Just return the first point. |
|
| 60 | + if ($a == 0) { |
|
| 61 | + return $this->exteriorRing()->pointN(1); |
|
| 62 | + } |
|
| 63 | 63 | |
| 64 | - foreach($pts as $k => $p){ |
|
| 65 | - $j = ($k + 1) % $c; |
|
| 66 | - $P = ($p->getX() * $pts[$j]->getY()) - ($p->getY() * $pts[$j]->getX()); |
|
| 67 | - $cn['x'] = $cn['x'] + ($p->getX() + $pts[$j]->getX()) * $P; |
|
| 68 | - $cn['y'] = $cn['y'] + ($p->getY() + $pts[$j]->getY()) * $P; |
|
| 69 | - } |
|
| 64 | + foreach($pts as $k => $p){ |
|
| 65 | + $j = ($k + 1) % $c; |
|
| 66 | + $P = ($p->getX() * $pts[$j]->getY()) - ($p->getY() * $pts[$j]->getX()); |
|
| 67 | + $cn['x'] = $cn['x'] + ($p->getX() + $pts[$j]->getX()) * $P; |
|
| 68 | + $cn['y'] = $cn['y'] + ($p->getY() + $pts[$j]->getY()) * $P; |
|
| 69 | + } |
|
| 70 | 70 | |
| 71 | - $cn['x'] = $cn['x'] / ( 6 * $a); |
|
| 72 | - $cn['y'] = $cn['y'] / ( 6 * $a); |
|
| 71 | + $cn['x'] = $cn['x'] / ( 6 * $a); |
|
| 72 | + $cn['y'] = $cn['y'] / ( 6 * $a); |
|
| 73 | 73 | |
| 74 | - $centroid = new Point($cn['x'], $cn['y']); |
|
| 75 | - return $centroid; |
|
| 74 | + $centroid = new Point($cn['x'], $cn['y']); |
|
| 75 | + return $centroid; |
|
| 76 | 76 | } |
| 77 | 77 | |
| 78 | 78 | /** |
@@ -98,41 +98,41 @@ discard block |
||
| 98 | 98 | } |
| 99 | 99 | |
| 100 | 100 | public function exteriorRing() { |
| 101 | - if ($this->isEmpty()) return new LineString(); |
|
| 102 | - return $this->components[0]; |
|
| 101 | + if ($this->isEmpty()) return new LineString(); |
|
| 102 | + return $this->components[0]; |
|
| 103 | 103 | } |
| 104 | 104 | |
| 105 | 105 | public function numInteriorRings() { |
| 106 | - if ($this->isEmpty()) return 0; |
|
| 107 | - return $this->numGeometries()-1; |
|
| 106 | + if ($this->isEmpty()) return 0; |
|
| 107 | + return $this->numGeometries()-1; |
|
| 108 | 108 | } |
| 109 | 109 | |
| 110 | 110 | public function interiorRingN($n) { |
| 111 | - return $this->geometryN($n+1); |
|
| 111 | + return $this->geometryN($n+1); |
|
| 112 | 112 | } |
| 113 | 113 | |
| 114 | 114 | public function dimension() { |
| 115 | - if ($this->isEmpty()) return 0; |
|
| 116 | - return 2; |
|
| 115 | + if ($this->isEmpty()) return 0; |
|
| 116 | + return 2; |
|
| 117 | 117 | } |
| 118 | 118 | |
| 119 | 119 | public function isSimple() { |
| 120 | - if ($this->geos()) { |
|
| 121 | - return $this->geos()->isSimple(); |
|
| 122 | - } |
|
| 120 | + if ($this->geos()) { |
|
| 121 | + return $this->geos()->isSimple(); |
|
| 122 | + } |
|
| 123 | 123 | |
| 124 | - $segments = $this->explode(); |
|
| 124 | + $segments = $this->explode(); |
|
| 125 | 125 | |
| 126 | - foreach ($segments as $i => $segment) { |
|
| 127 | - foreach ($segments as $j => $check_segment) { |
|
| 128 | - if ($i != $j) { |
|
| 129 | - if ($segment->lineSegmentIntersect($check_segment)) { |
|
| 130 | - return FALSE; |
|
| 131 | - } |
|
| 132 | - } |
|
| 133 | - } |
|
| 134 | - } |
|
| 135 | - return TRUE; |
|
| 126 | + foreach ($segments as $i => $segment) { |
|
| 127 | + foreach ($segments as $j => $check_segment) { |
|
| 128 | + if ($i != $j) { |
|
| 129 | + if ($segment->lineSegmentIntersect($check_segment)) { |
|
| 130 | + return FALSE; |
|
| 131 | + } |
|
| 132 | + } |
|
| 133 | + } |
|
| 134 | + } |
|
| 135 | + return TRUE; |
|
| 136 | 136 | } |
| 137 | 137 | |
| 138 | 138 | /** |
@@ -146,59 +146,59 @@ discard block |
||
| 146 | 146 | * @return boolean |
| 147 | 147 | */ |
| 148 | 148 | public function pointInPolygon($point, $pointOnBoundary = true, $pointOnVertex = true) { |
| 149 | - $vertices = $this->getPoints(); |
|
| 149 | + $vertices = $this->getPoints(); |
|
| 150 | 150 | |
| 151 | - // Check if the point sits exactly on a vertex |
|
| 152 | - if ($this->pointOnVertex($point, $vertices)) { |
|
| 153 | - return $pointOnVertex ? TRUE : FALSE; |
|
| 154 | - } |
|
| 151 | + // Check if the point sits exactly on a vertex |
|
| 152 | + if ($this->pointOnVertex($point, $vertices)) { |
|
| 153 | + return $pointOnVertex ? TRUE : FALSE; |
|
| 154 | + } |
|
| 155 | 155 | |
| 156 | - // Check if the point is inside the polygon or on the boundary |
|
| 157 | - $intersections = 0; |
|
| 158 | - $vertices_count = count($vertices); |
|
| 156 | + // Check if the point is inside the polygon or on the boundary |
|
| 157 | + $intersections = 0; |
|
| 158 | + $vertices_count = count($vertices); |
|
| 159 | 159 | |
| 160 | - for ($i=1; $i < $vertices_count; $i++) { |
|
| 161 | - $vertex1 = $vertices[$i-1]; |
|
| 162 | - $vertex2 = $vertices[$i]; |
|
| 163 | - if ($vertex1->y() == $vertex2->y() |
|
| 164 | - && $vertex1->y() == $point->y() |
|
| 165 | - && $point->x() > min($vertex1->x(), $vertex2->x()) |
|
| 166 | - && $point->x() < max($vertex1->x(), $vertex2->x())) { |
|
| 167 | - // Check if point is on an horizontal polygon boundary |
|
| 168 | - return $pointOnBoundary ? TRUE : FALSE; |
|
| 169 | - } |
|
| 170 | - if ($point->y() > min($vertex1->y(), $vertex2->y()) |
|
| 171 | - && $point->y() <= max($vertex1->y(), $vertex2->y()) |
|
| 172 | - && $point->x() <= max($vertex1->x(), $vertex2->x()) |
|
| 173 | - && $vertex1->y() != $vertex2->y()) { |
|
| 174 | - $xinters = |
|
| 175 | - ($point->y() - $vertex1->y()) * ($vertex2->x() - $vertex1->x()) |
|
| 176 | - / ($vertex2->y() - $vertex1->y()) |
|
| 177 | - + $vertex1->x(); |
|
| 178 | - if ($xinters == $point->x()) { |
|
| 179 | - // Check if point is on the polygon boundary (other than horizontal) |
|
| 180 | - return $pointOnBoundary ? TRUE : FALSE; |
|
| 181 | - } |
|
| 182 | - if ($vertex1->x() == $vertex2->x() || $point->x() <= $xinters) { |
|
| 183 | - $intersections++; |
|
| 184 | - } |
|
| 185 | - } |
|
| 186 | - } |
|
| 187 | - // If the number of edges we passed through is even, then it's in the polygon. |
|
| 188 | - if ($intersections % 2 != 0) { |
|
| 189 | - return TRUE; |
|
| 190 | - } |
|
| 191 | - else { |
|
| 192 | - return FALSE; |
|
| 193 | - } |
|
| 160 | + for ($i=1; $i < $vertices_count; $i++) { |
|
| 161 | + $vertex1 = $vertices[$i-1]; |
|
| 162 | + $vertex2 = $vertices[$i]; |
|
| 163 | + if ($vertex1->y() == $vertex2->y() |
|
| 164 | + && $vertex1->y() == $point->y() |
|
| 165 | + && $point->x() > min($vertex1->x(), $vertex2->x()) |
|
| 166 | + && $point->x() < max($vertex1->x(), $vertex2->x())) { |
|
| 167 | + // Check if point is on an horizontal polygon boundary |
|
| 168 | + return $pointOnBoundary ? TRUE : FALSE; |
|
| 169 | + } |
|
| 170 | + if ($point->y() > min($vertex1->y(), $vertex2->y()) |
|
| 171 | + && $point->y() <= max($vertex1->y(), $vertex2->y()) |
|
| 172 | + && $point->x() <= max($vertex1->x(), $vertex2->x()) |
|
| 173 | + && $vertex1->y() != $vertex2->y()) { |
|
| 174 | + $xinters = |
|
| 175 | + ($point->y() - $vertex1->y()) * ($vertex2->x() - $vertex1->x()) |
|
| 176 | + / ($vertex2->y() - $vertex1->y()) |
|
| 177 | + + $vertex1->x(); |
|
| 178 | + if ($xinters == $point->x()) { |
|
| 179 | + // Check if point is on the polygon boundary (other than horizontal) |
|
| 180 | + return $pointOnBoundary ? TRUE : FALSE; |
|
| 181 | + } |
|
| 182 | + if ($vertex1->x() == $vertex2->x() || $point->x() <= $xinters) { |
|
| 183 | + $intersections++; |
|
| 184 | + } |
|
| 185 | + } |
|
| 186 | + } |
|
| 187 | + // If the number of edges we passed through is even, then it's in the polygon. |
|
| 188 | + if ($intersections % 2 != 0) { |
|
| 189 | + return TRUE; |
|
| 190 | + } |
|
| 191 | + else { |
|
| 192 | + return FALSE; |
|
| 193 | + } |
|
| 194 | 194 | } |
| 195 | 195 | |
| 196 | 196 | public function pointOnVertex($point) { |
| 197 | - foreach($this->getPoints() as $vertex) { |
|
| 198 | - if ($point->equals($vertex)) { |
|
| 199 | - return true; |
|
| 200 | - } |
|
| 201 | - } |
|
| 197 | + foreach($this->getPoints() as $vertex) { |
|
| 198 | + if ($point->equals($vertex)) { |
|
| 199 | + return true; |
|
| 200 | + } |
|
| 201 | + } |
|
| 202 | 202 | } |
| 203 | 203 | |
| 204 | 204 | |
@@ -18,31 +18,31 @@ discard block |
||
| 18 | 18 | * @param numeric $z The z coordinate (or altitude) - optional |
| 19 | 19 | */ |
| 20 | 20 | public function __construct($x, $y, $z = NULL) { |
| 21 | - // Basic validation on x and y |
|
| 22 | - if (!is_numeric($x) || !is_numeric($y)) { |
|
| 23 | - throw new Exception("Cannot construct Point. x and y should be numeric"); |
|
| 24 | - } |
|
| 25 | - |
|
| 26 | - // Check to see if this is a 3D point |
|
| 27 | - if ($z !== NULL) { |
|
| 28 | - if (!is_numeric($z)) { |
|
| 29 | - throw new Exception("Cannot construct Point. z should be numeric"); |
|
| 30 | - } |
|
| 31 | - $this->dimention = 3; |
|
| 32 | - } |
|
| 33 | - |
|
| 34 | - // Convert to floatval in case they are passed in as a string or integer etc. |
|
| 35 | - $x = floatval($x); |
|
| 36 | - $y = floatval($y); |
|
| 37 | - $z = floatval($z); |
|
| 38 | - |
|
| 39 | - // Add poitional elements |
|
| 40 | - if ($this->dimention == 2) { |
|
| 41 | - $this->coords = array($x, $y); |
|
| 42 | - } |
|
| 43 | - if ($this->dimention == 3) { |
|
| 44 | - $this->coords = array($x, $y, $z); |
|
| 45 | - } |
|
| 21 | + // Basic validation on x and y |
|
| 22 | + if (!is_numeric($x) || !is_numeric($y)) { |
|
| 23 | + throw new Exception("Cannot construct Point. x and y should be numeric"); |
|
| 24 | + } |
|
| 25 | + |
|
| 26 | + // Check to see if this is a 3D point |
|
| 27 | + if ($z !== NULL) { |
|
| 28 | + if (!is_numeric($z)) { |
|
| 29 | + throw new Exception("Cannot construct Point. z should be numeric"); |
|
| 30 | + } |
|
| 31 | + $this->dimention = 3; |
|
| 32 | + } |
|
| 33 | + |
|
| 34 | + // Convert to floatval in case they are passed in as a string or integer etc. |
|
| 35 | + $x = floatval($x); |
|
| 36 | + $y = floatval($y); |
|
| 37 | + $z = floatval($z); |
|
| 38 | + |
|
| 39 | + // Add poitional elements |
|
| 40 | + if ($this->dimention == 2) { |
|
| 41 | + $this->coords = array($x, $y); |
|
| 42 | + } |
|
| 43 | + if ($this->dimention == 3) { |
|
| 44 | + $this->coords = array($x, $y, $z); |
|
| 45 | + } |
|
| 46 | 46 | } |
| 47 | 47 | |
| 48 | 48 | /** |
@@ -51,7 +51,7 @@ discard block |
||
| 51 | 51 | * @return float The X coordinate |
| 52 | 52 | */ |
| 53 | 53 | public function x() { |
| 54 | - return $this->coords[0]; |
|
| 54 | + return $this->coords[0]; |
|
| 55 | 55 | } |
| 56 | 56 | |
| 57 | 57 | /** |
@@ -60,7 +60,7 @@ discard block |
||
| 60 | 60 | * @return float The Y coordinate |
| 61 | 61 | */ |
| 62 | 62 | public function y() { |
| 63 | - return $this->coords[1]; |
|
| 63 | + return $this->coords[1]; |
|
| 64 | 64 | } |
| 65 | 65 | |
| 66 | 66 | /** |
@@ -69,73 +69,73 @@ discard block |
||
| 69 | 69 | * @return float The Z coordinate or NULL is not a 3D point |
| 70 | 70 | */ |
| 71 | 71 | public function z() { |
| 72 | - if ($this->dimention == 3) { |
|
| 73 | - return $this->coords[2]; |
|
| 74 | - } |
|
| 75 | - else return NULL; |
|
| 72 | + if ($this->dimention == 3) { |
|
| 73 | + return $this->coords[2]; |
|
| 74 | + } |
|
| 75 | + else return NULL; |
|
| 76 | 76 | } |
| 77 | 77 | |
| 78 | 78 | // A point's centroid is itself |
| 79 | 79 | public function centroid() { |
| 80 | - return $this; |
|
| 80 | + return $this; |
|
| 81 | 81 | } |
| 82 | 82 | |
| 83 | 83 | public function getBBox() { |
| 84 | - return array( |
|
| 85 | - 'maxy' => $this->getY(), |
|
| 86 | - 'miny' => $this->getY(), |
|
| 87 | - 'maxx' => $this->getX(), |
|
| 88 | - 'minx' => $this->getX(), |
|
| 89 | - ); |
|
| 84 | + return array( |
|
| 85 | + 'maxy' => $this->getY(), |
|
| 86 | + 'miny' => $this->getY(), |
|
| 87 | + 'maxx' => $this->getX(), |
|
| 88 | + 'minx' => $this->getX(), |
|
| 89 | + ); |
|
| 90 | 90 | } |
| 91 | 91 | |
| 92 | 92 | public function asArray($assoc = FALSE) { |
| 93 | - return $this->coords; |
|
| 93 | + return $this->coords; |
|
| 94 | 94 | } |
| 95 | 95 | |
| 96 | 96 | public function area() { |
| 97 | - return 0; |
|
| 97 | + return 0; |
|
| 98 | 98 | } |
| 99 | 99 | |
| 100 | 100 | public function length() { |
| 101 | - return 0; |
|
| 101 | + return 0; |
|
| 102 | 102 | } |
| 103 | 103 | |
| 104 | 104 | public function greatCircleLength() { |
| 105 | - return 0; |
|
| 105 | + return 0; |
|
| 106 | 106 | } |
| 107 | 107 | |
| 108 | 108 | public function haversineLength() { |
| 109 | - return 0; |
|
| 109 | + return 0; |
|
| 110 | 110 | } |
| 111 | 111 | |
| 112 | 112 | // The boundary of a point is itself |
| 113 | 113 | public function boundary() { |
| 114 | - return $this; |
|
| 114 | + return $this; |
|
| 115 | 115 | } |
| 116 | 116 | |
| 117 | 117 | public function dimension() { |
| 118 | - return 0; |
|
| 118 | + return 0; |
|
| 119 | 119 | } |
| 120 | 120 | |
| 121 | 121 | public function isEmpty() { |
| 122 | - return FALSE; |
|
| 122 | + return FALSE; |
|
| 123 | 123 | } |
| 124 | 124 | |
| 125 | 125 | public function numPoints() { |
| 126 | - return 1; |
|
| 126 | + return 1; |
|
| 127 | 127 | } |
| 128 | 128 | |
| 129 | 129 | public function getPoints() { |
| 130 | - return array($this); |
|
| 130 | + return array($this); |
|
| 131 | 131 | } |
| 132 | 132 | |
| 133 | 133 | public function equals($geometry) { |
| 134 | - return ($this->x() == $geometry->x() && $this->y() == $geometry->y()); |
|
| 134 | + return ($this->x() == $geometry->x() && $this->y() == $geometry->y()); |
|
| 135 | 135 | } |
| 136 | 136 | |
| 137 | 137 | public function isSimple() { |
| 138 | - return TRUE; |
|
| 138 | + return TRUE; |
|
| 139 | 139 | } |
| 140 | 140 | |
| 141 | 141 | // Not valid for this geometry type |
@@ -7,11 +7,11 @@ |
||
| 7 | 7 | protected $geom_type = 'MultiPoint'; |
| 8 | 8 | |
| 9 | 9 | public function numPoints() { |
| 10 | - return $this->numGeometries(); |
|
| 10 | + return $this->numGeometries(); |
|
| 11 | 11 | } |
| 12 | 12 | |
| 13 | 13 | public function isSimple() { |
| 14 | - return TRUE; |
|
| 14 | + return TRUE; |
|
| 15 | 15 | } |
| 16 | 16 | |
| 17 | 17 | // Not valid for this geometry type |
@@ -8,12 +8,12 @@ |
||
| 8 | 8 | |
| 9 | 9 | // MultiLineString is closed if all it's components are closed |
| 10 | 10 | public function isClosed() { |
| 11 | - foreach ($this->components as $line) { |
|
| 12 | - if (!$line->isClosed()) { |
|
| 13 | - return FALSE; |
|
| 14 | - } |
|
| 15 | - } |
|
| 16 | - return TRUE; |
|
| 11 | + foreach ($this->components as $line) { |
|
| 12 | + if (!$line->isClosed()) { |
|
| 13 | + return FALSE; |
|
| 14 | + } |
|
| 15 | + } |
|
| 16 | + return TRUE; |
|
| 17 | 17 | } |
| 18 | 18 | |
| 19 | 19 | } |
@@ -18,17 +18,17 @@ discard block |
||
| 18 | 18 | * @param array $components array of geometries |
| 19 | 19 | */ |
| 20 | 20 | public function __construct($components = array()) { |
| 21 | - if (!is_array($components)) { |
|
| 22 | - throw new Exception("Component geometries must be passed as an array"); |
|
| 23 | - } |
|
| 24 | - foreach ($components as $component) { |
|
| 25 | - if ($component instanceof Geometry) { |
|
| 26 | - $this->components[] = $component; |
|
| 27 | - } |
|
| 28 | - else { |
|
| 29 | - throw new Exception("Cannot create a collection with non-geometries"); |
|
| 30 | - } |
|
| 31 | - } |
|
| 21 | + if (!is_array($components)) { |
|
| 22 | + throw new Exception("Component geometries must be passed as an array"); |
|
| 23 | + } |
|
| 24 | + foreach ($components as $component) { |
|
| 25 | + if ($component instanceof Geometry) { |
|
| 26 | + $this->components[] = $component; |
|
| 27 | + } |
|
| 28 | + else { |
|
| 29 | + throw new Exception("Cannot create a collection with non-geometries"); |
|
| 30 | + } |
|
| 31 | + } |
|
| 32 | 32 | } |
| 33 | 33 | |
| 34 | 34 | /** |
@@ -37,244 +37,244 @@ discard block |
||
| 37 | 37 | * @return array |
| 38 | 38 | */ |
| 39 | 39 | public function getComponents() { |
| 40 | - return $this->components; |
|
| 40 | + return $this->components; |
|
| 41 | 41 | } |
| 42 | 42 | |
| 43 | 43 | public function centroid() { |
| 44 | - if ($this->isEmpty()) return NULL; |
|
| 44 | + if ($this->isEmpty()) return NULL; |
|
| 45 | 45 | |
| 46 | - if ($this->geos()) { |
|
| 47 | - $geos_centroid = $this->geos()->centroid(); |
|
| 48 | - if ($geos_centroid->typeName() == 'Point') { |
|
| 49 | - return geoPHP::geosToGeometry($this->geos()->centroid()); |
|
| 50 | - } |
|
| 51 | - } |
|
| 46 | + if ($this->geos()) { |
|
| 47 | + $geos_centroid = $this->geos()->centroid(); |
|
| 48 | + if ($geos_centroid->typeName() == 'Point') { |
|
| 49 | + return geoPHP::geosToGeometry($this->geos()->centroid()); |
|
| 50 | + } |
|
| 51 | + } |
|
| 52 | 52 | |
| 53 | - // As a rough estimate, we say that the centroid of a colletion is the centroid of it's envelope |
|
| 54 | - // @@TODO: Make this the centroid of the convexHull |
|
| 55 | - // Note: Outside of polygons, geometryCollections and the trivial case of points, there is no standard on what a "centroid" is |
|
| 56 | - $centroid = $this->envelope()->centroid(); |
|
| 53 | + // As a rough estimate, we say that the centroid of a colletion is the centroid of it's envelope |
|
| 54 | + // @@TODO: Make this the centroid of the convexHull |
|
| 55 | + // Note: Outside of polygons, geometryCollections and the trivial case of points, there is no standard on what a "centroid" is |
|
| 56 | + $centroid = $this->envelope()->centroid(); |
|
| 57 | 57 | |
| 58 | - return $centroid; |
|
| 58 | + return $centroid; |
|
| 59 | 59 | } |
| 60 | 60 | |
| 61 | 61 | public function getBBox() { |
| 62 | - if ($this->isEmpty()) return NULL; |
|
| 63 | - |
|
| 64 | - if ($this->geos()) { |
|
| 65 | - $envelope = $this->geos()->envelope(); |
|
| 66 | - if ($envelope->typeName() == 'Point') { |
|
| 67 | - return geoPHP::geosToGeometry($envelope)->getBBOX(); |
|
| 68 | - } |
|
| 69 | - |
|
| 70 | - $geos_ring = $envelope->exteriorRing(); |
|
| 71 | - return array( |
|
| 72 | - 'maxy' => $geos_ring->pointN(3)->getY(), |
|
| 73 | - 'miny' => $geos_ring->pointN(1)->getY(), |
|
| 74 | - 'maxx' => $geos_ring->pointN(1)->getX(), |
|
| 75 | - 'minx' => $geos_ring->pointN(3)->getX(), |
|
| 76 | - ); |
|
| 77 | - } |
|
| 78 | - |
|
| 79 | - // Go through each component and get the max and min x and y |
|
| 80 | - $i = 0; |
|
| 81 | - foreach ($this->components as $component) { |
|
| 82 | - $component_bbox = $component->getBBox(); |
|
| 83 | - |
|
| 84 | - // On the first run through, set the bbox to the component bbox |
|
| 85 | - if ($i == 0) { |
|
| 86 | - $maxx = $component_bbox['maxx']; |
|
| 87 | - $maxy = $component_bbox['maxy']; |
|
| 88 | - $minx = $component_bbox['minx']; |
|
| 89 | - $miny = $component_bbox['miny']; |
|
| 90 | - } |
|
| 91 | - |
|
| 92 | - // Do a check and replace on each boundary, slowly growing the bbox |
|
| 93 | - $maxx = $component_bbox['maxx'] > $maxx ? $component_bbox['maxx'] : $maxx; |
|
| 94 | - $maxy = $component_bbox['maxy'] > $maxy ? $component_bbox['maxy'] : $maxy; |
|
| 95 | - $minx = $component_bbox['minx'] < $minx ? $component_bbox['minx'] : $minx; |
|
| 96 | - $miny = $component_bbox['miny'] < $miny ? $component_bbox['miny'] : $miny; |
|
| 97 | - $i++; |
|
| 98 | - } |
|
| 99 | - |
|
| 100 | - return array( |
|
| 101 | - 'maxy' => $maxy, |
|
| 102 | - 'miny' => $miny, |
|
| 103 | - 'maxx' => $maxx, |
|
| 104 | - 'minx' => $minx, |
|
| 105 | - ); |
|
| 62 | + if ($this->isEmpty()) return NULL; |
|
| 63 | + |
|
| 64 | + if ($this->geos()) { |
|
| 65 | + $envelope = $this->geos()->envelope(); |
|
| 66 | + if ($envelope->typeName() == 'Point') { |
|
| 67 | + return geoPHP::geosToGeometry($envelope)->getBBOX(); |
|
| 68 | + } |
|
| 69 | + |
|
| 70 | + $geos_ring = $envelope->exteriorRing(); |
|
| 71 | + return array( |
|
| 72 | + 'maxy' => $geos_ring->pointN(3)->getY(), |
|
| 73 | + 'miny' => $geos_ring->pointN(1)->getY(), |
|
| 74 | + 'maxx' => $geos_ring->pointN(1)->getX(), |
|
| 75 | + 'minx' => $geos_ring->pointN(3)->getX(), |
|
| 76 | + ); |
|
| 77 | + } |
|
| 78 | + |
|
| 79 | + // Go through each component and get the max and min x and y |
|
| 80 | + $i = 0; |
|
| 81 | + foreach ($this->components as $component) { |
|
| 82 | + $component_bbox = $component->getBBox(); |
|
| 83 | + |
|
| 84 | + // On the first run through, set the bbox to the component bbox |
|
| 85 | + if ($i == 0) { |
|
| 86 | + $maxx = $component_bbox['maxx']; |
|
| 87 | + $maxy = $component_bbox['maxy']; |
|
| 88 | + $minx = $component_bbox['minx']; |
|
| 89 | + $miny = $component_bbox['miny']; |
|
| 90 | + } |
|
| 91 | + |
|
| 92 | + // Do a check and replace on each boundary, slowly growing the bbox |
|
| 93 | + $maxx = $component_bbox['maxx'] > $maxx ? $component_bbox['maxx'] : $maxx; |
|
| 94 | + $maxy = $component_bbox['maxy'] > $maxy ? $component_bbox['maxy'] : $maxy; |
|
| 95 | + $minx = $component_bbox['minx'] < $minx ? $component_bbox['minx'] : $minx; |
|
| 96 | + $miny = $component_bbox['miny'] < $miny ? $component_bbox['miny'] : $miny; |
|
| 97 | + $i++; |
|
| 98 | + } |
|
| 99 | + |
|
| 100 | + return array( |
|
| 101 | + 'maxy' => $maxy, |
|
| 102 | + 'miny' => $miny, |
|
| 103 | + 'maxx' => $maxx, |
|
| 104 | + 'minx' => $minx, |
|
| 105 | + ); |
|
| 106 | 106 | } |
| 107 | 107 | |
| 108 | 108 | public function asArray() { |
| 109 | - $array = array(); |
|
| 110 | - foreach ($this->components as $component) { |
|
| 111 | - $array[] = $component->asArray(); |
|
| 112 | - } |
|
| 113 | - return $array; |
|
| 109 | + $array = array(); |
|
| 110 | + foreach ($this->components as $component) { |
|
| 111 | + $array[] = $component->asArray(); |
|
| 112 | + } |
|
| 113 | + return $array; |
|
| 114 | 114 | } |
| 115 | 115 | |
| 116 | 116 | public function area() { |
| 117 | - if ($this->geos()) { |
|
| 118 | - return $this->geos()->area(); |
|
| 119 | - } |
|
| 120 | - |
|
| 121 | - $area = 0; |
|
| 122 | - foreach ($this->components as $component) { |
|
| 123 | - $area += $component->area(); |
|
| 124 | - } |
|
| 125 | - return $area; |
|
| 117 | + if ($this->geos()) { |
|
| 118 | + return $this->geos()->area(); |
|
| 119 | + } |
|
| 120 | + |
|
| 121 | + $area = 0; |
|
| 122 | + foreach ($this->components as $component) { |
|
| 123 | + $area += $component->area(); |
|
| 124 | + } |
|
| 125 | + return $area; |
|
| 126 | 126 | } |
| 127 | 127 | |
| 128 | 128 | // By default, the boundary of a collection is the boundary of it's components |
| 129 | 129 | public function boundary() { |
| 130 | - if ($this->isEmpty()) return new LineString(); |
|
| 130 | + if ($this->isEmpty()) return new LineString(); |
|
| 131 | 131 | |
| 132 | - if ($this->geos()) { |
|
| 133 | - return $this->geos()->boundary(); |
|
| 134 | - } |
|
| 132 | + if ($this->geos()) { |
|
| 133 | + return $this->geos()->boundary(); |
|
| 134 | + } |
|
| 135 | 135 | |
| 136 | - $components_boundaries = array(); |
|
| 137 | - foreach ($this->components as $component) { |
|
| 138 | - $components_boundaries[] = $component->boundary(); |
|
| 139 | - } |
|
| 140 | - return geoPHP::geometryReduce($components_boundaries); |
|
| 136 | + $components_boundaries = array(); |
|
| 137 | + foreach ($this->components as $component) { |
|
| 138 | + $components_boundaries[] = $component->boundary(); |
|
| 139 | + } |
|
| 140 | + return geoPHP::geometryReduce($components_boundaries); |
|
| 141 | 141 | } |
| 142 | 142 | |
| 143 | 143 | public function numGeometries() { |
| 144 | - return count($this->components); |
|
| 144 | + return count($this->components); |
|
| 145 | 145 | } |
| 146 | 146 | |
| 147 | 147 | // Note that the standard is 1 based indexing |
| 148 | 148 | public function geometryN($n) { |
| 149 | - $n = intval($n); |
|
| 150 | - if (array_key_exists($n-1, $this->components)) { |
|
| 151 | - return $this->components[$n-1]; |
|
| 152 | - } |
|
| 153 | - else { |
|
| 154 | - return NULL; |
|
| 155 | - } |
|
| 149 | + $n = intval($n); |
|
| 150 | + if (array_key_exists($n-1, $this->components)) { |
|
| 151 | + return $this->components[$n-1]; |
|
| 152 | + } |
|
| 153 | + else { |
|
| 154 | + return NULL; |
|
| 155 | + } |
|
| 156 | 156 | } |
| 157 | 157 | |
| 158 | 158 | public function length() { |
| 159 | - $length = 0; |
|
| 160 | - foreach ($this->components as $delta => $component) { |
|
| 161 | - $length += $component->length(); |
|
| 162 | - } |
|
| 163 | - return $length; |
|
| 159 | + $length = 0; |
|
| 160 | + foreach ($this->components as $delta => $component) { |
|
| 161 | + $length += $component->length(); |
|
| 162 | + } |
|
| 163 | + return $length; |
|
| 164 | 164 | } |
| 165 | 165 | |
| 166 | 166 | public function greatCircleLength($radius = 6378137) { |
| 167 | - $length = 0; |
|
| 168 | - foreach ($this->components as $component) { |
|
| 169 | - $length += $component->greatCircleLength($radius); |
|
| 170 | - } |
|
| 171 | - return $length; |
|
| 167 | + $length = 0; |
|
| 168 | + foreach ($this->components as $component) { |
|
| 169 | + $length += $component->greatCircleLength($radius); |
|
| 170 | + } |
|
| 171 | + return $length; |
|
| 172 | 172 | } |
| 173 | 173 | |
| 174 | 174 | public function haversineLength() { |
| 175 | - $length = 0; |
|
| 176 | - foreach ($this->components as $component) { |
|
| 177 | - $length += $component->haversineLength(); |
|
| 178 | - } |
|
| 179 | - return $length; |
|
| 175 | + $length = 0; |
|
| 176 | + foreach ($this->components as $component) { |
|
| 177 | + $length += $component->haversineLength(); |
|
| 178 | + } |
|
| 179 | + return $length; |
|
| 180 | 180 | } |
| 181 | 181 | |
| 182 | 182 | public function dimension() { |
| 183 | - $dimension = 0; |
|
| 184 | - foreach ($this->components as $component) { |
|
| 185 | - if ($component->dimension() > $dimension) { |
|
| 186 | - $dimension = $component->dimension(); |
|
| 187 | - } |
|
| 188 | - } |
|
| 189 | - return $dimension; |
|
| 183 | + $dimension = 0; |
|
| 184 | + foreach ($this->components as $component) { |
|
| 185 | + if ($component->dimension() > $dimension) { |
|
| 186 | + $dimension = $component->dimension(); |
|
| 187 | + } |
|
| 188 | + } |
|
| 189 | + return $dimension; |
|
| 190 | 190 | } |
| 191 | 191 | |
| 192 | 192 | // A collection is empty if it has no components OR all it's components are empty |
| 193 | 193 | public function isEmpty() { |
| 194 | - if (!count($this->components)) { |
|
| 195 | - return TRUE; |
|
| 196 | - } |
|
| 197 | - else { |
|
| 198 | - foreach ($this->components as $component) { |
|
| 199 | - if (!$component->isEmpty()) return FALSE; |
|
| 200 | - } |
|
| 201 | - return TRUE; |
|
| 202 | - } |
|
| 194 | + if (!count($this->components)) { |
|
| 195 | + return TRUE; |
|
| 196 | + } |
|
| 197 | + else { |
|
| 198 | + foreach ($this->components as $component) { |
|
| 199 | + if (!$component->isEmpty()) return FALSE; |
|
| 200 | + } |
|
| 201 | + return TRUE; |
|
| 202 | + } |
|
| 203 | 203 | } |
| 204 | 204 | |
| 205 | 205 | public function numPoints() { |
| 206 | - $num = 0; |
|
| 207 | - foreach ($this->components as $component) { |
|
| 208 | - $num += $component->numPoints(); |
|
| 209 | - } |
|
| 210 | - return $num; |
|
| 206 | + $num = 0; |
|
| 207 | + foreach ($this->components as $component) { |
|
| 208 | + $num += $component->numPoints(); |
|
| 209 | + } |
|
| 210 | + return $num; |
|
| 211 | 211 | } |
| 212 | 212 | |
| 213 | 213 | public function getPoints() { |
| 214 | - $points = array(); |
|
| 215 | - foreach ($this->components as $component) { |
|
| 216 | - $points = array_merge($points, $component->getPoints()); |
|
| 217 | - } |
|
| 218 | - return $points; |
|
| 214 | + $points = array(); |
|
| 215 | + foreach ($this->components as $component) { |
|
| 216 | + $points = array_merge($points, $component->getPoints()); |
|
| 217 | + } |
|
| 218 | + return $points; |
|
| 219 | 219 | } |
| 220 | 220 | |
| 221 | 221 | public function equals($geometry) { |
| 222 | - if ($this->geos()) { |
|
| 223 | - return $this->geos()->equals($geometry->geos()); |
|
| 224 | - } |
|
| 225 | - |
|
| 226 | - // To test for equality we check to make sure that there is a matching point |
|
| 227 | - // in the other geometry for every point in this geometry. |
|
| 228 | - // This is slightly more strict than the standard, which |
|
| 229 | - // uses Within(A,B) = true and Within(B,A) = true |
|
| 230 | - // @@TODO: Eventually we could fix this by using some sort of simplification |
|
| 231 | - // method that strips redundant vertices (that are all in a row) |
|
| 232 | - |
|
| 233 | - $this_points = $this->getPoints(); |
|
| 234 | - $other_points = $geometry->getPoints(); |
|
| 235 | - |
|
| 236 | - // First do a check to make sure they have the same number of vertices |
|
| 237 | - if (count($this_points) != count($other_points)) { |
|
| 238 | - return FALSE; |
|
| 239 | - } |
|
| 240 | - |
|
| 241 | - foreach ($this_points as $point) { |
|
| 242 | - $found_match = FALSE; |
|
| 243 | - foreach ($other_points as $key => $test_point) { |
|
| 244 | - if ($point->equals($test_point)) { |
|
| 245 | - $found_match = TRUE; |
|
| 246 | - unset($other_points[$key]); |
|
| 247 | - break; |
|
| 248 | - } |
|
| 249 | - } |
|
| 250 | - if (!$found_match) { |
|
| 251 | - return FALSE; |
|
| 252 | - } |
|
| 253 | - } |
|
| 254 | - |
|
| 255 | - // All points match, return TRUE |
|
| 256 | - return TRUE; |
|
| 222 | + if ($this->geos()) { |
|
| 223 | + return $this->geos()->equals($geometry->geos()); |
|
| 224 | + } |
|
| 225 | + |
|
| 226 | + // To test for equality we check to make sure that there is a matching point |
|
| 227 | + // in the other geometry for every point in this geometry. |
|
| 228 | + // This is slightly more strict than the standard, which |
|
| 229 | + // uses Within(A,B) = true and Within(B,A) = true |
|
| 230 | + // @@TODO: Eventually we could fix this by using some sort of simplification |
|
| 231 | + // method that strips redundant vertices (that are all in a row) |
|
| 232 | + |
|
| 233 | + $this_points = $this->getPoints(); |
|
| 234 | + $other_points = $geometry->getPoints(); |
|
| 235 | + |
|
| 236 | + // First do a check to make sure they have the same number of vertices |
|
| 237 | + if (count($this_points) != count($other_points)) { |
|
| 238 | + return FALSE; |
|
| 239 | + } |
|
| 240 | + |
|
| 241 | + foreach ($this_points as $point) { |
|
| 242 | + $found_match = FALSE; |
|
| 243 | + foreach ($other_points as $key => $test_point) { |
|
| 244 | + if ($point->equals($test_point)) { |
|
| 245 | + $found_match = TRUE; |
|
| 246 | + unset($other_points[$key]); |
|
| 247 | + break; |
|
| 248 | + } |
|
| 249 | + } |
|
| 250 | + if (!$found_match) { |
|
| 251 | + return FALSE; |
|
| 252 | + } |
|
| 253 | + } |
|
| 254 | + |
|
| 255 | + // All points match, return TRUE |
|
| 256 | + return TRUE; |
|
| 257 | 257 | } |
| 258 | 258 | |
| 259 | 259 | public function isSimple() { |
| 260 | - if ($this->geos()) { |
|
| 261 | - return $this->geos()->isSimple(); |
|
| 262 | - } |
|
| 260 | + if ($this->geos()) { |
|
| 261 | + return $this->geos()->isSimple(); |
|
| 262 | + } |
|
| 263 | 263 | |
| 264 | - // A collection is simple if all it's components are simple |
|
| 265 | - foreach ($this->components as $component) { |
|
| 266 | - if (!$component->isSimple()) return FALSE; |
|
| 267 | - } |
|
| 264 | + // A collection is simple if all it's components are simple |
|
| 265 | + foreach ($this->components as $component) { |
|
| 266 | + if (!$component->isSimple()) return FALSE; |
|
| 267 | + } |
|
| 268 | 268 | |
| 269 | - return TRUE; |
|
| 269 | + return TRUE; |
|
| 270 | 270 | } |
| 271 | 271 | |
| 272 | 272 | public function explode() { |
| 273 | - $parts = array(); |
|
| 274 | - foreach ($this->components as $component) { |
|
| 275 | - $parts = array_merge($parts, $component->explode()); |
|
| 276 | - } |
|
| 277 | - return $parts; |
|
| 273 | + $parts = array(); |
|
| 274 | + foreach ($this->components as $component) { |
|
| 275 | + $parts = array_merge($parts, $component->explode()); |
|
| 276 | + } |
|
| 277 | + return $parts; |
|
| 278 | 278 | } |
| 279 | 279 | |
| 280 | 280 | // Not valid for this geometry type |
@@ -19,173 +19,173 @@ |
||
| 19 | 19 | throw new Exception("Cannot construct a LineString with a single point"); |
| 20 | 20 | } |
| 21 | 21 | */ |
| 22 | - // Call the Collection constructor to build the LineString |
|
| 23 | - parent::__construct($points); |
|
| 22 | + // Call the Collection constructor to build the LineString |
|
| 23 | + parent::__construct($points); |
|
| 24 | 24 | } |
| 25 | 25 | |
| 26 | 26 | // The boundary of a linestring is itself |
| 27 | 27 | public function boundary() { |
| 28 | - return $this; |
|
| 28 | + return $this; |
|
| 29 | 29 | } |
| 30 | 30 | |
| 31 | 31 | public function startPoint() { |
| 32 | - return $this->pointN(1); |
|
| 32 | + return $this->pointN(1); |
|
| 33 | 33 | } |
| 34 | 34 | |
| 35 | 35 | public function endPoint() { |
| 36 | - $last_n = $this->numPoints(); |
|
| 37 | - return $this->pointN($last_n); |
|
| 36 | + $last_n = $this->numPoints(); |
|
| 37 | + return $this->pointN($last_n); |
|
| 38 | 38 | } |
| 39 | 39 | |
| 40 | 40 | public function isClosed() { |
| 41 | - return ($this->startPoint()->equals($this->endPoint())); |
|
| 41 | + return ($this->startPoint()->equals($this->endPoint())); |
|
| 42 | 42 | } |
| 43 | 43 | |
| 44 | 44 | public function isRing() { |
| 45 | - return ($this->isClosed() && $this->isSimple()); |
|
| 45 | + return ($this->isClosed() && $this->isSimple()); |
|
| 46 | 46 | } |
| 47 | 47 | |
| 48 | 48 | public function numPoints() { |
| 49 | - return $this->numGeometries(); |
|
| 49 | + return $this->numGeometries(); |
|
| 50 | 50 | } |
| 51 | 51 | |
| 52 | 52 | public function pointN($n) { |
| 53 | - return $this->geometryN($n); |
|
| 53 | + return $this->geometryN($n); |
|
| 54 | 54 | } |
| 55 | 55 | |
| 56 | 56 | public function dimension() { |
| 57 | - if ($this->isEmpty()) return 0; |
|
| 58 | - return 1; |
|
| 57 | + if ($this->isEmpty()) return 0; |
|
| 58 | + return 1; |
|
| 59 | 59 | } |
| 60 | 60 | |
| 61 | 61 | public function area() { |
| 62 | - return 0; |
|
| 62 | + return 0; |
|
| 63 | 63 | } |
| 64 | 64 | |
| 65 | 65 | public function length() { |
| 66 | - if ($this->geos()) { |
|
| 67 | - return $this->geos()->length(); |
|
| 68 | - } |
|
| 69 | - $length = 0; |
|
| 70 | - foreach ($this->getPoints() as $delta => $point) { |
|
| 71 | - $previous_point = $this->geometryN($delta); |
|
| 72 | - if ($previous_point) { |
|
| 73 | - $length += sqrt(pow(($previous_point->getX() - $point->getX()), 2) + pow(($previous_point->getY()- $point->getY()), 2)); |
|
| 74 | - } |
|
| 75 | - } |
|
| 76 | - return $length; |
|
| 66 | + if ($this->geos()) { |
|
| 67 | + return $this->geos()->length(); |
|
| 68 | + } |
|
| 69 | + $length = 0; |
|
| 70 | + foreach ($this->getPoints() as $delta => $point) { |
|
| 71 | + $previous_point = $this->geometryN($delta); |
|
| 72 | + if ($previous_point) { |
|
| 73 | + $length += sqrt(pow(($previous_point->getX() - $point->getX()), 2) + pow(($previous_point->getY()- $point->getY()), 2)); |
|
| 74 | + } |
|
| 75 | + } |
|
| 76 | + return $length; |
|
| 77 | 77 | } |
| 78 | 78 | |
| 79 | 79 | public function greatCircleLength($radius = 6378137) { |
| 80 | - $length = 0; |
|
| 81 | - $points = $this->getPoints(); |
|
| 82 | - for($i=0; $i<$this->numPoints()-1; $i++) { |
|
| 83 | - $point = $points[$i]; |
|
| 84 | - $next_point = $points[$i+1]; |
|
| 85 | - if (!is_object($next_point)) {continue;} |
|
| 86 | - // Great circle method |
|
| 87 | - $lat1 = deg2rad($point->getY()); |
|
| 88 | - $lat2 = deg2rad($next_point->getY()); |
|
| 89 | - $lon1 = deg2rad($point->getX()); |
|
| 90 | - $lon2 = deg2rad($next_point->getX()); |
|
| 91 | - $dlon = $lon2 - $lon1; |
|
| 92 | - $length += |
|
| 93 | - $radius * |
|
| 94 | - atan2( |
|
| 95 | - sqrt( |
|
| 96 | - pow(cos($lat2) * sin($dlon), 2) + |
|
| 97 | - pow(cos($lat1) * sin($lat2) - sin($lat1) * cos($lat2) * cos($dlon), 2) |
|
| 98 | - ) |
|
| 99 | - , |
|
| 100 | - sin($lat1) * sin($lat2) + |
|
| 101 | - cos($lat1) * cos($lat2) * cos($dlon) |
|
| 102 | - ); |
|
| 103 | - } |
|
| 104 | - // Returns length in meters. |
|
| 105 | - return $length; |
|
| 80 | + $length = 0; |
|
| 81 | + $points = $this->getPoints(); |
|
| 82 | + for($i=0; $i<$this->numPoints()-1; $i++) { |
|
| 83 | + $point = $points[$i]; |
|
| 84 | + $next_point = $points[$i+1]; |
|
| 85 | + if (!is_object($next_point)) {continue;} |
|
| 86 | + // Great circle method |
|
| 87 | + $lat1 = deg2rad($point->getY()); |
|
| 88 | + $lat2 = deg2rad($next_point->getY()); |
|
| 89 | + $lon1 = deg2rad($point->getX()); |
|
| 90 | + $lon2 = deg2rad($next_point->getX()); |
|
| 91 | + $dlon = $lon2 - $lon1; |
|
| 92 | + $length += |
|
| 93 | + $radius * |
|
| 94 | + atan2( |
|
| 95 | + sqrt( |
|
| 96 | + pow(cos($lat2) * sin($dlon), 2) + |
|
| 97 | + pow(cos($lat1) * sin($lat2) - sin($lat1) * cos($lat2) * cos($dlon), 2) |
|
| 98 | + ) |
|
| 99 | + , |
|
| 100 | + sin($lat1) * sin($lat2) + |
|
| 101 | + cos($lat1) * cos($lat2) * cos($dlon) |
|
| 102 | + ); |
|
| 103 | + } |
|
| 104 | + // Returns length in meters. |
|
| 105 | + return $length; |
|
| 106 | 106 | } |
| 107 | 107 | |
| 108 | 108 | public function haversineLength() { |
| 109 | - $degrees = 0; |
|
| 110 | - $points = $this->getPoints(); |
|
| 111 | - for($i=0; $i<$this->numPoints()-1; $i++) { |
|
| 112 | - $point = $points[$i]; |
|
| 113 | - $next_point = $points[$i+1]; |
|
| 114 | - if (!is_object($next_point)) {continue;} |
|
| 115 | - $degree = rad2deg( |
|
| 116 | - acos( |
|
| 117 | - sin(deg2rad($point->getY())) * sin(deg2rad($next_point->getY())) + |
|
| 118 | - cos(deg2rad($point->getY())) * cos(deg2rad($next_point->getY())) * |
|
| 119 | - cos(deg2rad(abs($point->getX() - $next_point->getX()))) |
|
| 120 | - ) |
|
| 121 | - ); |
|
| 122 | - $degrees += $degree; |
|
| 123 | - } |
|
| 124 | - // Returns degrees |
|
| 125 | - return $degrees; |
|
| 109 | + $degrees = 0; |
|
| 110 | + $points = $this->getPoints(); |
|
| 111 | + for($i=0; $i<$this->numPoints()-1; $i++) { |
|
| 112 | + $point = $points[$i]; |
|
| 113 | + $next_point = $points[$i+1]; |
|
| 114 | + if (!is_object($next_point)) {continue;} |
|
| 115 | + $degree = rad2deg( |
|
| 116 | + acos( |
|
| 117 | + sin(deg2rad($point->getY())) * sin(deg2rad($next_point->getY())) + |
|
| 118 | + cos(deg2rad($point->getY())) * cos(deg2rad($next_point->getY())) * |
|
| 119 | + cos(deg2rad(abs($point->getX() - $next_point->getX()))) |
|
| 120 | + ) |
|
| 121 | + ); |
|
| 122 | + $degrees += $degree; |
|
| 123 | + } |
|
| 124 | + // Returns degrees |
|
| 125 | + return $degrees; |
|
| 126 | 126 | } |
| 127 | 127 | |
| 128 | 128 | public function explode() { |
| 129 | - $parts = array(); |
|
| 130 | - $points = $this->getPoints(); |
|
| 129 | + $parts = array(); |
|
| 130 | + $points = $this->getPoints(); |
|
| 131 | 131 | |
| 132 | - foreach ($points as $i => $point) { |
|
| 133 | - if (isset($points[$i+1])) { |
|
| 134 | - $parts[] = new LineString(array($point, $points[$i+1])); |
|
| 135 | - } |
|
| 136 | - } |
|
| 137 | - return $parts; |
|
| 132 | + foreach ($points as $i => $point) { |
|
| 133 | + if (isset($points[$i+1])) { |
|
| 134 | + $parts[] = new LineString(array($point, $points[$i+1])); |
|
| 135 | + } |
|
| 136 | + } |
|
| 137 | + return $parts; |
|
| 138 | 138 | } |
| 139 | 139 | |
| 140 | 140 | public function isSimple() { |
| 141 | - if ($this->geos()) { |
|
| 142 | - return $this->geos()->isSimple(); |
|
| 143 | - } |
|
| 141 | + if ($this->geos()) { |
|
| 142 | + return $this->geos()->isSimple(); |
|
| 143 | + } |
|
| 144 | 144 | |
| 145 | - $segments = $this->explode(); |
|
| 145 | + $segments = $this->explode(); |
|
| 146 | 146 | |
| 147 | - foreach ($segments as $i => $segment) { |
|
| 148 | - foreach ($segments as $j => $check_segment) { |
|
| 149 | - if ($i != $j) { |
|
| 150 | - if ($segment->lineSegmentIntersect($check_segment)) { |
|
| 151 | - return FALSE; |
|
| 152 | - } |
|
| 153 | - } |
|
| 154 | - } |
|
| 155 | - } |
|
| 156 | - return TRUE; |
|
| 147 | + foreach ($segments as $i => $segment) { |
|
| 148 | + foreach ($segments as $j => $check_segment) { |
|
| 149 | + if ($i != $j) { |
|
| 150 | + if ($segment->lineSegmentIntersect($check_segment)) { |
|
| 151 | + return FALSE; |
|
| 152 | + } |
|
| 153 | + } |
|
| 154 | + } |
|
| 155 | + } |
|
| 156 | + return TRUE; |
|
| 157 | 157 | } |
| 158 | 158 | |
| 159 | 159 | // Utility function to check if any line sigments intersect |
| 160 | 160 | // Derived from http://stackoverflow.com/questions/563198/how-do-you-detect-where-two-line-segments-intersect |
| 161 | 161 | public function lineSegmentIntersect($segment) { |
| 162 | - $p0_x = $this->startPoint()->x(); |
|
| 163 | - $p0_y = $this->startPoint()->y(); |
|
| 164 | - $p1_x = $this->endPoint()->x(); |
|
| 165 | - $p1_y = $this->endPoint()->y(); |
|
| 166 | - $p2_x = $segment->startPoint()->x(); |
|
| 167 | - $p2_y = $segment->startPoint()->y(); |
|
| 168 | - $p3_x = $segment->endPoint()->x(); |
|
| 169 | - $p3_y = $segment->endPoint()->y(); |
|
| 170 | - |
|
| 171 | - $s1_x = $p1_x - $p0_x; $s1_y = $p1_y - $p0_y; |
|
| 172 | - $s2_x = $p3_x - $p2_x; $s2_y = $p3_y - $p2_y; |
|
| 173 | - |
|
| 174 | - $fps = (-$s2_x * $s1_y) + ($s1_x * $s2_y); |
|
| 175 | - $fpt = (-$s2_x * $s1_y) + ($s1_x * $s2_y); |
|
| 176 | - |
|
| 177 | - if ($fps == 0 || $fpt == 0) { |
|
| 178 | - return FALSE; |
|
| 179 | - } |
|
| 180 | - |
|
| 181 | - $s = (-$s1_y * ($p0_x - $p2_x) + $s1_x * ($p0_y - $p2_y)) / $fps; |
|
| 182 | - $t = ( $s2_x * ($p0_y - $p2_y) - $s2_y * ($p0_x - $p2_x)) / $fpt; |
|
| 183 | - |
|
| 184 | - if ($s > 0 && $s < 1 && $t > 0 && $t < 1) { |
|
| 185 | - // Collision detected |
|
| 186 | - return TRUE; |
|
| 187 | - } |
|
| 188 | - return FALSE; |
|
| 162 | + $p0_x = $this->startPoint()->x(); |
|
| 163 | + $p0_y = $this->startPoint()->y(); |
|
| 164 | + $p1_x = $this->endPoint()->x(); |
|
| 165 | + $p1_y = $this->endPoint()->y(); |
|
| 166 | + $p2_x = $segment->startPoint()->x(); |
|
| 167 | + $p2_y = $segment->startPoint()->y(); |
|
| 168 | + $p3_x = $segment->endPoint()->x(); |
|
| 169 | + $p3_y = $segment->endPoint()->y(); |
|
| 170 | + |
|
| 171 | + $s1_x = $p1_x - $p0_x; $s1_y = $p1_y - $p0_y; |
|
| 172 | + $s2_x = $p3_x - $p2_x; $s2_y = $p3_y - $p2_y; |
|
| 173 | + |
|
| 174 | + $fps = (-$s2_x * $s1_y) + ($s1_x * $s2_y); |
|
| 175 | + $fpt = (-$s2_x * $s1_y) + ($s1_x * $s2_y); |
|
| 176 | + |
|
| 177 | + if ($fps == 0 || $fpt == 0) { |
|
| 178 | + return FALSE; |
|
| 179 | + } |
|
| 180 | + |
|
| 181 | + $s = (-$s1_y * ($p0_x - $p2_x) + $s1_x * ($p0_y - $p2_y)) / $fps; |
|
| 182 | + $t = ( $s2_x * ($p0_y - $p2_y) - $s2_y * ($p0_x - $p2_x)) / $fpt; |
|
| 183 | + |
|
| 184 | + if ($s > 0 && $s < 1 && $t > 0 && $t < 1) { |
|
| 185 | + // Collision detected |
|
| 186 | + return TRUE; |
|
| 187 | + } |
|
| 188 | + return FALSE; |
|
| 189 | 189 | } |
| 190 | 190 | } |
| 191 | 191 | |
@@ -46,38 +46,38 @@ discard block |
||
| 46 | 46 | // Public: Standard -- Common to all geometries |
| 47 | 47 | // -------------------------------------------- |
| 48 | 48 | public function SRID() { |
| 49 | - return $this->srid; |
|
| 49 | + return $this->srid; |
|
| 50 | 50 | } |
| 51 | 51 | |
| 52 | 52 | public function setSRID($srid) { |
| 53 | - if ($this->geos()) { |
|
| 54 | - $this->geos()->setSRID($srid); |
|
| 55 | - } |
|
| 56 | - $this->srid = $srid; |
|
| 53 | + if ($this->geos()) { |
|
| 54 | + $this->geos()->setSRID($srid); |
|
| 55 | + } |
|
| 56 | + $this->srid = $srid; |
|
| 57 | 57 | } |
| 58 | 58 | |
| 59 | 59 | public function envelope() { |
| 60 | - if ($this->isEmpty()) return new Polygon(); |
|
| 60 | + if ($this->isEmpty()) return new Polygon(); |
|
| 61 | 61 | |
| 62 | - if ($this->geos()) { |
|
| 63 | - return geoPHP::geosToGeometry($this->geos()->envelope()); |
|
| 64 | - } |
|
| 62 | + if ($this->geos()) { |
|
| 63 | + return geoPHP::geosToGeometry($this->geos()->envelope()); |
|
| 64 | + } |
|
| 65 | 65 | |
| 66 | - $bbox = $this->getBBox(); |
|
| 67 | - $points = array ( |
|
| 68 | - new Point($bbox['maxx'],$bbox['miny']), |
|
| 69 | - new Point($bbox['maxx'],$bbox['maxy']), |
|
| 70 | - new Point($bbox['minx'],$bbox['maxy']), |
|
| 71 | - new Point($bbox['minx'],$bbox['miny']), |
|
| 72 | - new Point($bbox['maxx'],$bbox['miny']), |
|
| 73 | - ); |
|
| 66 | + $bbox = $this->getBBox(); |
|
| 67 | + $points = array ( |
|
| 68 | + new Point($bbox['maxx'],$bbox['miny']), |
|
| 69 | + new Point($bbox['maxx'],$bbox['maxy']), |
|
| 70 | + new Point($bbox['minx'],$bbox['maxy']), |
|
| 71 | + new Point($bbox['minx'],$bbox['miny']), |
|
| 72 | + new Point($bbox['maxx'],$bbox['miny']), |
|
| 73 | + ); |
|
| 74 | 74 | |
| 75 | - $outer_boundary = new LineString($points); |
|
| 76 | - return new Polygon(array($outer_boundary)); |
|
| 75 | + $outer_boundary = new LineString($points); |
|
| 76 | + return new Polygon(array($outer_boundary)); |
|
| 77 | 77 | } |
| 78 | 78 | |
| 79 | 79 | public function geometryType() { |
| 80 | - return $this->geom_type; |
|
| 80 | + return $this->geom_type; |
|
| 81 | 81 | } |
| 82 | 82 | |
| 83 | 83 | // Public: Non-Standard -- Common to all geometries |
@@ -85,263 +85,263 @@ discard block |
||
| 85 | 85 | |
| 86 | 86 | // $this->out($format, $other_args); |
| 87 | 87 | public function out() { |
| 88 | - $args = func_get_args(); |
|
| 88 | + $args = func_get_args(); |
|
| 89 | 89 | |
| 90 | - $format = array_shift($args); |
|
| 91 | - $type_map = geoPHP::getAdapterMap(); |
|
| 92 | - $processor_type = $type_map[$format]; |
|
| 93 | - $processor = new $processor_type(); |
|
| 90 | + $format = array_shift($args); |
|
| 91 | + $type_map = geoPHP::getAdapterMap(); |
|
| 92 | + $processor_type = $type_map[$format]; |
|
| 93 | + $processor = new $processor_type(); |
|
| 94 | 94 | |
| 95 | - array_unshift($args, $this); |
|
| 96 | - $result = call_user_func_array(array($processor, 'write'), $args); |
|
| 95 | + array_unshift($args, $this); |
|
| 96 | + $result = call_user_func_array(array($processor, 'write'), $args); |
|
| 97 | 97 | |
| 98 | - return $result; |
|
| 98 | + return $result; |
|
| 99 | 99 | } |
| 100 | 100 | |
| 101 | 101 | |
| 102 | 102 | // Public: Aliases |
| 103 | 103 | // --------------- |
| 104 | 104 | public function getCentroid() { |
| 105 | - return $this->centroid(); |
|
| 105 | + return $this->centroid(); |
|
| 106 | 106 | } |
| 107 | 107 | |
| 108 | 108 | public function getArea() { |
| 109 | - return $this->area(); |
|
| 109 | + return $this->area(); |
|
| 110 | 110 | } |
| 111 | 111 | |
| 112 | 112 | public function getX() { |
| 113 | - return $this->x(); |
|
| 113 | + return $this->x(); |
|
| 114 | 114 | } |
| 115 | 115 | |
| 116 | 116 | public function getY() { |
| 117 | - return $this->y(); |
|
| 117 | + return $this->y(); |
|
| 118 | 118 | } |
| 119 | 119 | |
| 120 | 120 | public function getGeos() { |
| 121 | - return $this->geos(); |
|
| 121 | + return $this->geos(); |
|
| 122 | 122 | } |
| 123 | 123 | |
| 124 | 124 | public function getGeomType() { |
| 125 | - return $this->geometryType(); |
|
| 125 | + return $this->geometryType(); |
|
| 126 | 126 | } |
| 127 | 127 | |
| 128 | 128 | public function getSRID() { |
| 129 | - return $this->SRID(); |
|
| 129 | + return $this->SRID(); |
|
| 130 | 130 | } |
| 131 | 131 | |
| 132 | 132 | public function asText() { |
| 133 | - return $this->out('wkt'); |
|
| 133 | + return $this->out('wkt'); |
|
| 134 | 134 | } |
| 135 | 135 | |
| 136 | 136 | public function asBinary() { |
| 137 | - return $this->out('wkb'); |
|
| 137 | + return $this->out('wkb'); |
|
| 138 | 138 | } |
| 139 | 139 | |
| 140 | 140 | // Public: GEOS Only Functions |
| 141 | 141 | // --------------------------- |
| 142 | 142 | public function geos() { |
| 143 | - // If it's already been set, just return it |
|
| 144 | - if ($this->geos && geoPHP::geosInstalled()) { |
|
| 145 | - return $this->geos; |
|
| 146 | - } |
|
| 147 | - // It hasn't been set yet, generate it |
|
| 148 | - if (geoPHP::geosInstalled()) { |
|
| 149 | - $reader = new GEOSWKBReader(); |
|
| 150 | - $this->geos = $reader->readHEX($this->out('wkb',TRUE)); |
|
| 151 | - } |
|
| 152 | - else { |
|
| 153 | - $this->geos = FALSE; |
|
| 154 | - } |
|
| 155 | - return $this->geos; |
|
| 143 | + // If it's already been set, just return it |
|
| 144 | + if ($this->geos && geoPHP::geosInstalled()) { |
|
| 145 | + return $this->geos; |
|
| 146 | + } |
|
| 147 | + // It hasn't been set yet, generate it |
|
| 148 | + if (geoPHP::geosInstalled()) { |
|
| 149 | + $reader = new GEOSWKBReader(); |
|
| 150 | + $this->geos = $reader->readHEX($this->out('wkb',TRUE)); |
|
| 151 | + } |
|
| 152 | + else { |
|
| 153 | + $this->geos = FALSE; |
|
| 154 | + } |
|
| 155 | + return $this->geos; |
|
| 156 | 156 | } |
| 157 | 157 | |
| 158 | 158 | public function setGeos($geos) { |
| 159 | - $this->geos = $geos; |
|
| 159 | + $this->geos = $geos; |
|
| 160 | 160 | } |
| 161 | 161 | |
| 162 | 162 | public function pointOnSurface() { |
| 163 | - if ($this->geos()) { |
|
| 164 | - return geoPHP::geosToGeometry($this->geos()->pointOnSurface()); |
|
| 165 | - } |
|
| 163 | + if ($this->geos()) { |
|
| 164 | + return geoPHP::geosToGeometry($this->geos()->pointOnSurface()); |
|
| 165 | + } |
|
| 166 | 166 | } |
| 167 | 167 | |
| 168 | 168 | public function equalsExact(Geometry $geometry) { |
| 169 | - if ($this->geos()) { |
|
| 170 | - return $this->geos()->equalsExact($geometry->geos()); |
|
| 171 | - } |
|
| 169 | + if ($this->geos()) { |
|
| 170 | + return $this->geos()->equalsExact($geometry->geos()); |
|
| 171 | + } |
|
| 172 | 172 | } |
| 173 | 173 | |
| 174 | 174 | public function relate(Geometry $geometry, $pattern = NULL) { |
| 175 | - if ($this->geos()) { |
|
| 176 | - if ($pattern) { |
|
| 177 | - return $this->geos()->relate($geometry->geos(), $pattern); |
|
| 178 | - } |
|
| 179 | - else { |
|
| 180 | - return $this->geos()->relate($geometry->geos()); |
|
| 181 | - } |
|
| 182 | - } |
|
| 175 | + if ($this->geos()) { |
|
| 176 | + if ($pattern) { |
|
| 177 | + return $this->geos()->relate($geometry->geos(), $pattern); |
|
| 178 | + } |
|
| 179 | + else { |
|
| 180 | + return $this->geos()->relate($geometry->geos()); |
|
| 181 | + } |
|
| 182 | + } |
|
| 183 | 183 | } |
| 184 | 184 | |
| 185 | 185 | public function checkValidity() { |
| 186 | - if ($this->geos()) { |
|
| 187 | - return $this->geos()->checkValidity(); |
|
| 188 | - } |
|
| 186 | + if ($this->geos()) { |
|
| 187 | + return $this->geos()->checkValidity(); |
|
| 188 | + } |
|
| 189 | 189 | } |
| 190 | 190 | |
| 191 | 191 | public function buffer($distance) { |
| 192 | - if ($this->geos()) { |
|
| 193 | - return geoPHP::geosToGeometry($this->geos()->buffer($distance)); |
|
| 194 | - } |
|
| 192 | + if ($this->geos()) { |
|
| 193 | + return geoPHP::geosToGeometry($this->geos()->buffer($distance)); |
|
| 194 | + } |
|
| 195 | 195 | } |
| 196 | 196 | |
| 197 | 197 | public function intersection(Geometry $geometry) { |
| 198 | - if ($this->geos()) { |
|
| 199 | - return geoPHP::geosToGeometry($this->geos()->intersection($geometry->geos())); |
|
| 200 | - } |
|
| 198 | + if ($this->geos()) { |
|
| 199 | + return geoPHP::geosToGeometry($this->geos()->intersection($geometry->geos())); |
|
| 200 | + } |
|
| 201 | 201 | } |
| 202 | 202 | |
| 203 | 203 | public function convexHull() { |
| 204 | - if ($this->geos()) { |
|
| 205 | - return geoPHP::geosToGeometry($this->geos()->convexHull()); |
|
| 206 | - } |
|
| 204 | + if ($this->geos()) { |
|
| 205 | + return geoPHP::geosToGeometry($this->geos()->convexHull()); |
|
| 206 | + } |
|
| 207 | 207 | } |
| 208 | 208 | |
| 209 | 209 | public function difference(Geometry $geometry) { |
| 210 | - if ($this->geos()) { |
|
| 211 | - return geoPHP::geosToGeometry($this->geos()->difference($geometry->geos())); |
|
| 212 | - } |
|
| 210 | + if ($this->geos()) { |
|
| 211 | + return geoPHP::geosToGeometry($this->geos()->difference($geometry->geos())); |
|
| 212 | + } |
|
| 213 | 213 | } |
| 214 | 214 | |
| 215 | 215 | public function symDifference(Geometry $geometry) { |
| 216 | - if ($this->geos()) { |
|
| 217 | - return geoPHP::geosToGeometry($this->geos()->symDifference($geometry->geos())); |
|
| 218 | - } |
|
| 216 | + if ($this->geos()) { |
|
| 217 | + return geoPHP::geosToGeometry($this->geos()->symDifference($geometry->geos())); |
|
| 218 | + } |
|
| 219 | 219 | } |
| 220 | 220 | |
| 221 | 221 | // Can pass in a geometry or an array of geometries |
| 222 | 222 | public function union(Geometry $geometry) { |
| 223 | - if ($this->geos()) { |
|
| 224 | - if (is_array($geometry)) { |
|
| 225 | - $geom = $this->geos(); |
|
| 226 | - foreach ($geometry as $item) { |
|
| 227 | - $geom = $geom->union($item->geos()); |
|
| 228 | - } |
|
| 229 | - return geoPHP::geosToGeometry($geom); |
|
| 230 | - } |
|
| 231 | - else { |
|
| 232 | - return geoPHP::geosToGeometry($this->geos()->union($geometry->geos())); |
|
| 233 | - } |
|
| 234 | - } |
|
| 223 | + if ($this->geos()) { |
|
| 224 | + if (is_array($geometry)) { |
|
| 225 | + $geom = $this->geos(); |
|
| 226 | + foreach ($geometry as $item) { |
|
| 227 | + $geom = $geom->union($item->geos()); |
|
| 228 | + } |
|
| 229 | + return geoPHP::geosToGeometry($geom); |
|
| 230 | + } |
|
| 231 | + else { |
|
| 232 | + return geoPHP::geosToGeometry($this->geos()->union($geometry->geos())); |
|
| 233 | + } |
|
| 234 | + } |
|
| 235 | 235 | } |
| 236 | 236 | |
| 237 | 237 | public function simplify($tolerance, $preserveTopology = FALSE) { |
| 238 | - if ($this->geos()) { |
|
| 239 | - return geoPHP::geosToGeometry($this->geos()->simplify($tolerance, $preserveTopology)); |
|
| 240 | - } |
|
| 238 | + if ($this->geos()) { |
|
| 239 | + return geoPHP::geosToGeometry($this->geos()->simplify($tolerance, $preserveTopology)); |
|
| 240 | + } |
|
| 241 | 241 | } |
| 242 | 242 | |
| 243 | 243 | public function disjoint(Geometry $geometry) { |
| 244 | - if ($this->geos()) { |
|
| 245 | - return $this->geos()->disjoint($geometry->geos()); |
|
| 246 | - } |
|
| 244 | + if ($this->geos()) { |
|
| 245 | + return $this->geos()->disjoint($geometry->geos()); |
|
| 246 | + } |
|
| 247 | 247 | } |
| 248 | 248 | |
| 249 | 249 | public function touches(Geometry $geometry) { |
| 250 | - if ($this->geos()) { |
|
| 251 | - return $this->geos()->touches($geometry->geos()); |
|
| 252 | - } |
|
| 250 | + if ($this->geos()) { |
|
| 251 | + return $this->geos()->touches($geometry->geos()); |
|
| 252 | + } |
|
| 253 | 253 | } |
| 254 | 254 | |
| 255 | 255 | public function intersects(Geometry $geometry) { |
| 256 | - if ($this->geos()) { |
|
| 257 | - return $this->geos()->intersects($geometry->geos()); |
|
| 258 | - } |
|
| 256 | + if ($this->geos()) { |
|
| 257 | + return $this->geos()->intersects($geometry->geos()); |
|
| 258 | + } |
|
| 259 | 259 | } |
| 260 | 260 | |
| 261 | 261 | public function crosses(Geometry $geometry) { |
| 262 | - if ($this->geos()) { |
|
| 263 | - return $this->geos()->crosses($geometry->geos()); |
|
| 264 | - } |
|
| 262 | + if ($this->geos()) { |
|
| 263 | + return $this->geos()->crosses($geometry->geos()); |
|
| 264 | + } |
|
| 265 | 265 | } |
| 266 | 266 | |
| 267 | 267 | public function within(Geometry $geometry) { |
| 268 | - if ($this->geos()) { |
|
| 269 | - return $this->geos()->within($geometry->geos()); |
|
| 270 | - } |
|
| 268 | + if ($this->geos()) { |
|
| 269 | + return $this->geos()->within($geometry->geos()); |
|
| 270 | + } |
|
| 271 | 271 | } |
| 272 | 272 | |
| 273 | 273 | public function contains(Geometry $geometry) { |
| 274 | - if ($this->geos()) { |
|
| 275 | - return $this->geos()->contains($geometry->geos()); |
|
| 276 | - } |
|
| 274 | + if ($this->geos()) { |
|
| 275 | + return $this->geos()->contains($geometry->geos()); |
|
| 276 | + } |
|
| 277 | 277 | } |
| 278 | 278 | |
| 279 | 279 | public function overlaps(Geometry $geometry) { |
| 280 | - if ($this->geos()) { |
|
| 281 | - return $this->geos()->overlaps($geometry->geos()); |
|
| 282 | - } |
|
| 280 | + if ($this->geos()) { |
|
| 281 | + return $this->geos()->overlaps($geometry->geos()); |
|
| 282 | + } |
|
| 283 | 283 | } |
| 284 | 284 | |
| 285 | 285 | public function covers(Geometry $geometry) { |
| 286 | - if ($this->geos()) { |
|
| 287 | - return $this->geos()->covers($geometry->geos()); |
|
| 288 | - } |
|
| 286 | + if ($this->geos()) { |
|
| 287 | + return $this->geos()->covers($geometry->geos()); |
|
| 288 | + } |
|
| 289 | 289 | } |
| 290 | 290 | |
| 291 | 291 | public function coveredBy(Geometry $geometry) { |
| 292 | - if ($this->geos()) { |
|
| 293 | - return $this->geos()->coveredBy($geometry->geos()); |
|
| 294 | - } |
|
| 292 | + if ($this->geos()) { |
|
| 293 | + return $this->geos()->coveredBy($geometry->geos()); |
|
| 294 | + } |
|
| 295 | 295 | } |
| 296 | 296 | |
| 297 | 297 | public function distance(Geometry $geometry) { |
| 298 | - if ($this->geos()) { |
|
| 299 | - return $this->geos()->distance($geometry->geos()); |
|
| 300 | - } |
|
| 298 | + if ($this->geos()) { |
|
| 299 | + return $this->geos()->distance($geometry->geos()); |
|
| 300 | + } |
|
| 301 | 301 | } |
| 302 | 302 | |
| 303 | 303 | public function hausdorffDistance(Geometry $geometry) { |
| 304 | - if ($this->geos()) { |
|
| 305 | - return $this->geos()->hausdorffDistance($geometry->geos()); |
|
| 306 | - } |
|
| 304 | + if ($this->geos()) { |
|
| 305 | + return $this->geos()->hausdorffDistance($geometry->geos()); |
|
| 306 | + } |
|
| 307 | 307 | } |
| 308 | 308 | |
| 309 | 309 | public function project(Geometry $point, $normalized = NULL) { |
| 310 | - if ($this->geos()) { |
|
| 311 | - return $this->geos()->project($point->geos(), $normalized); |
|
| 312 | - } |
|
| 310 | + if ($this->geos()) { |
|
| 311 | + return $this->geos()->project($point->geos(), $normalized); |
|
| 312 | + } |
|
| 313 | 313 | } |
| 314 | 314 | |
| 315 | 315 | // Public - Placeholders |
| 316 | 316 | // --------------------- |
| 317 | 317 | public function hasZ() { |
| 318 | - // geoPHP does not support Z values at the moment |
|
| 319 | - return FALSE; |
|
| 318 | + // geoPHP does not support Z values at the moment |
|
| 319 | + return FALSE; |
|
| 320 | 320 | } |
| 321 | 321 | |
| 322 | 322 | public function is3D() { |
| 323 | - // geoPHP does not support 3D geometries at the moment |
|
| 324 | - return FALSE; |
|
| 323 | + // geoPHP does not support 3D geometries at the moment |
|
| 324 | + return FALSE; |
|
| 325 | 325 | } |
| 326 | 326 | |
| 327 | 327 | public function isMeasured() { |
| 328 | - // geoPHP does not yet support M values |
|
| 329 | - return FALSE; |
|
| 328 | + // geoPHP does not yet support M values |
|
| 329 | + return FALSE; |
|
| 330 | 330 | } |
| 331 | 331 | |
| 332 | 332 | public function coordinateDimension() { |
| 333 | - // geoPHP only supports 2-dimentional space |
|
| 334 | - return 2; |
|
| 333 | + // geoPHP only supports 2-dimentional space |
|
| 334 | + return 2; |
|
| 335 | 335 | } |
| 336 | 336 | |
| 337 | 337 | public function z() { |
| 338 | - // geoPHP only supports 2-dimentional space |
|
| 339 | - return NULL; |
|
| 338 | + // geoPHP only supports 2-dimentional space |
|
| 339 | + return NULL; |
|
| 340 | 340 | } |
| 341 | 341 | |
| 342 | 342 | public function m() { |
| 343 | - // geoPHP only supports 2-dimentional space |
|
| 344 | - return NULL; |
|
| 343 | + // geoPHP only supports 2-dimentional space |
|
| 344 | + return NULL; |
|
| 345 | 345 | } |
| 346 | 346 | |
| 347 | 347 | } |