Filters








9,958 Hits in 4.2 sec

OVERLAYING SURFACE MESHES, PART I: ALGORITHMS

XIANGMIN JIAO, MICHAEL T. HEATH
2004 International journal of computational geometry and applications  
We describe an efficient and robust algorithm for computing a common refinement of two meshes modeling the same surface of arbitrary shape by overlaying them on top of each other.  ...  We present the verification and some further enhancement of robustness in Part II.  ...  The authors thank Professor Herbert Edelsbrunner for helpful discussions on the topic of overlay. We thank anonymous referees for their helpful comments in improving the presentation of the paper.  ... 
doi:10.1142/s0218195904001512 fatcat:hc3kldaquffchn2hq4markinzi

OVERLAYING SURFACE MESHES, PART II: TOPOLOGY PRESERVATION AND FEATURE MATCHING

XIANGMIN JIAO, MICHAEL T. HEATH
2004 International journal of computational geometry and applications  
In Part I, we described an efficient and robust algorithm for computing a common refinement of two surface meshes.  ...  We report experimental results using our enhanced overlay algorithm with feature matching for complex geometries from real-world applications.  ...  Ho-lun Cheng at National University of Singapore for providing some of the test meshes. We thank anonymous referees for their helpful comments in improving the presentation of the paper.  ... 
doi:10.1142/s0218195904001524 fatcat:22isfheerbhltbxv2ubsgorgxi

Fast Algorithm for Simulating Lipid Vesicle Deformation I: Spherical Harmonic Approximation [article]

Michael Mikucki, Y. C. Zhou
2014 arXiv   pre-print
In this article we developed a fast algorithm to compute the surface configurations of lipid vesicles by introducing the surface harmonic functions to approximate the surfaces.  ...  Vesicle deformations with a reduced volume larger than 0.65 can be well approximated by using as small as 49 surface harmonic functions.  ...  element methods with a triangular mesh.  ... 
arXiv:1411.3964v1 fatcat:kz4i7oi45fhuboagahb5c7ekiu

An algorithm for the construction of intrinsic delaunay triangulations with applications to digital geometry processing

Matthew Fisher, Boris Springborn, Alexander I. Bobenko, Peter Schroder
2006 ACM SIGGRAPH 2006 Courses on - SIGGRAPH '06  
We give an incremental algorithm to construct such triangulations together with an overlay structure which captures the relationship between the extrinsic and intrinsic triangulations.  ...  The intrinsic Laplace-Beltrami operator is based on an intrinsic Delaunay triangulation of the surface.  ...  Acknowledgments This work was supported in part by NSF (CCF-0528101), DFG Research Center MATHEON "Mathematics for Key Technologies", DOE (W-7405-ENG-48/B341492), the Caltech Center for Mathematics of  ... 
doi:10.1145/1185657.1185668 dblp:conf/siggraph/FisherSBS06 fatcat:ohxbhb77dba4raattrgahiwuji

An Adaptive Progressive Mesh Reconstruction Algorithm for Spatial Discrete Points

Shujun Zhang
2012 Procedia Engineering  
This paper proposed an adaptive progressive mesh reconstruction algorithm for spatial discrete points.  ...  Stereo vision can restore the depth of points but only obtain the coordinates of discrete points, which need to be formed into mesh model using surface reconstruction method.  ...  Delaunay triangulation of planar point set Fig. 2 2 Overlay of two coplanar triangles result of surface mesh (a) sphere; (b) bunny.  ... 
doi:10.1016/j.proeng.2012.01.009 fatcat:2dwppciwhzedxcri57ny6pm5da

Abdominal Wall Reconstruction [chapter]

Justin A. Doble, Eric M. Pauli
2019 Clinical Algorithms in General Surgery  
Mesh can be used to patch the abdominal wall defect, but I prefer the autogenous closure provided by the separation of parts procedure (Fig. 69.3) (13) .  ...  As such, without any undermined skin flaps in the midline, mesh cannot be used in overlay fashion.  ... 
doi:10.1007/978-3-319-98497-1_196 fatcat:g5zzscgsorh3bgkp6nlzo76fmy

A subzone reconstruction algorithm for efficient staggered compatible remapping

D.P. Starinshak, J.M. Owen
2015 Journal of Computational Physics  
Staggered-grid Lagrangian hydrodynamics algorithms frequently make use of subzonal discretization of state variables for the purposes of improved numerical accuracy, generality to unstructured meshes,  ...  Ideas for extending the algorithm to staggered-grid radiation-hydrodynamics are discussed as well as ideas for generalizing the algorithm to include inequality constraints.  ...  Although we do not have a direct subzone-to-subzone overlay to compare timing results, we can nevertheless compare how each method scales relative to the number of mesh elements taking part in the overlay  ... 
doi:10.1016/j.jcp.2015.04.046 fatcat:ynt73453fjf73ab23sli42wiam

Craniofacial Superimposition in Forensic Identification using Genetic Algorithms

Lucia Ballerini, Oscar Cordon, Sergio Damas, Jose Santamaría, Inmaculada Aleman, Miguel Botella
2007 Third International Symposium on Information Assurance and Security  
The proposed method is based on real-coded genetic algorithms. Synthetic data are used to validate the method.  ...  Craniofacial superimposition is a process that aims to identify a person by overlaying a photograph and a model of the skull.  ...  We plan to extend this study by using other evolutionary algorithms, as for example the Scatter Search algorithm that we already applied to the IR problem with very good results.  ... 
doi:10.1109/ias.2007.80 dblp:conf/IEEEias/BalleriniCDSAB07 fatcat:syoalefterhytplr7vklhxl4qq

Video georegistration: algorithm and quantitative evaluation

R.P. Wildes, D.J. Hirvonen, S.C. Hsu, R. Kumar, W.B. Lehman, B. Matei, W.-Y. Zhao
2001 Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001  
An algorithm is presented for video georegistration, with a particular concern for aerial video, i.e., video captured from an airborne platform.  ...  (i) Frame-to-frume constraints are derived from the frame-to-frame alignments that were computed as part of the (video) image representation.  ...  Here, the algorithm is still capable of providing a precise registration as shown in the final overlay.  ... 
doi:10.1109/iccv.2001.937646 dblp:conf/iccv/WildesHHKLMZ01 fatcat:t737fywhzneoxipehdejt3xlkm

A Delaunay Simplification Algorithm for Vector Fields

Tamal K. Dey, Joshua A. Levine, Rephael Wenger
2007 15th Pacific Conference on Computer Graphics and Applications (PG'07)  
We present a Delaunay based algorithm for simplifying vector field datasets.  ...  Our aim is to reduce the size of the mesh on which the vector field is defined while preserving topological features of the original vector field.  ...  At each vertex p i of the mesh, we fix our vector field as f i .  ... 
doi:10.1109/pg.2007.34 dblp:conf/pg/DeyLW07 fatcat:grrpwipuibabjg7wduolusnwfe

Adaptive Mesh and Algorithm Refinement Using Direct Simulation Monte Carlo

Alejandro L Garcia, John B Bell, William Y Crutchfield, Berni J Alder
1999 Journal of Computational Physics  
Adaptive mesh and algorithm refinement (AMAR) embeds a particle method within a continuum method at the finest level of an adaptive mesh refinement (AMR) hierarchy.  ...  The coupling between the particle region and the overlaying continuum grid is algorithmically equivalent to that between the fine and coarse levels of AMR.  ...  ADAPTIVE MESH AND ALGORITHM REFINEMENT Adaptive mesh and algorithm refinement (AMAR) uses the same basic algorithmic outline as AMR, as presented in the previous section, except that the finest grid level  ... 
doi:10.1006/jcph.1999.6305 fatcat:e5tswlmgmjcldngzo437aknrhe

Sliding mesh algorithm for CFD analysis of helicopter rotor-fuselage aerodynamics

R. Steijl, G. Barakos
2008 International Journal for Numerical Methods in Fluids  
The sliding surface allows communication between meshes. Meshes adjacent to the sliding surface do not necessarily have matching nodes or even the same number of cell faces.  ...  As an additional objective, the employed sliding mesh algorithms should have small CPU overhead.  ...  the interfaces between the mesh parts with relative motion.  ... 
doi:10.1002/fld.1757 fatcat:pczaeeccyjbkjfnyke6qjf4afm

A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation

J. Ruppert
1995 Journal of Algorithms  
Compared with previous quadtree-based algorithms for quality mesh generation, the Delaunay re nement approach i s m uch simpler and generally produces meshes with fewer triangles.  ...  We also discuss an implementation of the algorithm and evaluate its performance on a variety of inputs.  ...  Acknowledgements I w ould particularly like to thank Raimund Seidel, for many productive discussions.  ... 
doi:10.1006/jagm.1995.1021 fatcat:d5glh33asfe7naxisa7t2wtwzq

Efficient and Scalable Initialization of Partitioned Coupled Simulations with preCICE

Amin Totounferoush, Frédéric Simonis, Benjamin Uekermann, Miriam Schulte
2021 Algorithms  
In this contribution, we remove two remaining bottlenecks: (i) We base the neighborhood search between mesh entities of two solvers on a tree data structure to avoid quadratic complexity, and (ii) we replace  ...  In addition, the two-level scheme is able to handle much larger computational meshes, since the central mesh communication of the one-level scheme is replaced with a fully point-to-point mesh communication  ...  This is of total complexity w i ≥ 0 ∀i = 1, . . . , O(n S v log n S v + n S e log n S e + n S t log n S t ) . (1) In the best case, the cascading algorithm will only probe primitives with the highest dimension  ... 
doi:10.3390/a14060166 fatcat:2ssb53lxnzfj3cqvt7n6krhlyi

A GGQS-based hybrid algorithm for inter-cloud time-critical event dissemination

Ihn-Han Bae
2012 Journal of the Korean Data and Information Science Society  
The proposed algorithm first organizes these distributed clouds into a geographic group quorum overlay to support a constant event dissemination latency.  ...  Our numerical results show that the GGQS-based hybrid algorithm improves the efficiency as compared with Chord-based, Plume and GQS-based algorithms.  ...  Algorithm 3.1 Dissemination(e) algorithm /* (i, j) represents the index of the square that sender s is located */ if (i == j) then for all cloud nodes p ∈ Gs ∪ C1 ∪ C3 do send(e, s, p); end for else if  ... 
doi:10.7465/jkdi.2012.23.6.1259 fatcat:vemg2e336ffmna67hibquneume
« Previous Showing results 1 — 15 out of 9,958 results