Results 81 to 90 of about 206,500 (313)
Convex partitioning of a polygon into smaller number of pieces with lowest memory consumption
Designing an algorithm to deal with a convex shape is easier than that for a concave shape. Efficient algorithms are required to process concave shapes, because every application does not deal with convex shapes.
K. R. Wijeweera, S. R. Kodituwakku
doaj +1 more source
Lombardi Drawings of Knots and Links [PDF]
Knot and link diagrams are projections of one or more 3-dimensional simple closed curves into lR2, such that no more than two points project to the same point in lR2. These diagrams are drawings of 4-regular plane multigraphs.
Vogtenhuber, Birgit +15 more
core +1 more source
Laser Powder Bed Fusion of Alumina: Effects of Scanning Strategies on External and Internal Defects
This study investigates how scanning strategies affect pure alumina in laser powder bed fusion. Linear 45° scanning yields uniform surfaces but high porosity, while the island‐concentric strategy provides higher density with through‐holes favorable for infiltration. Findings highlight pathways toward optimizing defect‐free alumina parts.
Mohamed Abdelmoula +7 more
wiley +1 more source
Research on the rectangle packing problems has mainly focused on rectangular raw material sheets without defects, while natural slate has irregular and defective characteristics, and the existing packing method adopts manual packing, which wastes ...
Kaizhi Chen +3 more
doaj +1 more source
Computational Geometry Concept Videos: A Dual-Use Project in Education and Outreach (Media Exposition) [PDF]
We present a series of nine Computational Geometry Concept Videos, available on Youtube. The videos are aimed at a general audience and introduce concepts ranging from closest and farthest pairs to data structures for range searching and for point ...
Löffler, Maarten +2 more
core +1 more source
Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees [PDF]
We wish to decide whether a simply connected flexible polygonal structure can be realized in Euclidean space. Two models are considered: polygonal linkages (body-and-joint framework) and contact graphs of unit disks in the plane.
Sub Computational Geometry +14 more
core +1 more source
A combined finite element and phase‐field approach predicts the evolution of microstructure during the directional solidification of Ni‐based superalloys. The model reveals how withdrawal rate, temperature gradient, and wall thickness control the dendrite spacing, highlighting the strong effect of surface regions in thin sections where dendrite growth ...
Sean Böhm +3 more
wiley +1 more source
Calculus and geometry are ubiquitous in the theoretical modelling of scientific phenomena, but have historically been very challenging to apply directly to real data as statistics. Diffusion geometry is a new theory that reformulates classical calculus and geometry in terms of a diffusion process, allowing these theories to generalise beyond manifolds ...
Iolo Jones, David Lanners
openaire +2 more sources
Towards Defect Phase Diagrams: From Research Data Management to Automated Workflows
A research data management infrastructure is presented for the systematic integration of heterogeneous experimental and simulation data required for defect phase diagrams. The approach combines openBIS with a companion application for large‐object storage, automated metadata extraction, provenance tracking and federated data access, thereby supporting ...
Khalil Rejiba +5 more
wiley +1 more source
Fractal and Computational Geometry for Generalizing Cartographic Objects
We present an algorithm for simplifying linear cartographic objects and results obtained with a computer program implementing this algorithm.
O. R. Musin +3 more
doaj +1 more source

