The sphere packing problem into bounded containers in three-dimension non-Euclidean space
Sign Up to like & getrecommendations! Published in 2018 at "IFAC-PapersOnLine"
DOI: 10.1016/j.ifacol.2018.11.450
Abstract: Abstract This paper deals with the problem of optimal packing a given number of equal spheres into different closed sets. We consider the problem both in three-dimensional Euclidean and non-Euclidean spaces. The special algorithm based… read more here.
Keywords: space; problem bounded; non euclidean; problem ... See more keywords
Automatic mesh generation for electromagnetic simulation on complex industry products
Sign Up to like & getrecommendations! Published in 2025 at "Engineering Computations"
DOI: 10.1108/ec-03-2025-0192
Abstract: PurposeThis paper aims to develop a novel scheme for automatically generating high-quality tetrahedral meshes for electromagnetic simulations on complex industrial products, even in the presence of geometric defects.Design/methodology/approachThis paper substantially revises and improves three techniques… read more here.
Keywords: automatic mesh; cut fix; electromagnetic simulation; sphere packing ... See more keywords
Single-mask sphere-packing with implicit neural representation reconstruction for ultrahigh-speed imaging.
Sign Up to like & getrecommendations! Published in 2025 at "Optics express"
DOI: 10.1364/oe.561323
Abstract: Single-shot, high-speed 2D optical imaging is essential for studying transient phenomena in various research fields. Among existing techniques, compressed optical-streaking ultra-high-speed photography (COSUP) uses a coded aperture and a galvanometer scanner to capture non-repeatable time-evolving… read more here.
Keywords: implicit neural; neural representation; speed; reconstruction ... See more keywords
A global dichotomous search-based heuristic for the three-dimensional sphere packing problem
Sign Up to like & getrecommendations! Published in 2018 at "International Journal of Operational Research"
DOI: 10.1504/ijor.2018.10016371
Abstract: In this paper, we propose a global dichotomous search-based heuristic for solving the three-dimensional sphere packing problem. In the sphere packing problem, we are given a set of predefined unequal spheres and a large container… read more here.
Keywords: search; global dichotomous; dichotomous search; problem ... See more keywords