title: Possible to find K closest points using S2 library (and is it effective)?
body: <h1>Background</h1>
  
  <p>Hey everyone, I recently discovered Google's open source S2 library</p>
  
  <p><a href="https://github.com/google/s2geometry" rel="nofollow noreferrer">https://github.com/google/s2geometry</a></p>
  
  <p>I am currently programming an application that requires finding K closest points, given an original target point. Currently I am using PostgreSQL with geospatial indexes on columns containing latitude/longitude values to achieve this - However, I am looking for alternatives when S2 caught my eye.</p>
  
  <h1>Questions</h1>
  
  <p>I am rather unfamiliar with the library, and I have some questions regarding it.</p>
  
  <p><strong>1) Is it possible to find K closest points using the S2 library</strong></p>
  
  <p><strong>2) How fast would the query in S2 be vs Geospatial indexes (superior/inferior/same/etc)</strong></p>