Sciweavers

5 search results - page 1 / 1
» Optimal Angle Bounds for Quadrilateral Meshes
Sort
View
DCG
2010
73views more  DCG 2010»
13 years 5 months ago
Optimal Angle Bounds for Quadrilateral Meshes
We show that any simple planar n-gon can be meshed in linear time by O(n) quadrilaterals with all new angles bounded between 60 and 120 degrees. 1991 Mathematics Subject Classifica...
Christopher J. Bishop
COMPGEOM
2009
ACM
13 years 11 months ago
Quadrilateral meshes with bounded minimum angle
In this paper, we present an algorithm that utilizes a quadtree data structure to construct a strictly convex quadrilateral mesh for a simple polygonal region in which no newly cr...
Scott Hine, F. Betul Atalay, Dianna Xu, Suneeta Ra...
ICALP
2007
Springer
13 years 11 months ago
Size Competitive Meshing Without Large Angles
We present a new meshing algorithm for the plane, Overlay Stitch Meshing (OSM), accepting as input an arbitrary Planar Straight Line Graph and producing a triangulation with all an...
Gary L. Miller, Todd Phillips, Donald Sheehy
COMGEO
2006
ACM
13 years 5 months ago
On the sizes of Delaunay meshes
Let P be a polyhedral domain occupying a convex volume. We prove that the size of a graded mesh of P with bounded vertex degree is within a factor O(H3 P ) of the size of any Dela...
Siu-Wing Cheng
SIAMNUM
2010
150views more  SIAMNUM 2010»
13 years 49 sec ago
Quasi-Optimal Convergence Rate of an Adaptive Discontinuous Galerkin Method
We analyze an adaptive discontinuous finite element method (ADFEM) for symmetric second order linear elliptic operators. The method is formulated on nonconforming meshes made of si...
Andrea Bonito, Ricardo H. Nochetto