A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Filters
Practical and efficient point insertion scheduling method for parallel guaranteed quality delaunay refinement
2004
Proceedings of the 18th annual international conference on Supercomputing - ICS '04
Preserved Fulltext
We describe a parallel scheduler, for guaranteed quality parallel mesh generation and refinement methods. ...
and unpredictable communication of the other existing practical parallel guaranteed quality mesh generation and refinement method. ...
This theory leads to an efficient and practical parallel Delaunay refinement scheduling algorithm. ...
doi:10.1145/1006209.1006217
dblp:conf/ics/ChernikovC04
fatcat:pvigh5jrdrhdblim52h5fk4k5a
Three-dimensional delaunay refinement for multi-core processors
2008
Proceedings of the 22nd annual international conference on Supercomputing - ICS '08
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
We develop the first ever fully functional three-dimensional guaranteed quality parallel graded Delaunay mesh generator. ...
First, we prove a criterion and a sufficient condition of Delaunay-independence of Steiner points in three dimensions. ...
This work was supported (in part) by the NSF grant CCS-0750901 and by the John Simon Guggenheim Foundation. We thank the anonymous referees for their comments.
REFERENCES ...
doi:10.1145/1375527.1375560
dblp:conf/ics/ChernikovC08
fatcat:zuavhbdq3vg55n6qssdeczdqwi
Scalable 3D hybrid parallel Delaunay image-to-mesh conversion algorithm for distributed shared memory architectures
2017
Computer-Aided Design
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In each subregion, a group of threads is assigned to insert or delete multiple points based on the refinement rules offered by PODM. ...
To the best of our knowledge, PDR.PODM exhibits the best scalability among parallel guaranteed quality Delaunay mesh generation algorithms running on DSM supercomputers. c 2015 The Authors. ...
We thank the systems group in the Pittsburgh Supercomputing Center for their great help and support. We especially thank Panagiotis Foteinos and David O'Neal for many insightful discussions. ...
doi:10.1016/j.cad.2016.07.010
fatcat:qellksxuo5eupkethjwnwcvlkq
Scalable 3D Hybrid Parallel Delaunay Image-to-Mesh Conversion Algorithm for Distributed Shared Memory Architectures
2015
Procedia Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In each subregion, a group of threads is assigned to insert or delete multiple points based on the refinement rules offered by PODM. ...
To the best of our knowledge, PDR.PODM exhibits the best scalability among parallel guaranteed quality Delaunay mesh generation algorithms running on DSM supercomputers. c 2015 The Authors. ...
We thank the systems group in the Pittsburgh Supercomputing Center for their great help and support. We especially thank Panagiotis Foteinos and David O'Neal for many insightful discussions. ...
doi:10.1016/j.proeng.2015.10.119
fatcat:6phuqtpqmnfullnfcfmus7kji4
A template for developing next generation parallel Delaunay refinement methods
2010
Finite elements in analysis and design
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Our sufficient conditions of point Delaunay-independence allow to select points for concurrent insertion in such a way that the standard sequential guaranteed quality Delaunay refinement procedures can ...
We describe a complete solution for both sequential and parallel construction of guaranteed quality Delaunay meshes for general two-dimensional geometries. ...
In this paper we lay out an approach for the implementation of next generation parallel guaranteed quality Delaunay mesh generation and refinement. ...
doi:10.1016/j.finel.2009.06.014
fatcat:yoev7a3fqbbgxktvvbvz3hpxt4
Parallel Guaranteed Quality Delaunay Uniform Mesh Refinement
2006
SIAM Journal on Scientific Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Our method requires only local communication, which is bulk and structured as opposed to fine and unpredictable communication of the other existing practical parallel guaranteed quality mesh generation ...
We present a theoretical framework for developing parallel guaranteed quality Delaunay mesh generation software, that allows us to use commercial off-the-shelf sequential Delaunay meshers for two-dimensional ...
Section 2 presents the theoretical framework for our parallel guaranteed quality Delaunay refinement algorithm. ...
doi:10.1137/050625886
fatcat:lz3n4ofqobcddbvwtcq2ulbkhq
Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains
2004
Computational geometry
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We describe a distributed memory parallel Delaunay refinement algorithm for simple polyhedral domains whose constituent bounding edges and surfaces are separated by angles between 90 • to 270 • inclusive ...
The algorithm we describe is the first step in the development of much more sophisticated guaranteed-quality parallel mesh generation algorithms. ...
We would also like to thank the reviewers for their helpful suggestions for improving the original version of this paper. ...
doi:10.1016/s0925-7721(04)00024-0
fatcat:nvjj7kmwqbae3o4rgeklnomu24
Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains
2004
Computational geometry
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We describe a distributed memory parallel Delaunay refinement algorithm for simple polyhedral domains whose constituent bounding edges and surfaces are separated by angles between 90 • to 270 • inclusive ...
The algorithm we describe is the first step in the development of much more sophisticated guaranteed-quality parallel mesh generation algorithms. ...
We would also like to thank the reviewers for their helpful suggestions for improving the original version of this paper. ...
doi:10.1016/j.comgeo.2004.03.009
fatcat:eectadyrjvauzm37g3iblw6eoi
Guaranteed
2002
Proceedings of the eighteenth annual symposium on Computational geometry - SCG '02
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We describe a distributed memory parallel Delaunay refinement algorithm for simple polyhedral domains whose constituent bounding edges and surfaces are separated by angles between 90 • to 270 • inclusive ...
The algorithm we describe is the first step in the development of much more sophisticated guaranteed-quality parallel mesh generation algorithms. ...
We would also like to thank the reviewers for their helpful suggestions for improving the original version of this paper. ...
doi:10.1145/513400.513418
dblp:conf/compgeom/NaveCC02
fatcat:hpyn2b2tn5blpf4o6djyt4arzi
Towards Exascale Parallel Delaunay Mesh Generation
[chapter]
2009
Proceedings of the 18th International Meshing Roundtable
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
methods by at least 10 orders of magnitude and (2) a new abstraction for multi-layered runtime systems that target parallel mesh generation codes, to efficiently orchestrate intra-and inter-layer data ...
movement and load balancing for current and emerging multi-layered architectures with deep memory and network hierarchies. ...
We thank the anonymous reviewers for detailed comments which helped us improve the manuscript. We thank Professor Harry Wang and Dr. ...
doi:10.1007/978-3-642-04319-2_19
dblp:conf/imr/ChrisochoidesCFKLF09
fatcat:baal34mwvrhkvdzchqygh3msvq
Unstructured Mesh Generation
[chapter]
2012
Combinatorial Scientific Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Guaranteed-Quality Mesh Generation The story of guaranteed-quality meshing is an interplay of ideas between Delaunay methods and methods based on grids, quadtrees, and octrees. ...
The following year, Paul Chew [33] gave a more practical algorithm, based on Delaunay refinement, that guarantees angles between 30 • and 120 • . ...
An algorithm by Labelle [67] is a true hybrid of the Delaunay and octree methods: it refines a Delaunay triangulation by inserting vertices at lattice points near the circumcenters of skinny tetrahedra ...
doi:10.1201/b11644-11
fatcat:zjfel6436jhwlidqrtkvjt3ezy
Quality tetrahedral mesh generation with HXT
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We proposed, in a recent paper (10.1002/nme.5987), a fast 3D parallel Delaunay kernel for tetrahedral mesh generation. ...
The present paper builds on that previous work and proposes a fast parallel mesh improvement stage that delivers high-quality tetrahedral meshes compared to alternative open-source mesh generators. ...
above can be parallelized pretty much in the same way as the Delaunay refinement. ...
arXiv:2008.08508v1
fatcat:gkprecyo2fgs5gltqlxso5iwgq
High quality conservative surface mesh generation for swept volumes
2012
2012 IEEE International Conference on Robotics and Automation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We present a novel, efficient and flexible scheme to generate a high quality mesh that approximates the outer boundary of a swept volume. Our approach comes with two guarantees. ...
The meshing phase utilizes Delaunay refinement which we carefully modified such that required guarantees are met. ...
Abstract-We present a novel, efficient and flexible scheme to generate a high quality mesh that approximates the outer boundary of a swept volume. Our approach comes with two guarantees. ...
doi:10.1109/icra.2012.6224921
dblp:conf/icra/DziegielewskiHS12
fatcat:ctgiks2cebdplnpwq3n2uafjdy
A Constrained Resampling Strategy for Mesh Improvement
2017
Computer graphics forum (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We apply our strategy to both planar and surface meshes demonstrating how to simplify Delaunay meshes while preserving element quality, eliminate all obtuse angles in a complex mesh, and maximize the shortest ...
The conflicting nature of such objectives makes it challenging to establish similar guarantees for each combination, e.g., angle bounds and vertex count. ...
Acknowledgements The authors would like to thank Dong-Ming Yan, Kaimo Hu [HYB * 16] and Jianwei Guo [AGY * 16] for providing valuable input and helping run some additional tests, and Darren Engwirda for ...
doi:10.1111/cgf.13256
fatcat:4uhvhfan2vfpbglbsiq53lauqa
An Experimental Study of Sliver Exudation
2002
Engineering with Computers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The first step refines the triangulation by inserting sinks and eliminates tetrahedra with large circumradius over shortest edge length ratio. ...
Our experimental findings provide evidence for the practical effectiveness of sliver exudation. ...
Baker for the Hog data, Raindrop Geomagic for the Tooth data, and Holun Cheng for his skin software that generates surface mesh of Permutahedron. ...
doi:10.1007/s003660200020
fatcat:rek4vpccenggjgesaarq34fua4
« Previous
Showing results 1 — 15 out of 259 results