point-in-polygon

问题 So I have a map here How can I, using Google Maps API, detect whether or not a given coordinate is within that polygon? Is that possible? Thanks in advance. 回答1: Yes it is possible. See this function: http://github.com/tparkin/Google-Maps-Point-in-Polygon 回答2: Google provides one already var bermudaTriangle = new google.maps.Polygon({ paths: [ new google.maps.LatLng(25.774, -80.190), new google.maps.LatLng(18.466, -66.118), new google.maps.LatLng(32.321, -64.757) ] }); google.maps.event

问题 I've been searching and trying to use a sample of the select point within a polygon example however I am not drawing a new polygon but rather one is already in the map to use as selection boundary. I have many points on the map as well but some are out of view or possibly hidden due to zoom ratio so I w/ant to ignore all those points from being selected even if they are in the selection polygon. Is this possible? // searchArea is populated by click method function searchPolygon(searchArea) {

问题 I have a map with multiple polygons rendered on it which can overlap eachother. I use leafletPip.pointInLayer(point, layer) from https://github.com/mapbox/leaflet-pip for determining which polygons do overlap. This happens in the processClick function. In the Vue object I create the map and my GeoJSON layer with the polygons. What I now want is following feature: if you click on a point on the map and this point is contained in multiple polygons, you have something like a selection tool, e.g.

问题 Given a 3D polyhedron defined by its boundary represented by a triangulated mesh, how can I implement an algorithm that determines whether a given 3D point belongs to the interior of the polyhedron ? 回答1: There are several ways of implementing this function. The simplest one is to create an infinite ray (or a very long segment) starting from the point and pointing towards an arbitrary direction, then counting the number of intersections between the ray and the triangles. If the number of

问题 I am trying to check if the lat,lon is in the polygon or not. Here is my array : $vertices_x : Array ( [0] => -32.581189 [1] => -38.785885 [2] => -39.26384 [3] => -34.919383 [4] => -32.284464 ) $vertices_y: Array ( [0] => 170.643905 [1] => 170.424179 [2] => -178.15004 [3] => -176.524063 [4] => -178.325821 ) $longitude_x : 173.5385 $latitude_y : -34.472 $points_polygon = count($vertices_x) - 1; I am using below function to check : function is_in_polygon($points_polygon, $vertices_x, $vertices

问题 I have the following POLYGON (in the image you can see the area it covers) POLYGON((-74.05100448502202 4.7239278424321,-74.05092938316898 4.7241416902206,-74.04830618275201 4.7237460717602,-74.04643668306903 4.7234306460692,-74.04635688735101 4.7234105978214,-74.04636526925401 4.7233310730989,-74.046191260944 4.72327293317,-74.04579027069599 4.7232007594583,-74.04141290558402 4.7214258184083,-74.03746201170497 4.7197791822891,-74.03565688503801 4.7189879401666,-74.033484295736 4.7180897723398

问题 I can't figure out how to implement this in a performing way, so I decided to ask you guys. I have a list of rectangles - actually atm only squares, but I might have to migrate to rectangles later, so let's stick to them and keep it a bit more general - in a 2 dimensional space. Each rectangle is specified by two points, rectangles can overlap and I don't care all too much about setup time, because the rectangles are basicly static and there's some room for precalculate any setup stuff (like

问题 I am looking for C or C++ code to identify whether the point (a co-ordinate) lies inside a KML polygon or not. I have searched but all I got is javascript (google maps apis) which can achieve the same. I cannot even port it directly because I have a slight modified requirement: Identify whether given co-ordinate lies within polygon of KML (the code should exclude holes in the polygon too!). Informing the caller the distance to the nearest polygon edge if the point is outside the range. As far

问题 I am trying to find out whether a point is in a 3D poly. I had used another script I found online to take care of a lot of the 2D problems using ray casting. I was wondering how this could be changed to work for 3D polygons. I'm not going to be looking at really strange polygons with a lot of concavity or holes or anything. Here is the 2D implementation in python: def point_inside_polygon(x,y,poly): n = len(poly) inside =False p1x,p1y = poly[0] for i in range(n+1): p2x,p2y = poly[i % n] if y

问题 Say I have a polygon. It can be a convex one or not, it doesn't matter, but it doesn't have holes. It also has "inner" vertices and edges, meaning that it is partitioned. Is there any kind of popular/known algorithm or standard procedures for when I want to check if a point is inside that kind of polygon? I'm asking because Winding Number and Ray Casting aren't accurate in this case Thanks in advance 回答1: You need to clarify what you mean by 'inner vertices and edges'. Let's take a very