{"day":"22","year":"2017","publisher":"Springer Nature","status":"public","page":"347-359","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_published":"2017-08-22T00:00:00Z","article_processing_charge":"No","month":"08","date_created":"2019-01-08T20:42:22Z","citation":{"ieee":"S. Dwivedi, A. Gupta, S. Roy, R. Biswas, and P. Bhowmick, “Fast and Efficient Incremental Algorithms for Circular and Spherical Propagation in Integer Space,” in 20th IAPR International Conference, Vienna, Austria, 2017, vol. 10502, pp. 347–359.","mla":"Dwivedi, Shivam, et al. “Fast and Efficient Incremental Algorithms for Circular and Spherical Propagation in Integer Space.” 20th IAPR International Conference, vol. 10502, Springer Nature, 2017, pp. 347–59, doi:10.1007/978-3-319-66272-5_28.","ama":"Dwivedi S, Gupta A, Roy S, Biswas R, Bhowmick P. Fast and Efficient Incremental Algorithms for Circular and Spherical Propagation in Integer Space. In: 20th IAPR International Conference. Vol 10502. Cham: Springer Nature; 2017:347-359. doi:10.1007/978-3-319-66272-5_28","short":"S. Dwivedi, A. Gupta, S. Roy, R. Biswas, P. Bhowmick, in:, 20th IAPR International Conference, Springer Nature, Cham, 2017, pp. 347–359.","apa":"Dwivedi, S., Gupta, A., Roy, S., Biswas, R., & Bhowmick, P. (2017). Fast and Efficient Incremental Algorithms for Circular and Spherical Propagation in Integer Space. In 20th IAPR International Conference (Vol. 10502, pp. 347–359). Cham: Springer Nature. https://doi.org/10.1007/978-3-319-66272-5_28","chicago":"Dwivedi, Shivam, Aniket Gupta, Siddhant Roy, Ranita Biswas, and Partha Bhowmick. “Fast and Efficient Incremental Algorithms for Circular and Spherical Propagation in Integer Space.” In 20th IAPR International Conference, 10502:347–59. Cham: Springer Nature, 2017. https://doi.org/10.1007/978-3-319-66272-5_28.","ista":"Dwivedi S, Gupta A, Roy S, Biswas R, Bhowmick P. 2017. Fast and Efficient Incremental Algorithms for Circular and Spherical Propagation in Integer Space. 20th IAPR International Conference. DGCI: International Conference on Discrete Geometry for Computer Imagery, LNCS, vol. 10502, 347–359."},"quality_controlled":"1","title":"Fast and Efficient Incremental Algorithms for Circular and Spherical Propagation in Integer Space","alternative_title":["LNCS"],"_id":"5801","place":"Cham","author":[{"first_name":"Shivam","full_name":"Dwivedi, Shivam","last_name":"Dwivedi"},{"first_name":"Aniket","full_name":"Gupta, Aniket","last_name":"Gupta"},{"last_name":"Roy","first_name":"Siddhant","full_name":"Roy, Siddhant"},{"orcid":"0000-0002-5372-7890","full_name":"Biswas, Ranita","first_name":"Ranita","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","last_name":"Biswas"},{"last_name":"Bhowmick","full_name":"Bhowmick, Partha","first_name":"Partha"}],"conference":{"location":"Vienna, Austria","name":"DGCI: International Conference on Discrete Geometry for Computer Imagery","start_date":"2017-09-19","end_date":"2017-09-21"},"doi":"10.1007/978-3-319-66272-5_28","oa_version":"None","abstract":[{"lang":"eng","text":"Space filling circles and spheres have various applications in mathematical imaging and physical modeling. In this paper, we first show how the thinnest (i.e., 2-minimal) model of digital sphere can be augmented to a space filling model by fixing certain “simple voxels” and “filler voxels” associated with it. Based on elementary number-theoretic properties of such voxels, we design an efficient incremental algorithm for generation of these space filling spheres with successively increasing radius. The novelty of the proposed technique is established further through circular space filling on 3D digital plane. As evident from a preliminary set of experimental result, this can particularly be useful for parallel computing of 3D Voronoi diagrams in the digital space."}],"publication_status":"published","publication":"20th IAPR International Conference","extern":"1","type":"conference","date_updated":"2022-01-27T15:34:25Z","volume":10502,"language":[{"iso":"eng"}],"publication_identifier":{"eisbn":["978-3-319-66272-5"],"eissn":["1611-3349"],"isbn":["978-3-319-66271-8"],"issn":["0302-9743"]},"intvolume":" 10502"}