Results 11 to 20 of about 48,887 (264)
Mesh Segmentation Refinement [PDF]
Computer Graphics Forum, 2009 AbstractThis paper proposes a method for refining existing mesh segmentations, employing a novel extension of the active contour approach to meshes. Given a segmentation, produced either by an automatic segmentation method or interactively, our algorithm propagates the segment boundaries to more appropriate locations.
Lotan Kaplansky, Ayellet Tal
openaire +2 more sources
Stable Dynamical Adaptive Mesh Refinement [PDF]
Journal of Scientific Computing, 2021 AbstractWe consider accurate and stable interpolation procedures for numerical simulations utilizing time dependent adaptive meshes. The interpolation of numerical solution values between meshes is considered as a transmission problem with respect to the underlying semi-discretized equations, and a theoretical framework using inner product preserving ...
Tomas Lundquist +2 more
openaire +3 more sources
Adaptive Mesh Refinement in Titanium [PDF]
19th IEEE International Parallel and Distributed Processing Symposium, 2005 In this paper, we evaluate Titanium's usability as a high-level parallel programming language through a case study, where we implement a subset of Chombo's functionality in Titanium. Chombo is a software package applying the adaptive mesh refinement methodology to numerical partial differential equations at the production level.
Colella, Phillip, Wen, Tong
openaire +3 more sources
Mathematics of Computation, 1973 We study mesh refinement techniques for first-order hyperbolic equations. A refinement method for use with the leap-frog scheme is defined and its stability established. The remainder of the paper is devoted to a discussion of the effects of nonuniform grids and the circumstances under which they may be used.
Browning, Gerald +2 more
openaire +2 more sources
Generic mesh refinement on GPU [PDF]
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware, 2005 Many recent publications have shown that a large variety of computation involved in computer graphics can be moved from the CPU to the GPU, by a clever use of vertex or fragment shaders. Nonetheless there is still one kind of algorithms that is hard to translate from CPU to GPU: mesh refinement techniques.
Boubekeur, Tamy, Schlick, Christophe
openaire +2 more sources
Multiblock Mesh Refinement by Adding Mesh Singularities [PDF]
, 2019 Several templates for 2D and 3D structured mesh refinement are presented. The templates have the property that the minimum number of irregular points or edges (mesh singularities) are added. For a given set of external division numbers a variety of interior meshes can be generated.
Cecil G. Armstrong +3 more
openaire +3 more sources
Kinetic mesh refinement in 2D [PDF]
Proceedings of the twenty-seventh annual symposium on Computational geometry, 2011 We provide a kinetic data structure (KDS) to the planar kinetic mesh refinement problem, which concerns computation of meshes of continuously moving points. Our KDS computes the Delaunay triangulation of a size-optimal well-spaced superset of a set of moving points with algebraic trajectories of constant degree.
Acar, U., Hudson, B., Türkoglu, D.
openaire +4 more sources
Refinement Algorithms for Adaptive Isogeometric Methods with Hierarchical Splines
Axioms, 2018 The construction of suitable mesh configurations for spline models that provide local refinement capabilities is one of the fundamental components for the analysis and development of adaptive isogeometric methods.
Cesare Bracco +2 more
doaj +1 more source
Parallel Algorithms for Adaptive Mesh Refinement [PDF]
SIAM Journal on Scientific Computing, 1997 Summary: Computational methods based on the use of adaptively constructed nonuniform meshes reduce the amount of computation and storage necessary to perform many scientific calculations. The adaptive construction of such nonuniform meshes is an important part of these methods.
Mark T. Jones, Paul E. Plassmann
openaire +2 more sources
Computer Assisted Methods in Engineering and Science, 2017 This paper deals with hp-type adaptation in the discontinuous Galerkin (DG) method. The DG method is formulated in this paper with a non-zero mesh skeleton width, which leads to a version of the method called in this paper the interface discontinuous ...
Jan Jaśkowiec
doaj +1 more source