Topology oriented vs. exact arithmetic — Experience in implementing the three-dimensional convex hull algorithm

Author(s):  
Tsuyoshi Minakawa ◽  
Kokichi Sugihara
1997 ◽  
Vol 30 (6) ◽  
pp. 547-558 ◽  
Author(s):  
F. Dehne ◽  
X. Deng ◽  
P. Dymond ◽  
A. Fabri ◽  
A. A. Khokhar

2014 ◽  
Vol 571-572 ◽  
pp. 721-724
Author(s):  
Xiu Xun Huang ◽  
Ji Ting Zhou ◽  
Chen Ling ◽  
Wen Jun Zhang

A novel three-dimensional (3D) convex hull method is proposed, which is called dimensionality reduction convex hull method (DRCH).Through having 3d point set map to 2d plane, most initial 3D points in the convex hull are removed. Then, the remaining points are to generate 3D convex hull using any convex hull algorithm. The experiment demonstrates 3D DRCH is faster than general 3D convex hull algorithms. Its time complexity is O(r log r), where r is the number of points not in the hull. And DRCH can be generalized to higher-dimensional problems.


2021 ◽  
Vol 1790 (1) ◽  
pp. 012089
Author(s):  
Fang Qi ◽  
Sun GuangWu ◽  
Chen Yu

Author(s):  
Guy Bouchitté ◽  
Ornella Mattei ◽  
Graeme W. Milton ◽  
Pierre Seppecher

In many applications of structural engineering, the following question arises: given a set of forces f 1 ,  f 2 , …,  f N applied at prescribed points x 1 ,  x 2 , …,  x N , under what constraints on the forces does there exist a truss structure (or wire web) with all elements under tension that supports these forces? Here we provide answer to such a question for any configuration of the terminal points x 1 ,  x 2 , …,  x N in the two- and three-dimensional cases. Specifically, the existence of a web is guaranteed by a necessary and sufficient condition on the loading which corresponds to a finite dimensional linear programming problem. In two dimensions, we show that any such web can be replaced by one in which there are at most P elementary loops, where elementary means that the loop cannot be subdivided into subloops, and where P is the number of forces f 1 ,  f 2 , …,  f N applied at points strictly within the convex hull of x 1 ,  x 2 , …,  x N . In three dimensions, we show that, by slightly perturbing f 1 ,  f 2 , …,  f N , there exists a uniloadable web supporting this loading. Uniloadable means it supports this loading and all positive multiples of it, but not any other loading. Uniloadable webs provide a mechanism for channelling stress in desired ways.


IEEE Access ◽  
2021 ◽  
Vol 9 ◽  
pp. 2706-2714
Author(s):  
Xu Wei ◽  
Jiyu Li ◽  
Bo Long ◽  
Xiaodan Hu ◽  
Han Wu ◽  
...  

2011 ◽  
Vol 172-174 ◽  
pp. 1214-1219
Author(s):  
Nataliya Perevoshchikova ◽  
Benoît Appolaire ◽  
Julien Teixeira ◽  
Sabine Denis

We have adapted the Quickhull algorithm with the general dimension Beneath-Beyondalgorithm [6] for computing the convex hull of the Gibbs energy hypersurface of multicomponenttwo-phase alloys. We illustrate the salient features of our method with calculations of isothermalferrite-austenite equilibria in Fe-C-Cr. Finally, successive equilibrium calculations in a Fe-C-Cr-Mosteel over a large temperature range show the benefit of computing the convex hull before performingthe conventional Newton-Raphson search.


2018 ◽  
Vol 77 (23) ◽  
pp. 31221-31237 ◽  
Author(s):  
Runzong Liu ◽  
Yuan Yan Tang ◽  
Patrick P. K. Chan

Sign in / Sign up

Export Citation Format

Share Document