1"use strict";(globalThis.webpackChunkh3_website||=[]).push([[1578],{9961(e,t,i){i.r(t),i.d(t,{assets:()=>o,contentTitle:()=>l,default:()=>h,frontMatter:()=>d,metadata:()=>n,toc:()=>c});const n=JSON.parse('{"id":"library/index/vertex","title":"Vertex mode","description":"An H3 Vertex index (mode 4) represents a single topological vertex in H3 grid system, shared by three cells. Note that this does not include the distortion vertexes occasionally present in a cell\'s geographic boundary. An H3 Vertex is arbitrarily assigned one of the three neighboring cells as its \\"owner\\", which is used to calculate the canonical index and geographic coordinates for the vertex. The components of the H3 Vertex index are packed into a 64-bit integer in order, highest bit first, as follows:","source":"@site/docs/library/index/vertex.md","sourceDirName":"library/index","slug":"/library/index/vertex","permalink":"/docs/library/index/vertex","draft":false,"unlisted":false,"editUrl":"https://github.com/uber/h3/edit/master/website/docs/library/index/vertex.md","tags":[],"version":"current","frontMatter":{"id":"vertex","title":"Vertex mode","sidebar_label":"Vertex mode","slug":"/library/index/vertex"},"sidebar":"someSidebar","previous":{"title":"Directed edge mode","permalink":"/docs/library/index/directededge"},"next":{"title":"Terminology","permalink":"/docs/library/terminology"}}');var r=i(4848),s=i(8453);const d={id:"vertex",title:"Vertex mode",sidebar_label:"Vertex mode",slug:"/library/index/vertex"},l=void 0,o={},c=[{value:"Bit layout of H3Index for vertexes",id:"bit-layout-of-h3index-for-vertexes",level:2}];function x(e){const t={a:"a",code:"code",h2:"h2",li:"li",p:"p",ul:"ul",...(0,s.R)(),...e.components};return(0,r.jsxs)(r.Fragment,{children:[(0,r.jsx)("div",{align:"center",children:(0,r.jsx)("img",{height:"300",src:"/images/vertex_mode.png"})}),"\n",(0,r.jsx)(t.p,{children:'An H3 Vertex index (mode 4) represents a single topological vertex in H3 grid system, shared by three cells. Note that this does not include the distortion vertexes occasionally present in a cell\'s geographic boundary. An H3 Vertex is arbitrarily assigned one of the three neighboring cells as its "owner", which is used to calculate the canonical index and geographic coordinates for the vertex. The components of the H3 Vertex index are packed into a 64-bit integer in order, highest bit first, as follows:'}),"\n",(0,r.jsxs)(t.ul,{children:["\n",(0,r.jsx)(t.li,{children:"1 bit reserved and set to 0,"}),"\n",(0,r.jsx)(t.li,{children:"4 bits to indicate the H3 Vertex index mode,"}),"\n",(0,r.jsx)(t.li,{children:"3 bits to indicate the vertex number (0-5) of vertex on the owner cell,"}),"\n",(0,r.jsxs)(t.li,{children:["Subsequent bits matching the index bits of the ",(0,r.jsx)(t.a,{href:"./cell#h3-cell-index",children:"owner cell"}),"."]}),"\n"]}),"\n",(0,r.jsx)(t.h2,{id:"bit-layout-of-h3index-for-vertexes",children:"Bit layout of H3Index for vertexes"}),"\n",(0,r.jsxs)(t.p,{children:["The layout of an ",(0,r.jsx)(t.code,{children:"H3Index"}),' for vertexes is shown below in table form. The interpretation of the "Mode-Dependent" field differs depending on the mode of the index.']}),"\n",(0,r.jsxs)("table",{children:[(0,r.jsxs)("tr",{children:[(0,r.jsx)("th",{}),(0,r.jsx)("th",{children:"0x0F"}),(0,r.jsx)("th",{children:"0x0E"}),(0,r.jsx)("th",{children:"0x0D"}),(0,r.jsx)("th",{children:"0x0C"}),(0,r.jsx)("th",{children:"0x0B"}),(0,r.jsx)("th",{children:"0x0A"}),(0,r.jsx)("th",{children:"0x09"}),(0,r.jsx)("th",{children:"0x08"}),(0,r.jsx)("th",{children:"0x07"}),(0,r.jsx)("th",{children:"0x06"}),(0,r.jsx)("th",{children:"0x05"}),(0,r.jsx)("th",{children:"0x04"}),(0,r.jsx)("th",{children:"0x03"}),(0,r.jsx)("th",{children:"0x02"}),(0,r.jsx)("th",{children:"0x01"}),(0,r.jsx)("th",{children:"0x00"})]}),(0,r.jsxs)("tr",{children:[(0,r.jsx)("th",{children:"0x30"}),(0,r.jsx)("td",{children:"Reserved (0)"}),(0,r.jsx)("td",{colspan:"4",children:"Mode (4)"}),(0,r.jsx)("td",{colspan:"3",children:"Vertex"}),(0,r.jsx)("td",{colspan:"4",children:"Resolution"}),(0,r.jsx)("td",{colspan:"4",children:"Base cell"})]}),(0,r.jsxs)("tr",{children:[(0,r.jsx)("th",{children:"0x20"}),(0,r.jsx)("td",{colspan:"3",children:"Base cell"}),(0,r.jsx)("td",{colspan:"3",children:"Digit 1"}),(0,r.jsx)("td",{colspan:"3",children:"Digit 2"}),(0,r.jsx)("td",{colspan:"3",children:"Digit 3"}),(0,r.jsx)("td",{colspan:"3",children:"Digit 4"}),(0,r.jsx)("td",{children:"Digit 5"})]}),(0,r.jsxs)("tr",{children:[(0,r.jsx)("th",{children:"0x10"}),(0,r.jsx)("td",{colspan:"2",children:"Digit 5"}),(0,r.jsx)("td",{colspan:"3",children:"Digit 6"}),(0,r.jsx)("td",{colspan:"3",children:"Digit 7"}),(0,r.jsx)("td",{colspan:"3",children:"Digit 8"}),(0,r.jsx)("td",{colspan:"3",children:"Digit 9"}),(0,r.jsx)("td",{colspan:"2",children:"Digit 10"})]}),(0,r.jsxs)("tr",{children:[(0,r.jsx)("th",{children:"0x00"}),(0,r.jsx)("td",{children:"Digit 10"}),(0,r.jsx)("td",{colspan:"3",children:"Digit 11"}),(0,r.jsx)("td",{colspan:"3",children:"Digit 12"}),(0,r.jsx)("td",{colspan:"3",children:"Digit 13"}),(0,r.jsx)("td",{colspan:"3",children:"Digit 14"}),(0,r.jsx)("td",{colspan:"3",children:"Digit 15"})]})]})]})}function h(e={}){const{wrapper:t}={...(0,s.R)(),...e.components};return t?(0,r.jsx)(t,{...e,children:(0,r.jsx)(x,{...e})}):x(e)}},8453(e,t,i){i.d(t,{R:()=>d,x:()=>l});var n=i(6540);const r={},s=n.createContext(r);function d(e){const t=n.useContext(s);return n.useMemo(function(){return"function"==typeof e?e(t):{...t,...e}},[t,e])}function l(e){let t;return t=e.disableParentContext?"function"==typeof e.components?e.components(r):e.components||r:d(e.components),n.createElement(s.Provider,{value:t},e.children)}}}]);
Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.