Sciweavers

4 search results - page 1 / 1
» Quadrilateral meshes with bounded minimum angle
Sort
View
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...
DCG
2010
73views more  DCG 2010»
13 years 4 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
COMGEO
2006
ACM
13 years 4 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
VIS
2004
IEEE
170views Visualization» more  VIS 2004»
14 years 6 months ago
Guaranteed Quality Triangulation of Molecular Skin Surfaces
We present an efficient algorithm to mesh the macromolecules surface model represented by the skin surface defined by Edelsbrunner. Our algorithm overcomes several challenges resi...
Ho-Lun Cheng, Xinwei Shi