An exact algorithm for constructing minimum Euclidean skeletons of polygons

Autor: Marcus Volz, Charl J. Ras, Nicolau Andrés-Thió, Doreen A. Thomas, Marcus Brazil

Publikováno v: Journal of Global Optimization. 83:137-162

A Euclidean skeleton is a set of edges in the interior (or on the boundary) of a polygon that intersects any line segment that joins two points outside of the polygon and that intersects the polygon. In this paper we study minimum cardinality Euclide

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::97fc614c286d2e0176f96e87bee7d0d4
https://doi.org/10.1007/s10898-021-01101-3

Computational complexity of the 2-connected Steiner network problem in the ℓ plane

Autor: Charl J. Ras, Doreen A. Thomas, Marcus Brazil

Publikováno v: Theoretical Computer Science. 850:168-184

The geometric 2-connected Steiner network problem asks for a shortest bridgeless network spanning a given set of terminals in the plane such that the total length of all edges of the network, as measured in the l p metric, is a minimum. Using reducti

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::200a877f80ebb3cf4f7832b1640a28df
https://doi.org/10.1016/j.tcs.2020.11.002

Fixed parameter tractability of a biconnected bottleneck Steiner network problem

Autor: Charl J. Ras

Publikováno v: Networks. 75:310-320

For a given set X of points in the plane, we consider the problem of constructing a 2-vertex-connected network spanning X and at most k additional Steiner points such that the length of the longest edge (the so-called bottleneck) of the network is mi

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::f04f248c3100005910b14e96d9d60c95
https://doi.org/10.1002/net.21926

Early prediction of macrocrack location in concrete, rocks and other granular composite materials

Autor: Sanath Kahagalage, Jacek Tejchman, Michał Nitka, Antoinette Tordesillas, Charl J. Ras

Publikováno v: Scientific Reports
Scientific Reports, Vol 10, Iss 1, Pp 1-16 (2020)

Heterogeneous quasibrittle composites like concrete, ceramics and rocks comprise grains held together by bonds. The question on whether or not the path of the crack that leads to failure can be predicted from known microstructural features, viz. bond

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3e093aeefc587ccf38ac3d9ecbcbf069
https://pubmed.ncbi.nlm.nih.gov/33219335

New pruning rules for the Steiner tree problem and 2-connected Steiner network problem

Autor: Charl J. Ras, Marcus Brazil, Martin Zachariasen, Marcus Volz, Doreen A. Thomas

Publikováno v: Brazil, M, Volz, M, Zachariasen, M, Ras, C & Thomas, D 2019, ' New pruning rules for the Steiner tree problem and 2-connected Steiner network problem ', Computational Geometry: Theory and Applications, vol. 78, pp. 37-49 . https://doi.org/10.1016/j.comgeo.2018.10.003

We introduce the concepts of k-lunes and k-lune inequalities, which form the basis for new geometric pruning rules for limiting the number of candidate full components that need to be considered when solving the Euclidean Steiner tree problem or the

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ff3a1872198abc619072b420ce3d624a
https://findresearcher.sdu.dk:8443/ws/files/145710673/New_pruning_rules_for_the_Steiner_tree_problem_and_2_connected....pdf