[{"status":"public","intvolume":"       142","type":"journal_article","day":"01","issue":"10","publication":"Pattern Recognition","language":[{"iso":"eng"}],"publisher":"Elsevier","scopus_import":"1","date_published":"2023-10-01T00:00:00Z","article_type":"original","month":"10","date_created":"2023-06-18T22:00:45Z","department":[{"_id":"HeEd"}],"author":[{"full_name":"Čomić, Lidija","last_name":"Čomić","first_name":"Lidija"},{"first_name":"Gaëlle","last_name":"Largeteau-Skapin","full_name":"Largeteau-Skapin, Gaëlle"},{"first_name":"Rita","last_name":"Zrour","full_name":"Zrour, Rita"},{"last_name":"Biswas","full_name":"Biswas, Ranita","orcid":"0000-0002-5372-7890","first_name":"Ranita","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Andres, Eric","last_name":"Andres","first_name":"Eric"}],"abstract":[{"lang":"eng","text":"We propose a characterization of discrete analytical spheres, planes and lines in the body-centered cubic (BCC) grid, both in the Cartesian and in the recently proposed alternative compact coordinate system, in which each integer triplet addresses some voxel in the grid. We define spheres and planes through double Diophantine inequalities and investigate their relevant topological features, such as functionality or the interrelation between the thickness of the objects and their connectivity and separation properties. We define lines as the intersection of planes. The number of the planes (up to six) is equal to the number of the pairs of faces of a BCC voxel that are parallel to the line."}],"publication_status":"published","citation":{"mla":"Čomić, Lidija, et al. “Discrete Analytical Objects in the Body-Centered Cubic Grid.” <i>Pattern Recognition</i>, vol. 142, no. 10, 109693, Elsevier, 2023, doi:<a href=\"https://doi.org/10.1016/j.patcog.2023.109693\">10.1016/j.patcog.2023.109693</a>.","ama":"Čomić L, Largeteau-Skapin G, Zrour R, Biswas R, Andres E. Discrete analytical objects in the body-centered cubic grid. <i>Pattern Recognition</i>. 2023;142(10). doi:<a href=\"https://doi.org/10.1016/j.patcog.2023.109693\">10.1016/j.patcog.2023.109693</a>","short":"L. Čomić, G. Largeteau-Skapin, R. Zrour, R. Biswas, E. Andres, Pattern Recognition 142 (2023).","ista":"Čomić L, Largeteau-Skapin G, Zrour R, Biswas R, Andres E. 2023. Discrete analytical objects in the body-centered cubic grid. Pattern Recognition. 142(10), 109693.","apa":"Čomić, L., Largeteau-Skapin, G., Zrour, R., Biswas, R., &#38; Andres, E. (2023). Discrete analytical objects in the body-centered cubic grid. <i>Pattern Recognition</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.patcog.2023.109693\">https://doi.org/10.1016/j.patcog.2023.109693</a>","ieee":"L. Čomić, G. Largeteau-Skapin, R. Zrour, R. Biswas, and E. Andres, “Discrete analytical objects in the body-centered cubic grid,” <i>Pattern Recognition</i>, vol. 142, no. 10. Elsevier, 2023.","chicago":"Čomić, Lidija, Gaëlle Largeteau-Skapin, Rita Zrour, Ranita Biswas, and Eric Andres. “Discrete Analytical Objects in the Body-Centered Cubic Grid.” <i>Pattern Recognition</i>. Elsevier, 2023. <a href=\"https://doi.org/10.1016/j.patcog.2023.109693\">https://doi.org/10.1016/j.patcog.2023.109693</a>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"The first author has been partially supported by the Ministry of Science, Technological Development and Innovation of the Republic of Serbia through the project no. 451-03-47/2023-01/200156. The fourth author is funded by the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), grant no. I 02979-N35.","project":[{"grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes","call_identifier":"FWF"},{"grant_number":"I4887","name":"Discretization in Geometry and Dynamics","_id":"0aa4bc98-070f-11eb-9043-e6fff9c6a316"}],"oa_version":"None","quality_controlled":"1","_id":"13134","publication_identifier":{"issn":["0031-3203"]},"date_updated":"2023-10-10T07:37:16Z","volume":142,"article_processing_charge":"No","title":"Discrete analytical objects in the body-centered cubic grid","external_id":{"isi":["001013526000001"]},"year":"2023","doi":"10.1016/j.patcog.2023.109693","isi":1,"article_number":"109693"},{"language":[{"iso":"eng"}],"scopus_import":"1","publisher":"Elsevier","date_published":"1983-07-01T00:00:00Z","article_type":"original","month":"07","date_created":"2018-12-11T12:07:05Z","status":"public","intvolume":"        17","type":"journal_article","day":"01","page":"251 - 257","publication":"Pattern Recognition","issue":"2","title":"An optimal algorithm for constructing the weighted Voronoi diagram in the plane","doi":"10.1016/0031-3203(84)90064-5","year":"1983","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/0031320384900645?via%3Dihub"}],"author":[{"first_name":"Franz","full_name":"Aurenhammer, Franz","last_name":"Aurenhammer"},{"last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"abstract":[{"text":"Let S denote a set of n points in the plane such that each point p has assigned a positive weight w(p) which expresses its capability to influence its neighbourhood. In this sense, the weighted distance of an arbitrary point x from p is given by de(x,p)/w(p) where de denotes the Euclidean distance function. The weighted Voronoi diagram for S is a subdivision of the plane such that each point p in S is associated with a region consisting of all points x in the plane for which p is a weighted nearest point of S.\r\n\r\nAn algorithm which constructs the weighted Voronoi diagram for S in O(n2) time is outlined in this paper. The method is optimal as the diagram can consist of Θ(n2) faces, edges and vertices.\r\n","lang":"eng"}],"citation":{"ista":"Aurenhammer F, Edelsbrunner H. 1983. An optimal algorithm for constructing the weighted Voronoi diagram in the plane. Pattern Recognition. 17(2), 251–257.","short":"F. Aurenhammer, H. Edelsbrunner, Pattern Recognition 17 (1983) 251–257.","ama":"Aurenhammer F, Edelsbrunner H. An optimal algorithm for constructing the weighted Voronoi diagram in the plane. <i>Pattern Recognition</i>. 1983;17(2):251-257. doi:<a href=\"https://doi.org/10.1016/0031-3203(84)90064-5\">10.1016/0031-3203(84)90064-5</a>","mla":"Aurenhammer, Franz, and Herbert Edelsbrunner. “An Optimal Algorithm for Constructing the Weighted Voronoi Diagram in the Plane.” <i>Pattern Recognition</i>, vol. 17, no. 2, Elsevier, 1983, pp. 251–57, doi:<a href=\"https://doi.org/10.1016/0031-3203(84)90064-5\">10.1016/0031-3203(84)90064-5</a>.","chicago":"Aurenhammer, Franz, and Herbert Edelsbrunner. “An Optimal Algorithm for Constructing the Weighted Voronoi Diagram in the Plane.” <i>Pattern Recognition</i>. Elsevier, 1983. <a href=\"https://doi.org/10.1016/0031-3203(84)90064-5\">https://doi.org/10.1016/0031-3203(84)90064-5</a>.","apa":"Aurenhammer, F., &#38; Edelsbrunner, H. (1983). An optimal algorithm for constructing the weighted Voronoi diagram in the plane. <i>Pattern Recognition</i>. Elsevier. <a href=\"https://doi.org/10.1016/0031-3203(84)90064-5\">https://doi.org/10.1016/0031-3203(84)90064-5</a>","ieee":"F. Aurenhammer and H. Edelsbrunner, “An optimal algorithm for constructing the weighted Voronoi diagram in the plane,” <i>Pattern Recognition</i>, vol. 17, no. 2. Elsevier, pp. 251–257, 1983."},"publication_status":"published","oa_version":"None","quality_controlled":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","acknowledgement":"The second author gratefully acknowledges discussions on the presented topic with David Kirkpatrick and Raimund Seidel.","publication_identifier":{"eissn":["1873-5142"],"issn":["0031-3203"]},"extern":"1","_id":"4125","article_processing_charge":"No","publist_id":"1997","date_updated":"2022-01-27T14:06:27Z","volume":17}]