Keeping properties in an Intersection - Google Earth Engine Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern) Announcing the arrival of Valued Associate #679: Cesar Manara Unicorn Meta Zoo #1: Why another podcast?LinearFit with Google Earth EngineGoogle Earth Engine - Map.addLayerKeeping built-in colour palette with Google Earth Engine?Collection properties are lost when exporting in google earth engineHow to export a feature collection of feature collections in Google Earth Engine?Adding Properties to a feature in Google Earth EnginereduceRegion not working in Google Earth EngineNormalization in Google Earth EngineMemory limit exceeded in Google Earth EngineReprojecting with Google Earth Engine?
Should I discuss the type of campaign with my players?
Sci-Fi book where patients in a coma ward all live in a subconscious world linked together
How to react to hostile behavior from a senior developer?
Coloring maths inside a tcolorbox
Fundamental Solution of the Pell Equation
Error "illegal generic type for instanceof" when using local classes
Should I use a zero-interest credit card for a large one-time purchase?
Why do we bend a book to keep it straight?
Why didn't this character "real die" when they blew their stack out in Altered Carbon?
How to deal with a team lead who never gives me credit?
List of Python versions
Echoing a tail command produces unexpected output?
Why aren't air breathing engines used as small first stages
What is Wonderstone and are there any references to it pre-1982?
Why do people hide their license plates in the EU?
Identifying polygons that intersect with another layer using QGIS?
Why did the Falcon Heavy center core fall off the ASDS OCISLY barge?
3 doors, three guards, one stone
In predicate logic, does existential quantification (∃) include universal quantification (∀), i.e. can 'some' imply 'all'?
What's the meaning of 間時肆拾貳 at a car parking sign
What would be the ideal power source for a cybernetic eye?
If a contract sometimes uses the wrong name, is it still valid?
Why is "Consequences inflicted." not a sentence?
51k Euros annually for a family of 4 in Berlin: Is it enough?
Keeping properties in an Intersection - Google Earth Engine
Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)
Announcing the arrival of Valued Associate #679: Cesar Manara
Unicorn Meta Zoo #1: Why another podcast?LinearFit with Google Earth EngineGoogle Earth Engine - Map.addLayerKeeping built-in colour palette with Google Earth Engine?Collection properties are lost when exporting in google earth engineHow to export a feature collection of feature collections in Google Earth Engine?Adding Properties to a feature in Google Earth EnginereduceRegion not working in Google Earth EngineNormalization in Google Earth EngineMemory limit exceeded in Google Earth EngineReprojecting with Google Earth Engine?
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;
I have a set of points and I need to classify them according to which polygon they belong. The natural way of doing this is creating the intersections between all points and each polygon. The points have properties I want to keep and the intersection function requires me to have the polygon on the left side and I lose the properties of the input of the right side. How should I go about this? If I use the points on the left side it doesn't work.
https://code.earthengine.google.com/f7b34e63c5e9ad70f96e1ad91620d48a
I want an output that I can download as a .csv with each point, it's characteristics, and an indicator of the polygon they belong.
Code:
var p1 = ee.Feature(p1, id: 'id1');
var p2 = ee.Feature(p2, id: 'id2');
var p3 = ee.Feature(p3, id: 'id3');
var p4 = ee.Feature(p4, id: 'id4');
var points=ee.FeatureCollection([p1,p2,p3,p4]);
print(points,' points');
var cc1 = poly1.intersection(points, ee.ErrorMargin(1));
var cc2 = poly2.intersection(points, ee.ErrorMargin(1));
Map.addLayer(cc1,,'cc1');
Map.addLayer(cc2,,'cc2');
var ccs=ee.FeatureCollection([cc1,cc2]);
print(ccs,'ccs');
google-earth-engine
add a comment |
I have a set of points and I need to classify them according to which polygon they belong. The natural way of doing this is creating the intersections between all points and each polygon. The points have properties I want to keep and the intersection function requires me to have the polygon on the left side and I lose the properties of the input of the right side. How should I go about this? If I use the points on the left side it doesn't work.
https://code.earthengine.google.com/f7b34e63c5e9ad70f96e1ad91620d48a
I want an output that I can download as a .csv with each point, it's characteristics, and an indicator of the polygon they belong.
Code:
var p1 = ee.Feature(p1, id: 'id1');
var p2 = ee.Feature(p2, id: 'id2');
var p3 = ee.Feature(p3, id: 'id3');
var p4 = ee.Feature(p4, id: 'id4');
var points=ee.FeatureCollection([p1,p2,p3,p4]);
print(points,' points');
var cc1 = poly1.intersection(points, ee.ErrorMargin(1));
var cc2 = poly2.intersection(points, ee.ErrorMargin(1));
Map.addLayer(cc1,,'cc1');
Map.addLayer(cc2,,'cc2');
var ccs=ee.FeatureCollection([cc1,cc2]);
print(ccs,'ccs');
google-earth-engine
add a comment |
I have a set of points and I need to classify them according to which polygon they belong. The natural way of doing this is creating the intersections between all points and each polygon. The points have properties I want to keep and the intersection function requires me to have the polygon on the left side and I lose the properties of the input of the right side. How should I go about this? If I use the points on the left side it doesn't work.
https://code.earthengine.google.com/f7b34e63c5e9ad70f96e1ad91620d48a
I want an output that I can download as a .csv with each point, it's characteristics, and an indicator of the polygon they belong.
Code:
var p1 = ee.Feature(p1, id: 'id1');
var p2 = ee.Feature(p2, id: 'id2');
var p3 = ee.Feature(p3, id: 'id3');
var p4 = ee.Feature(p4, id: 'id4');
var points=ee.FeatureCollection([p1,p2,p3,p4]);
print(points,' points');
var cc1 = poly1.intersection(points, ee.ErrorMargin(1));
var cc2 = poly2.intersection(points, ee.ErrorMargin(1));
Map.addLayer(cc1,,'cc1');
Map.addLayer(cc2,,'cc2');
var ccs=ee.FeatureCollection([cc1,cc2]);
print(ccs,'ccs');
google-earth-engine
I have a set of points and I need to classify them according to which polygon they belong. The natural way of doing this is creating the intersections between all points and each polygon. The points have properties I want to keep and the intersection function requires me to have the polygon on the left side and I lose the properties of the input of the right side. How should I go about this? If I use the points on the left side it doesn't work.
https://code.earthengine.google.com/f7b34e63c5e9ad70f96e1ad91620d48a
I want an output that I can download as a .csv with each point, it's characteristics, and an indicator of the polygon they belong.
Code:
var p1 = ee.Feature(p1, id: 'id1');
var p2 = ee.Feature(p2, id: 'id2');
var p3 = ee.Feature(p3, id: 'id3');
var p4 = ee.Feature(p4, id: 'id4');
var points=ee.FeatureCollection([p1,p2,p3,p4]);
print(points,' points');
var cc1 = poly1.intersection(points, ee.ErrorMargin(1));
var cc2 = poly2.intersection(points, ee.ErrorMargin(1));
Map.addLayer(cc1,,'cc1');
Map.addLayer(cc2,,'cc2');
var ccs=ee.FeatureCollection([cc1,cc2]);
print(ccs,'ccs');
google-earth-engine
google-earth-engine
edited Apr 9 at 21:51
Kuik
2,5821214
2,5821214
asked Apr 9 at 20:07
RaimundoRaimundo
90111
90111
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
I think it's best practice to construct a feature collection of the points and a featuere collection of the polygons you have. Then map over both collections to calculate the intersection for every single point. You can hen add the properties to the existing properties of the feature and filter out the ones which did not intersect. Then export the feature collection as csv:
// Map over the feature collection of points so we
// can inspect every single elements intersection and proprty
var ccs = points.map(function(feat)
feat = ee.Feature(feat);
var point = feat.geometry();
// now map over the polygons
var mappedPolys = polygons.map(function(poly)
var intersects = poly.intersects(point, ee.ErrorMargin(1));
// check if the point intersected with the polygon
var property = ee.String(ee.Algorithms.If(intersects, poly.get('system:index'), 'FALSE'));
// set a property to each individual feature
return feat.set('belongsTo', ee.String('poly').cat(property))
.set('pointID', ee.String('id').cat(ee.String(feat.get('system:index'))));
);
// return the point with the polygon they intersect with or a property called 'polyFALSE'
return mappedPolys;
)
// Flatten the collection of collections and filter out the 'polyFALSE' properties
.flatten().filter(ee.Filter.neq('belongsTo', 'polyFALSE'));
link code
Thank you Kuik. This can get messy if there many polygons. Is there a way to make this more general, so that it is applicable to a large number of polygons? Each polygon would have an ID and the resulting table should have a variable called "belongs to" and the values would correspond to the polygons IDs.
– Raimundo
Apr 10 at 19:07
1
I edited the answer. See the new link that this would also work for many more polygons/points. And is uses the system property index so you don't have to set id's yourself. If you have already named those points/polygons, then use the name of that property instead of 'system:index'.
– Kuik
Apr 11 at 8:28
add a comment |
Your Answer
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "79"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fgis.stackexchange.com%2fquestions%2f318285%2fkeeping-properties-in-an-intersection-google-earth-engine%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
I think it's best practice to construct a feature collection of the points and a featuere collection of the polygons you have. Then map over both collections to calculate the intersection for every single point. You can hen add the properties to the existing properties of the feature and filter out the ones which did not intersect. Then export the feature collection as csv:
// Map over the feature collection of points so we
// can inspect every single elements intersection and proprty
var ccs = points.map(function(feat)
feat = ee.Feature(feat);
var point = feat.geometry();
// now map over the polygons
var mappedPolys = polygons.map(function(poly)
var intersects = poly.intersects(point, ee.ErrorMargin(1));
// check if the point intersected with the polygon
var property = ee.String(ee.Algorithms.If(intersects, poly.get('system:index'), 'FALSE'));
// set a property to each individual feature
return feat.set('belongsTo', ee.String('poly').cat(property))
.set('pointID', ee.String('id').cat(ee.String(feat.get('system:index'))));
);
// return the point with the polygon they intersect with or a property called 'polyFALSE'
return mappedPolys;
)
// Flatten the collection of collections and filter out the 'polyFALSE' properties
.flatten().filter(ee.Filter.neq('belongsTo', 'polyFALSE'));
link code
Thank you Kuik. This can get messy if there many polygons. Is there a way to make this more general, so that it is applicable to a large number of polygons? Each polygon would have an ID and the resulting table should have a variable called "belongs to" and the values would correspond to the polygons IDs.
– Raimundo
Apr 10 at 19:07
1
I edited the answer. See the new link that this would also work for many more polygons/points. And is uses the system property index so you don't have to set id's yourself. If you have already named those points/polygons, then use the name of that property instead of 'system:index'.
– Kuik
Apr 11 at 8:28
add a comment |
I think it's best practice to construct a feature collection of the points and a featuere collection of the polygons you have. Then map over both collections to calculate the intersection for every single point. You can hen add the properties to the existing properties of the feature and filter out the ones which did not intersect. Then export the feature collection as csv:
// Map over the feature collection of points so we
// can inspect every single elements intersection and proprty
var ccs = points.map(function(feat)
feat = ee.Feature(feat);
var point = feat.geometry();
// now map over the polygons
var mappedPolys = polygons.map(function(poly)
var intersects = poly.intersects(point, ee.ErrorMargin(1));
// check if the point intersected with the polygon
var property = ee.String(ee.Algorithms.If(intersects, poly.get('system:index'), 'FALSE'));
// set a property to each individual feature
return feat.set('belongsTo', ee.String('poly').cat(property))
.set('pointID', ee.String('id').cat(ee.String(feat.get('system:index'))));
);
// return the point with the polygon they intersect with or a property called 'polyFALSE'
return mappedPolys;
)
// Flatten the collection of collections and filter out the 'polyFALSE' properties
.flatten().filter(ee.Filter.neq('belongsTo', 'polyFALSE'));
link code
Thank you Kuik. This can get messy if there many polygons. Is there a way to make this more general, so that it is applicable to a large number of polygons? Each polygon would have an ID and the resulting table should have a variable called "belongs to" and the values would correspond to the polygons IDs.
– Raimundo
Apr 10 at 19:07
1
I edited the answer. See the new link that this would also work for many more polygons/points. And is uses the system property index so you don't have to set id's yourself. If you have already named those points/polygons, then use the name of that property instead of 'system:index'.
– Kuik
Apr 11 at 8:28
add a comment |
I think it's best practice to construct a feature collection of the points and a featuere collection of the polygons you have. Then map over both collections to calculate the intersection for every single point. You can hen add the properties to the existing properties of the feature and filter out the ones which did not intersect. Then export the feature collection as csv:
// Map over the feature collection of points so we
// can inspect every single elements intersection and proprty
var ccs = points.map(function(feat)
feat = ee.Feature(feat);
var point = feat.geometry();
// now map over the polygons
var mappedPolys = polygons.map(function(poly)
var intersects = poly.intersects(point, ee.ErrorMargin(1));
// check if the point intersected with the polygon
var property = ee.String(ee.Algorithms.If(intersects, poly.get('system:index'), 'FALSE'));
// set a property to each individual feature
return feat.set('belongsTo', ee.String('poly').cat(property))
.set('pointID', ee.String('id').cat(ee.String(feat.get('system:index'))));
);
// return the point with the polygon they intersect with or a property called 'polyFALSE'
return mappedPolys;
)
// Flatten the collection of collections and filter out the 'polyFALSE' properties
.flatten().filter(ee.Filter.neq('belongsTo', 'polyFALSE'));
link code
I think it's best practice to construct a feature collection of the points and a featuere collection of the polygons you have. Then map over both collections to calculate the intersection for every single point. You can hen add the properties to the existing properties of the feature and filter out the ones which did not intersect. Then export the feature collection as csv:
// Map over the feature collection of points so we
// can inspect every single elements intersection and proprty
var ccs = points.map(function(feat)
feat = ee.Feature(feat);
var point = feat.geometry();
// now map over the polygons
var mappedPolys = polygons.map(function(poly)
var intersects = poly.intersects(point, ee.ErrorMargin(1));
// check if the point intersected with the polygon
var property = ee.String(ee.Algorithms.If(intersects, poly.get('system:index'), 'FALSE'));
// set a property to each individual feature
return feat.set('belongsTo', ee.String('poly').cat(property))
.set('pointID', ee.String('id').cat(ee.String(feat.get('system:index'))));
);
// return the point with the polygon they intersect with or a property called 'polyFALSE'
return mappedPolys;
)
// Flatten the collection of collections and filter out the 'polyFALSE' properties
.flatten().filter(ee.Filter.neq('belongsTo', 'polyFALSE'));
link code
edited Apr 11 at 8:26
answered Apr 9 at 22:01
KuikKuik
2,5821214
2,5821214
Thank you Kuik. This can get messy if there many polygons. Is there a way to make this more general, so that it is applicable to a large number of polygons? Each polygon would have an ID and the resulting table should have a variable called "belongs to" and the values would correspond to the polygons IDs.
– Raimundo
Apr 10 at 19:07
1
I edited the answer. See the new link that this would also work for many more polygons/points. And is uses the system property index so you don't have to set id's yourself. If you have already named those points/polygons, then use the name of that property instead of 'system:index'.
– Kuik
Apr 11 at 8:28
add a comment |
Thank you Kuik. This can get messy if there many polygons. Is there a way to make this more general, so that it is applicable to a large number of polygons? Each polygon would have an ID and the resulting table should have a variable called "belongs to" and the values would correspond to the polygons IDs.
– Raimundo
Apr 10 at 19:07
1
I edited the answer. See the new link that this would also work for many more polygons/points. And is uses the system property index so you don't have to set id's yourself. If you have already named those points/polygons, then use the name of that property instead of 'system:index'.
– Kuik
Apr 11 at 8:28
Thank you Kuik. This can get messy if there many polygons. Is there a way to make this more general, so that it is applicable to a large number of polygons? Each polygon would have an ID and the resulting table should have a variable called "belongs to" and the values would correspond to the polygons IDs.
– Raimundo
Apr 10 at 19:07
Thank you Kuik. This can get messy if there many polygons. Is there a way to make this more general, so that it is applicable to a large number of polygons? Each polygon would have an ID and the resulting table should have a variable called "belongs to" and the values would correspond to the polygons IDs.
– Raimundo
Apr 10 at 19:07
1
1
I edited the answer. See the new link that this would also work for many more polygons/points. And is uses the system property index so you don't have to set id's yourself. If you have already named those points/polygons, then use the name of that property instead of 'system:index'.
– Kuik
Apr 11 at 8:28
I edited the answer. See the new link that this would also work for many more polygons/points. And is uses the system property index so you don't have to set id's yourself. If you have already named those points/polygons, then use the name of that property instead of 'system:index'.
– Kuik
Apr 11 at 8:28
add a comment |
Thanks for contributing an answer to Geographic Information Systems Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fgis.stackexchange.com%2fquestions%2f318285%2fkeeping-properties-in-an-intersection-google-earth-engine%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown