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...
Converting a quadrilateral input mesh into a C1 surface with one bi-3 tensorproduct spline patch per facet is a classical challenge. We give explicit local averaging formulas for ...
Abstract. This paper investigates the use of a steady state genetic algorithm (GA) to perform quadrilateral finite element mesh smoothing. GAS short for genetic algorithm smoother...
We present a method for parameterizing irregularly triangulated input models over polyhedral domains with quadrilateral faces. A combination of center-based clustering techniques ...
Ioana M. Boier-Martin, Holly E. Rushmeier, Jingyi ...
This paper presents a simple technique for generating anisotropic surface triangulations using a generic unstructured quadrilateral decomposition of CAD entities that map to a log...