nav[aria-label="Primary Navigation"] { padding: 0; & ul { list-style: none; width: 100%; display: flex; flex-direction: row; justify-content: start; align-items: start; gap: 30px; padding: 0; & li { margin: 0; } & ul li { list-style: none; } } }

Remove sections of polygons that do not meet minimum contiguous area requirement?

ColinMurtoff1

I am performing parcel analysis that requires the removal of parcel sections that do not meet a minimum contiguous area requirement of 300 square feet (able to have a 300x300ft square pass through it). Is there a way to identify and remove these parcel sections, or "thin strips", that do not meet this requirement? See attached photo for clarification.

Pic1.jpg

DuncanKinnear_0-1644743643703.png

タグ付きの投稿をもっと見る

Federal State Local

Urban and Regional Planning

Accepted answers

All comments

DanPatterson_Retired

You have described the ….

Inscribed square problem - Wikipedia

there is no arc* implementation, nor one that could readily be used but

Xander Bakker‌ had a novel approach that you might want to try

XanderBakker

Could you share a sample of your data? I wonder if you would do a buffer with a negative distance, followed by a positive buffer and clip the polygon, if this would solve the problem...

ColinMurtoff1

Hi, Xander.

This was my initial thought. In an attempt to start this process, I ran the negative buffer on the data layer, but what followed was ERROR 999999.

The data layer does have 1843 features.

DanPatterson_Retired

what size of a negative buffer did you run? You may have collapsed the geometries in on themselves (ie black hole)

Xander is suggesting a relatively small negative buffer to clip off those long skinny bits from your polygons to leave the larger chunks. So you might want to get an estimate freehand how wide the skinny strips are and negatively buffer by that amount-ish to 'clip' them or 'remove' them from the main chunkl. Then buffer outward, the file that you buffered inward

MarianneRohrbach

Regarding ERROR 999999: Did you try to run "Repair Geometry" before applying the buffer? This could also be necessary again after each buffer operation especially for inset buffers, since there are often a lot of intersects and multipart geometries.

JoshuaBixby

Dan and Xander were a big part of How to find the maximum rectangle contained within a polygon. This seems to be a bit more common in raster/image processing than vector processing. pogam · GitHub synthesized some ideas from a few years ago on StackExchange, and created GitHub - pogam/ExtractRect: find the largest rectangle inscribed in a non-convex polygon .

会話に参加する

サインインしたメンバーは投稿、更新のフォローなどができます。初めてですか？無料アカウントを登録してください。

クイックリンク

Community Help
Find useful guides, FAQs, and documents to help you navigate and make the most of Esri Community.