Variations of one computational geometry problem by Jūratė Skūpienė

“…The paper tries to reveal possible stages of development which lead from the original idea to the final formulation of the problem. The computational geometry task Rectangles, used in Baltic Olympiad in Informatics' 2004 is taken as an example. …”
Get full text

Protective and Blast Resistive Design of Posttensioned Box Girders Using Computational Geometry by Majid Aleyaasin

“…The algorithm is based on a diagonal cross point in the Magnel quadrilateral and uses computational geometry instead of graphical drawing. Thereafter, an ideal parabolic and linear tendon profiles can be calculated from which the covering duct could be shaped. …”
Get full text

Secure two-party line segments intersection scheme and its application in privacy-preserving convex hull intersection by Mao-hua SUN, Shou-shan LUO, Yang XIN, Yi-xian YANG

Subjects: “…secure multi-party computational geometry…”
Get full text

Private-preserving scientific computation of the rational numbers by Xuhong LIU, Chen SUN

“…As a fundamental part of cryptography, secure multiparty computation (SMC) is a building block of various cryptographic protocols, and it is also a hot topic in the international cryptographic community.In recent years, many SMC problems, such as secret information comparison, secret set problems and secure multiparty computational geometry, have been widely studied.As many practical problems need to be described by rational numbers, it is both theoretically and practically important to study the SMC problems in the rational number field.However, most of the existing researches focus on integers and the studied data are mainly one-dimensional data.There are few researches on secure multiparty computation of multi-dimensional data in the rational number field, but they can’t be generalized.Based on the fractional representation of rational numbers, the new encoding schemes about rational numbers and rational number vectors were proposed, which could encode multi-dimensional data in the rational number field and provided new solutions for other SMC problems in the rational number field.Based on the encoding scheme and one-way hash function, some protocols were designed for equality problems and set problems in the rational number field.These protocols used basic arithmetic operation and hash operation to guarantee efficiency than existing related protocols.And these protocols didn’t limit the range of research data and they were more widely applicable.It proves that these protocols are secure in the semi-honest model using simulation paradigm, and demonstrates the efficiency and the applicability of these protocols by theoretical analysis and experiment.A practical example was also given to illustrate that approaches are more versatile, and they could also be directly used to solve some secure multiparty computational geometry problems in the rational number field.…”
Get full text

Bregman divergences for physically informed discrepancy measures for learning and computation in thermomechanics by Andrieux, Stéphane

“…Finally some results useful for computational geometry are detailed.…”
Get full text

A new view of spaces and their properties in the sense of non-Newtonian measure. by Amer Darweesh, Adel Almalki, Kamel Al-Khaled, Alaa Ayyash

“…By exploring topological characteristics and separability conditions in geometric metric spaces, this work enhances the understanding of metric spaces' structural properties, offering potential applications in fields that require flexible metric adaptations, such as data science, physics, and computational geometry. This framework's adaptability makes it relevant for scenarios where non-Euclidean or high-dimensional spaces are needed, allowing for versatile applications and extending classical metric concepts into broader analytical contexts.…”
Get full text

Approximation of planar point sets by point configurations by V. Yu. Yurkov

“…Point configurations arise naturally in several areas of computational geometry. In the paper, the linear approximation of planar point configurations is discussed. …”
Get full text

A Novel Convex Hull Coverage Algorithm for the Deployment of Electric Taxi Swap Stations Based on Urban Traffic Flow by Xudong Zhu, Lijun Yao, Yuxin Mao, Renjie Wang, Hanxiao Shi, Ji Qi

“…According to this model, a traffic drive planning algorithm based on computational geometry is presented. The experimental results illustrate that the deployment scheme obtained by the proposed algorithm is significantly optimized in terms of the deployment cost and service load and has a lower algorithm time complexity than the typical unified deployment scheme. …”
Get full text

Geometry-covering based localization for Jamming attack in wireless sensor networks by SUN Yan-qiang, WANG Xiao-dong, ZHOU Xing-ming

“…A geometry-covering based localization（GCL） algorithm was proposed with the purpose of localizing the jamming attacker in wireless sensor networks.The knowledge of the convex hull in computing geometry,especially the smallest circle covering,was utilized in the process of GCL.Simulation results showed that GCL is able to achieve higher accuracy than other comparable localization algorithms in most cases,and that has the time complexity of O（nlogn） which is proper for resource-constrained sensor networks.…”
Get full text

Computational Modeling and Theoretical Calculations on the Interactions between Spermidine and Functional Monomer (Methacrylic Acid) in a Molecularly Imprinted Polymer by Yujie Huang, Qiujin Zhu

“…We employed density functional theory (DFT) to compute geometry, single-point energy, and binding energy (ΔE) of an MIP system, where spermidine (SPD) and methacrylic acid (MAA) were selected as template and functional monomer, respectively. …”
Get full text