Filters








6,597 Hits in 6.5 sec

Optimized Convex Hull With Mixed (MPI and OpenMP) Programming On HPC

Sandip V. Kendre, Dr.D.B. Kulkarni
2010 International Journal of Computer Applications  
This paper discusses the benefits of developing 2D and 3D convex hull on mixed mode MPI, OpenMP applications on both single and clustered SMPs.  ...  In this experimentation for purpose of optimization of 3D convex hull we merged both MPI and OpenMP library which gives another mixed mode programming method to get optimized results.  ...  Algorithm for Hybrid 3D Convex Hull Same process can be used for implementation of 3D convex hull.  ... 
doi:10.5120/118-233 fatcat:novqohzjcjehpipig6j3mn47ua

ScagnosticsJS: Extended Scatterplot Visual Features for the Web

Vung Pham, Tommy Dang
2020 Annual Conference of the European Association for Computer Graphics  
Scagnostics is a set of features that characterizes the data distribution in a scatterplot.  ...  These visual features have been used in various applications to detect unusual correlations of bivariate data. However, there is no formally published implementation for 3D or higher.  ...  The area of a 3D hull is the sum of areas of all triangles of that hull. These triangles are the faces of the hull as the result of the hull computation.  ... 
doi:10.2312/egs.20201022 dblp:conf/eurographics/PhamD20 fatcat:2cbyhtek5vb5flmiamsjdu7voq

A Preprocessing Technique for Fast Convex Hull Computation

Reham Alshamrani, Fatimah Alshehri, Heba Kurdi
2020 Procedia Computer Science  
Computing the convex hull of a set of points is a fundamental issue in many fields, including geometric computing, computer graphics, and computer vision.  ...  Abstract Computing the convex hull of a set of points is a fundamental issue in many fields, including geometric computing, computer graphics, and computer vision.  ...  Other works have focused on the 3D version of the convex hull, achieving important speedups thanks to the parallel performance of GPUs.  ... 
doi:10.1016/j.procs.2020.03.046 fatcat:5bewcm66yfea7dincwcat3dxme

CudaHull: Fast parallel 3D convex hull on the GPU

Ayal Stein, Eran Geva, Jihad El-Sana
2012 Computers & graphics  
In this paper, we present a novel parallel algorithm for computing the convex hull of a set of points in 3D using the CUDA programming model.  ...  The face refinement procedure is performed on the CPU, because it requires a very small fraction of the execution time (approximately 1%), and the intensive point redistribution is performed in parallel  ...  In this paper, we present a novel parallel algorithm for computing the convex hull of a set of points in 3D using the CUDA programming model, which generates a CPU-GPU heterogeneous executable.  ... 
doi:10.1016/j.cag.2012.02.012 fatcat:5xin5qnuujarffr6fghv7yxtqa

Efficient HPR-Based Rendering of Point Clouds

Renan Machado e Silva, Claudio Esperanca, Antonio Oliveira
2012 2012 25th SIBGRAPI Conference on Graphics, Patterns and Images  
In a nutshell, the operator consists of a simple transformation of the cloud followed by a convex hull computation.  ...  Since convex hulls take O(n log n) time to compute in the worst case, this method has been considered impractical for real-time rendering of medium to large point clouds.  ...  ACKNOWLEDGEMENTS To Diego Nehab, for educating us in GPU programming. The models Bimba, Happy Buddha, Armadillo and Asian Dragon are courtesy of the Stanford 3D Scanning Repository.  ... 
doi:10.1109/sibgrapi.2012.26 dblp:conf/sibgrapi/SilvaEO12 fatcat:g57k57tii5ea5e4srenilr2ecq

A new convexity measurement for 3D meshes

Zhouhui Lian, A. Godil, P. L. Rosin, Xianfang Sun
2012 2012 IEEE Conference on Computer Vision and Pattern Recognition  
The new convexity measure is calculated by minimizing the ratio of the summed area of valid regions in a mesh's six views, which are projected on faces of the bounding box whose edges are parallel to the  ...  by significantly improving the performance of other methods in the application of 3D shape retrieval.  ...  Our experiments validate the effectiveness of the proposed convexity measure and convexity distribution in the application of 3D shape retrieval.  ... 
doi:10.1109/cvpr.2012.6247666 dblp:conf/cvpr/LianGRS12 fatcat:rtx3x3y7gbfjbo2uidir5cttg4

ParGeo: A Library for Parallel Computational Geometry [article]

Yiqiu Wang, Rahul Yesantharao, Shangdi Yu, Laxman Dhulipala, Yan Gu, Julian Shun
2022 arXiv   pre-print
We also provide the first parallel implementations of the randomized incremental convex hull algorithm as well as a divide-and-conquer convex hull algorithm in ℝ^3.  ...  First, we present a new parallel convex hull algorithm based on a reservation technique to enable parallel modifications to the hull.  ...  The parallel 3d convex hull problem revisited. International Journal of Computational Geometry & Applications, 2(02):163-173, 1992. 12 Daniel Anderson, Guy E.  ... 
arXiv:2207.01834v1 fatcat:4vdrhejamzcejhfyphdt6bhfee

Design and Implementation of a Practical Parallel Delaunay Algorithm

G. E. Blelloch, G. L. Miller, J. C. Hardwick, D. Talmor
1999 Algorithmica  
We use the well known reduction of 2D Delaunay triangulation to find the 3D convex hull of points on a paraboloid.  ...  Initial experiments using a variety of distributions showed that our parallel algorithm was within a factor of 2 in work from the best sequential algorithm.  ...  Using the algorithm of Overmars and van Leeuwen [23] the convex hull of presorted points can be computed in serial O(n) work, and the parallel extension is straightforward.  ... 
doi:10.1007/pl00008262 fatcat:fz4tkkuicnb75b467cmparbccy

A sample implementation for parallelizing Divide-and-Conquer algorithms on the GPU

Gang Mei, Jiayin Zhang, Nengxiong Xu, Kunyang Zhao
2018 Heliyon  
In addition, our implementation can find the convex hull of 20M points in about 0.2 seconds.  ...  We present a novel GPU-accelerated implementation of the QuickHull algorihtm for calculating convex hulls of planar point sets.  ...  This research was supported by the Natural Science Foundation of China (Grant Nos. 40602037 and 40872183).  ... 
doi:10.1016/j.heliyon.2018.e00512 pmid:29560430 pmcid:PMC5857513 fatcat:ekhd4ktzrnbl3opfs4bafuvv2q

Flip-flop

Mingcen Gao, Thanh-Tung Cao, Tiow-Seng Tan, Zhiyong Huang
2013 Proceedings of the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games - I3D '13  
It overcomes the deficiency of the traditional one to always compute the convex hull of a given starshaped polyhedron with provable correctness.  ...  However, it is known that the traditional flip algorithm is not able to compute the convex hull when applied to a polyhedron in R 3 . Our novel Flip-Flop algorithm is a variant of the flip algorithm.  ...  Without loss of generality, let the intersection of t1 and the line vs be nearer to s than that of t2, and let H be the plane through s and parallel to t1.  ... 
doi:10.1145/2448196.2448203 dblp:conf/si3d/GaoCTH13 fatcat:zes7dzd3svgizb2yxf6eyoi7ty

A GPU accelerated algorithm for 3D Delaunay triangulation

Thanh-Tung Cao, Ashwin Nanjappa, Mingcen Gao, Tiow-Seng Tan
2014 Proceedings of the 18th meeting of the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games - I3D '14  
Although a flipping algorithm is very amenable to parallel processing and has been employed to construct the 2D DT and the 3D convex hull on the GPU, to our knowledge there is no such successful attempt  ...  We propose the first algorithm to compute the 3D Delaunay triangulation (DT) on the GPU.  ...  For the GPU, there are also a few recent works to compute the 2D DT [Qi et al. 2012 ] and the 3D convex hull [Gao et al. 2013 ].  ... 
doi:10.1145/2556700.2556710 dblp:conf/si3d/CaoNGT14 fatcat:jo3i7khl2fglnpj5xqblqxn6b4

Detecting textured objects using convex hull

Kefei Lu, Theo Pavlidis
2007 Machine Vision and Applications  
We compute the convex hull of the main cluster as well as the convex hull of all clusters.  ...  The confidence of a convex hull edge is defined as follows: Let K denote the set of lines in a cluster (or a group of them) from which the convex hull is computed.  ... 
doi:10.1007/s00138-006-0060-0 fatcat:kthvhphutne4vcjdbucawmtrg4

Automatic Virtualization of Real Object Based on Shape Knowledge in Mixed Reality [chapter]

Kenji Funahashi, Kazunari Komura, Yuji Iwahori, Yukie Koyama
2004 Lecture Notes in Computer Science  
The camera parameters are also estimated through the system, and roughly drawn shape of a real object is represented in virtual space with the texture mapping.  ...  This method reconstructs the object shape automatically from a few input images using the knowledge of shape for the artificial or the real object.  ...  Acknowledgments The authors thank the colleagues in our laboratory for their useful discussions. This research was supported in part by the Hori Information Sciense Promotion Foundation.  ... 
doi:10.1007/978-3-540-30133-2_15 fatcat:y5zgjwg3wngtxe56iba4nnmwnu

Stem and Calyx Identification of 3D Apples Using Multi-Threshold Segmentation and 2D Convex Hull

Man Xia, Haojie Zhu, Yuwei Wang, Jiaxu Cai, Lu Liu
2022 Photonics  
This method applies a fringe projection in a computer vision system of 3D reconstruction, followed by multi-threshold segmentation and a 2D convex hull technique to identify the stem and calyx.  ...  The segmentation results were then subjected to a 2D convex hull technique, allowing for the identification of the stem and calyx.  ...  Conflicts of Interest: The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.  ... 
doi:10.3390/photonics9050346 fatcat:xnngzlidenfsfkjmjm6etbxilm

Binary upscaling on complex heterogeneities: The role of geometry and connectivity

F. Oriani, P. Renard
2014 Advances in Water Resources  
This result suggests that, in order to estimate K eq properly, one may consider the convex hull of each connected component as the area of influence of its spatial distribution on flow and make a correction  ...  indicator, related to the convex hull of the connected components, presents a direct correlation with K eq .  ...  The 3D labeling is performed using the matlab function bwlabeln (Copyright 1984-2011 The MathWorks, Inc., based on [42] ) and the 3D computation of the convex hull is based on [38] , according to the  ... 
doi:10.1016/j.advwatres.2013.12.003 fatcat:zi3ldkhzxbcwpjwx63eocnlxci
« Previous Showing results 1 — 15 out of 6,597 results