Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • Home
  • SEARCH
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 821419
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 15, 20262026-05-15T02:38:10+00:00 2026-05-15T02:38:10+00:00

I have a large array of lat/lng points. Could be up to 20k points.

  • 0

I have a large array of lat/lng points. Could be up to 20k points. I’m plotting them using KML. What I want to do is to take only the outter most points and use them to draw a polygon instead. I already know how to draw a polygon in kml, I just need to figure out how to select only the outer most points of the group.

Any ideas? I’d like to have at least 5 points to the polygon but no more than 25 points total.

So far i’ve come up with checking for top most and bottom most points (basically crearing a square) using < & > logic.

The points will be in america & canada only if that matters.

Thanks for any help.

EDIT: I’ve gotten the Convex Hull algorithm to work, but it isnt exactly what I need. I’m trying to map out zip codes. If a zip code has an L shape then the polygon is going to be a triangle shape and not an L shape. Any ideas?

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-15T02:38:11+00:00Added an answer on May 15, 2026 at 2:38 am

    You need to use a Convex Hull algorithm. It’s not too hard to implement yourself if it’s not available in whatever software package you’re using.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I have a large array of booleans, and I want to pack/unpack them into
I'm using .NET 2.0 I have a large array of string. I want to
I have a large multidimensional array and I basically want to drop the first
Hey. I have a very large array and I want to find the Nth
I want to have a large 2 dimensional array such like int myArray[10000][2]; I
I have a large array (say 512K elements), GPU resident, where only a small
I have a large array in RAM and want to read data from it
I have a large array of vehicle make and model data that I want
I have a very large array of doubles that I am using a disk-based
I have a large array of vertices, some of them are edges, some are

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.