--- res: bibo_abstract: - We present here the first integer-based algorithm for constructing a well-defined lattice sphere specified by integer radius and integer center. The algorithm evolves from a unique correspondence between the lattice points comprising the sphere and the distribution of sum of three square numbers in integer intervals. We characterize these intervals to derive a useful set of recurrences, which, in turn, aids in efficient computation. Each point of the lattice sphere is determined by resorting to only a few primitive operations in the integer domain. The symmetry of its quadraginta octants provides an added advantage by confining the computation to its prima quadraginta octant. Detailed theoretical analysis and experimental results have been furnished to demonstrate its simplicity and elegance.@eng bibo_authorlist: - foaf_Person: foaf_givenName: Ranita foaf_name: Biswas, Ranita foaf_surname: Biswas foaf_workInfoHomepage: http://www.librecat.org/personId=3C2B033E-F248-11E8-B48F-1D18A9856A87 orcid: 0000-0002-5372-7890 - foaf_Person: foaf_givenName: Partha foaf_name: Bhowmick, Partha foaf_surname: Bhowmick bibo_doi: 10.1016/j.tcs.2015.11.018 bibo_issue: '4' bibo_volume: 624 dct_date: 2015^xs_gYear dct_isPartOf: - http://id.crossref.org/issn/0304-3975 dct_language: eng dct_publisher: Elsevier@ dct_title: From prima quadraginta octant to lattice sphere through primitive integer operations@ ...