Conversion of Cartesian coordinates from and to Generalized Balanced Ternary addresses
Links
- The Publications Warehouse does not have links to digital versions of this publication at this time
- Download citation as: RIS | Dublin Core
Abstract
Hexagonal grids have several advantages over square grids, such as a greater angular resolution and unambiguous connectivity. The Generalized Balanced Ternary (GBT) system is a spatial addressing method for hexagonal grids in which the hexagons are arranged in hierarchical aggregates, and which accommodates vector operations in GBT space. Efficient algorithms for converting Cartesian coordinates from and to GBT addresses are based on the dual representation of the hexagonal tessellation. The GBT-to-Cartesian algorithm is an order of magnitude faster than the Cartesian-to-GBT algorithm, the latter requiring interpolation and GBT addition for each digit of the generated GBT address.
Publication type | Article |
---|---|
Publication Subtype | Journal Article |
Title | Conversion of Cartesian coordinates from and to Generalized Balanced Ternary addresses |
Series title | Photogrammetric Engineering and Remote Sensing |
Volume | 54 |
Issue | 11 |
Year Published | 1988 |
Language | English |
Publisher | American Society for Photogrammetry and Remote Sensing |
Contributing office(s) | Earth Resources Observation and Science (EROS) Center |
Description | 6 p. |
First page | 1565 |
Last page | 1570 |
Online Only (Y/N) | N |
Additional Online Files (Y/N) | N |
Google Analytic Metrics | Metrics page |