Results 1 to 10 of about 979 (179)

Recovering the polyhedral geometry of fragmentsThe manuscript contains the link to the data [PDF]

MethodsX
Not only is the geometry of rock fragments often well approximated by ideal convex polyhedra having few faces and vertices, but these numbers carry vital geophysical information on the fragmentation process.Despite their significance, the identification ...
János Török, Gábor Domokos
doaj   +2 more sources

Adaptive data driven multi period power supply recovery method for distribution networks [PDF]

Scientific Reports
In the process of distribution network fault recovery, in order to better address the issues caused by the uncertainty of new energy power output, this paper proposes a multi period power supply recovery method for distribution networks based on adaptive
Xi Ye, Meng Yang, Zhihong Yang, Qing Xiang, Yazhuo Li   +4 more
doaj   +2 more sources

An approach for line clipping against a convex polyhedron

Ruhuna Journal of Science, 2016
Line clipping operation is a bottleneck in most of computer graphics applications. There are situations when millions of line segments need to be clipped against convex polyhedrons with millions of facets.
K. R. Wijeweera, S. R. Kodituwakku
doaj   +3 more sources

Minimum convex partitions of multidimensional polyhedrons [PDF]

Computer Science Journal of Moldova, 2007
In a normed space Rn over the field of real numbers ℜ, which is an α-space [26, 29], one derives the formula expressing the minimum number of d-convex pieces into which a geometric n-dimensional polyhedron can be partitioned.
Ion Băţ
doaj   +2 more sources

Data-based polyhedron model for optimization of engineering structures involving uncertainties

Data-Centric Engineering, 2021
This paper studies the data-based polyhedron model and its application in uncertain linear optimization of engineering structures, especially in the absence of information either on probabilistic properties or about membership functions in the fussy sets-
Zhiping Qiu, Han Wu, Isaac Elishakoff, Dongliang Liu   +3 more
doaj   +1 more source

$C^{1,\gamma}$ regularity for fully nonlinear elliptic equations on a convex polyhedron

Electronic Journal of Qualitative Theory of Differential Equations, 2022
In this note, we prove the boundary and global $C^{1,\gamma}$ regularity for viscosity solutions of fully nonlinear uniformly elliptic equations on a convex polyhedron by perturbation and iteration techniques.
Duan Wu, Pengcheng Niu
doaj   +1 more source

Closed Locally Minimal Networks on the Surfaces of Convex Polyhedra

Моделирование и анализ информационных систем, 2013
Closed locally minimal networks can be viewed as “branching” closed geodesics. We study such networks on the surfaces of convex polyhedra and discuss the problem of describing the set of all convex polyhedra that have such networks.
N. P. Strelkova
doaj   +3 more sources

Estimation of minimum volume of bounding box for geometrical metrology

International Journal of Metrology and Quality Engineering, 2020
This paper presents algorithms for estimating the minimum volume bounding box based on a three-dimensional point set measured by a coordinate measuring machine. A new algorithm, which calculates the minimum volume with high accuracy and reduced number of
Chelishchev Petr, Sørby Knut
doaj   +1 more source

A New Proof of the Euler Formula

Моделирование и анализ информационных систем, 2015
It is a new proof of the Euler formula for a convex polyhedron in R³.
M. I. Shtogrin
doaj   +3 more sources

Implementation of arbitrary polyhedral elements for automatic dynamic analyses of three-dimensional structures

Scientific Reports, 2022
The transition from the geometry to the mesh can be rather difficult, manual and time-consuming, especially for the large scale complex structures.
Lei Zhou, Jianbo Li, Gao Lin
doaj   +1 more source