Filters








1,380 Hits in 2.3 sec

Sparse parallel Delaunay mesh refinement

Benoît Hudson, Gary L. Miller, Todd Phillips
2007 Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '07  
This is faster than the best previously known parallel Delaunay mesh refinement algorithms in two dimensions. It is the first technique with work bounds equal to the sequential case.  ...  In higher dimension, it is the first provably fast parallel technique for any kind of quality mesh refinement with PLC inputs.  ...  Several authors have experimented with shared-memory parallel Delaunay mesh refinement.  ... 
doi:10.1145/1248377.1248435 dblp:conf/spaa/HudsonMP07 fatcat:ycx4kkvc7jeopliqdsjn5rlp6e

On the Scalability of an Automatically Parallelized Irregular Application [chapter]

Martin Burtscher, Milind Kulkarni, Dimitrios Prountzos, Keshav Pingali
2008 Lecture Notes in Computer Science  
In this paper, we study the performance and scalability of a Galoised, that is, automatically parallelized, version of Delaunay mesh refinement (DR) on a shared-memory system with 128 CPUs.  ...  Traditional dependence analysis techniques are too conservative to expose this parallelism. Even manual parallelization is difficult, time consuming, and error prone.  ...  Conclusions and Future Work This paper studies the scalability of an important "irregular" sparse graph application, Delaunay mesh refinement, which has been automatically parallelized using the Galois  ... 
doi:10.1007/978-3-540-89740-8_8 fatcat:je2dfspgcfhljlrqmjx7dzvc3q

Lonestar: A suite of parallel irregular programs

Milind Kulkarni, Martin Burtscher, Calin Cascaval, Keshav Pingali
2009 2009 IEEE International Symposium on Performance Analysis of Systems and Software  
large sparse graphs.  ...  To study and understand the patterns of parallelism and locality in sparse graph computations better, we are in the process of building the Lonestar benchmark suite.  ...  Delaunay Mesh Refinement In the abstract, Delaunay Mesh Refinement is a graph refinement code.  ... 
doi:10.1109/ispass.2009.4919639 dblp:conf/ispass/KulkarniBCP09 fatcat:y27s645zdzftxdqap4nmbu5efi

Anisotropic Geodesics for Perceptual Grouping and Domain Meshing [chapter]

Sébastien Bougleux, Gabriel Peyré, Laurent Cohen
2008 Lecture Notes in Computer Science  
Our anisotropic meshing algorithm is a geodesic Delaunay refinement method that exploits a Riemannian metric in order to locally impose the orientation and aspect ratio of the created triangles.  ...  The proposed method prunes the Delaunay graph in order to correctly link together salient features in the image.  ...  Anisotropic geodesic meshing. We propose a new Delaunay refinement algorithm that extends the algorithm of Ruppert [14] with Riemannian metrics.  ... 
doi:10.1007/978-3-540-88688-4_10 fatcat:owwfxd3vxfccvf5samqhyu2rw4

The tao of parallelism in algorithms

Keshav Pingali, Mario Méndez-Lojo, Dimitrios Prountzos, Xin Sui, Donald Nguyen, Milind Kulkarni, Martin Burtscher, M. Amber Hassaan, Rashid Kaleem, Tsung-Hsien Lee, Andrew Lenharth, Roman Manevich
2011 SIGPLAN notices  
It reveals that a generalized form of data-parallelism called amorphous data-parallelism is ubiquitous in algorithms, and that, depending on the tao-structure of the algorithm, this parallelism may be  ...  exploited by compile-time, inspector-executor or optimistic parallelization, thereby unifying these seemingly unrelated parallelization techniques.  ...  produced using algorithms like Delaunay mesh generation and refinement [11] .  ... 
doi:10.1145/1993316.1993501 fatcat:yb5dohajnvghraddonquk5iyua

The tao of parallelism in algorithms

Keshav Pingali, Mario Méndez-Lojo, Dimitrios Prountzos, Xin Sui, Donald Nguyen, Milind Kulkarni, Martin Burtscher, M. Amber Hassaan, Rashid Kaleem, Tsung-Hsien Lee, Andrew Lenharth, Roman Manevich
2011 Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation - PLDI '11  
It reveals that a generalized form of data-parallelism called amorphous data-parallelism is ubiquitous in algorithms, and that, depending on the tao-structure of the algorithm, this parallelism may be  ...  exploited by compile-time, inspector-executor or optimistic parallelization, thereby unifying these seemingly unrelated parallelization techniques.  ...  produced using algorithms like Delaunay mesh generation and refinement [11] .  ... 
doi:10.1145/1993498.1993501 dblp:conf/pldi/PingaliNKBHKLLMMPS11 fatcat:blbfrhd5zffw7npa26wznr4nfq

The tao of parallelism in algorithms

Keshav Pingali, Mario Méndez-Lojo, Dimitrios Prountzos, Xin Sui, Donald Nguyen, Milind Kulkarni, Martin Burtscher, M. Amber Hassaan, Rashid Kaleem, Tsung-Hsien Lee, Andrew Lenharth, Roman Manevich
2012 SIGPLAN notices  
It reveals that a generalized form of data-parallelism called amorphous data-parallelism is ubiquitous in algorithms, and that, depending on the tao-structure of the algorithm, this parallelism may be  ...  exploited by compile-time, inspector-executor or optimistic parallelization, thereby unifying these seemingly unrelated parallelization techniques.  ...  produced using algorithms like Delaunay mesh generation and refinement [11] .  ... 
doi:10.1145/2345156.1993501 fatcat:rw74u2dd55cjbitedwwqgeuq2y

Study and Verification of Large-Scale Parallel Mesh Generation Algorithm for Centrifugal Pump

Liang Dong, Yuhang Zhang, Zhipeng Ge, Cui. Dai, Jinnan Guo
2020 Mathematical Problems in Engineering  
In addition, in order to ensure the consistency of the interface mesh and to avoid the boundary mesh intersection overlap error, a parallel constrained Delaunay mesh generation algorithm based on region  ...  First, a grid point set for the 3D Delaunay triangular mesh on the surface of the centrifugal pump is generated.  ...  Points P and Q are points in the external sphere of the triangular facet JMK that require Delaunay refine insertion. rough the parallel constrained Delaunay mesh generation algorithm based on region numbering  ... 
doi:10.1155/2020/1956852 fatcat:bv5volulwje5dg3bnmtidpddre

A Sparse Delaunay Filtration [article]

Donald R. Sheehy
2020 arXiv   pre-print
We show how a filtration of Delaunay complexes can be used to approximate the persistence diagram of the distance to a point set in R^d.  ...  The central idea is to connect Delaunay complexes on progressively denser subsamples by considering the flips in an incremental construction as simplices in d+1 dimensions.  ...  Sparse Voronoi Refinement. In Proceedings of the 15th International Meshing Roundtable, pages 339–356, Birmingham, Alabama, 2006.  ... 
arXiv:2012.01947v1 fatcat:qylglobd7fftrel5o2qg2rxh4q

Parallel FEM Simulation of Crack Propagation — Challenges, Status, and Perspectives [chapter]

Bruce Carter, Chuin-Shan Chen, L. Paul Chew, Nikos Chrisochoides, Guang R. Gao, Gerd Heber, Antony R. Ingraffea, Roland Krause, Chris Myers, Demian Nave, Keshav Pingali, Paul Stodghill (+2 others)
2000 Lecture Notes in Computer Science  
We decided to pursue the Delaunay mesh based approach first for a parallel implementation, which is described in [5] .  ...  and provably good element quality, implementing fast and robust parallel sparse solvers, and determining efficient schemes for automatic, hybrid h-p refinement.  ... 
doi:10.1007/3-540-45591-4_59 fatcat:r7jnm2xqcfcfzkgzievqeskwbu

Diagonal Discrete Hodge Operators for Simplicial Meshes Using the Signed Dual Complex

Ruben Specogna
2015 IEEE transactions on magnetics  
We present a technique to extend the geometric construction of diagonal discrete Hodge operators to arbitrary triangular and tetrahedral boundary conforming Delaunay meshes in the frequent case of piecewise  ...  In particular, it is shown how the positive definiteness of the mass matrix obtained with the signed dual complex is easily ensured for all boundary conforming Delaunay meshes without requiring-as expected  ...  Fig. 5 . 5 Geometry of the MEMS comb drive and convergence of the capacitance with adaptive mesh refinement.  ... 
doi:10.1109/tmag.2014.2350515 fatcat:miavstvkyrdwrltsqa4q7rqgkm

Morph algorithms on GPUs

Rupesh Nasre, Martin Burtscher, Keshav Pingali
2013 Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming - PPoPP '13  
In this paper, we present and study four morph algorithms: (i) a computational geometry algorithm called Delaunay Mesh Refinement (DMR), (ii) an approximate SAT solver called Survey Propagation (SP), (  ...  However, these algorithms do not modify the graph structure, so their implementation is relatively easy compared to general graph algorithms like mesh generation and refinement, which morph the underlying  ...  Delaunay Mesh Refinement Mesh generation and refinement are important components of applications in many areas such as the numerical solution of partial differential equations and graphics.  ... 
doi:10.1145/2442516.2442531 dblp:conf/ppopp/NasreBP13 fatcat:xage2i3klbcrfbxvjmlmo2ejum

Morph algorithms on GPUs

Rupesh Nasre, Martin Burtscher, Keshav Pingali
2013 SIGPLAN notices  
In this paper, we present and study four morph algorithms: (i) a computational geometry algorithm called Delaunay Mesh Refinement (DMR), (ii) an approximate SAT solver called Survey Propagation (SP), (  ...  However, these algorithms do not modify the graph structure, so their implementation is relatively easy compared to general graph algorithms like mesh generation and refinement, which morph the underlying  ...  Delaunay Mesh Refinement Mesh generation and refinement are important components of applications in many areas such as the numerical solution of partial differential equations and graphics.  ... 
doi:10.1145/2517327.2442531 fatcat:nnwk3had3jertioz55faopmy4a

Page 1088 of Mathematical Reviews Vol. , Issue 96b [page]

1996 Mathematical Reviews  
Compared with previous quadtree-based algorithms for quality mesh generation, the Delaunay refinement approach is much simpler and generally produces meshes with fewer triangles.  ...  The technique we use—successive refinement of a Delaunay triangulation—extends a mesh generation technique of Chew by allowing triangles of varying sizes.  ... 

Feature Preserving Mesh Generation from 3D Point Clouds

Nader Salman, Mariette Yvinec, Quentin Merigot
2010 Computer graphics forum (Print)  
A feature preserving variant of a Delaunay refinement process is then used to generate a mesh approximating the implicit surface and containing a faithful representation of the extracted sharp edges.  ...  Such a mesh provides an enhanced trade-off between accuracy and mesh complexity.  ...  We also thank Pierre Alliez for the precious discussions, Stephane Tayeb and Laurent Rineau to provide access to their experimental meshing code, Joel Daniels and the Aim@Shape repository for the several  ... 
doi:10.1111/j.1467-8659.2010.01771.x fatcat:55ozdjutobbntcc6mqbnbbqcga
« Previous Showing results 1 — 15 out of 1,380 results