Nothing
cell_to_childpos()
, childpos_to_cell()
and cell_to_children_size()
. See this Observable notebook for use cases.point_to_h3()
--> point_to_cell()
h3_to_point()
--> cell_to_point()
h3_to_polygon()
--> cell_to_polygon()
h3_to_line()
--> cell_to_line()
get_kring()
--> get_disk()
get_kring_list()
--> get_disk_list()
polyfill()
--> polygon_to_cells()
set_to_multipolygon()
--> cells_to_multipolygon()
res_count()
--> num_cells()
is_valid_vertex()
, get_cell_vertex()
, get_cell_vertexes()
, and vertex_to_point()
are available for interacting with H3 in vertex mode.cell_to_splitlong()
and splitlong_to_cell()
are available for converting between 64-bit string addresses and 32-bit integer pairs.degs_to_rads()
and rads_to_degs()
available for unit conversion.V8
version requirement to ensure consistent build across platformscell_area
, edge_length
, get_dist
, and get_res0
.prep_for_pt2h3
h3_info_table
when library not loaded explicitlypolyfill()
behaviourget_centerchild()
, which will return the central child of a hexagon at a given resolution.get_pentagons()
, which will return the twelve pentagon indexes at a given resolution.get_faces()
, which returns the icosahedron face(s) for a given H3 address.min_path()
with official version grid_path()
, which wraps h3Line
to find a path between
two addresses.h3_to_line()
, which converts a vector of H3 addresses to sfc_LINESTRING
.nearest_neighbour()
, its fundamentally flawed. get_local_ij()
to a matrix when simple = TRUEh3_to_point()
h3_to_point()
and polyfill()
h3_to_point()
, h3_to_polygon()
, and polyfill()
now take a wider range of input objects.get_local_ij()
and get_local_h3()
, wrapping the experimental local coordinate system functions h3.experimentalH3ToLocalIj
and h3.experimentalLocalIjToH3
respectively.min_path()
to find a minimum-steps path between two H3 addresses of the same resolution.nearest_neighbour()
to find the nearest neighbour for a given set of points. Use with caution, read the notes.polyfill()
. Where input sf
object only has a geometry column, a column called 'ID_H3' containing a sequential ID field is now added before sending the geometry to the V8 session.grid_distance()
, which returns the number of 'steps' required to get from one H3 address to another (within the same resolution).h3_polyfill()
, plus a message when output resolution is way smaller than input extent.res_cendist()
for getting the average distance between the center of each region represented by a H3 address at a given resolution.to_point()
to return an sfc_POINT
object, or an sf
point data frame where simple = FALSE
.to_polygon()
to have a similar structure to h3_to_geo()
. point_to_h3()
to take in an sf
point object and return the same when simple = FALSE
, resulting in a new dependency on tidyr
. On the upside, one can now request addresses for multiple resolutions at multiple points, if one wishes to test the limits of one's system.res_area()
, res_edgelen()
, and res_count()
are_neighbours()
, get_udedge()
, is_valid_edge()
, get_udorigin()
, get_uddest()
, get_udends()
, get_udedges()
, and udedge_to_line()
.polyfill()
and set_to_multipolygon()
added; new dependencies on sf
and geojsonsf
have resulted.to_polygon()
now returns an object with sf
geometry.compact()
and uncompact()
added, all public core algorithms now available.get_parent()
, get_children()
, get_kring()
, get_kring_list()
, and get_ring()
added.is_valid()
, is_pentagon()
, is_rc3()
, get_base_cell()
, get_res()
, and to_polygon()
.to_point()
added.point_to_h3()
bugfix. A pox on devs who think y,x is ok.point_to_h3()
- first function implemented.Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.