Quadrilateral meshes with provable angle bounds

In this paper, we present an algorithm that utilizes a quadtree data structure to construct a quadrilateral mesh for a simple polygonal region in which no newly created angle is smaller than or greater than . This is the first known result, to the best of our knowledge, on a direct quadrilateral mes...

Full description

Saved in:
Bibliographic Details
Published in:Engineering with computers 2012-01, Vol.28 (1), p.31-56
Main Authors: Atalay, F. Betul, Ramaswami, Suneeta, Xu, Dianna
Format: Article
Language:English
Subjects:
Algorithms
CAE) and Design
Calculus of Variations and Optimal Control
Optimization
Classical Mechanics
Computer Science
Computer-Aided Engineering (CAD
Construction
Control
Data structures
Finite element method
Math. Applications in Chemistry
Mathematical analysis
Mathematical and Computational Engineering
Mesh generation
Original Article
Quadrilaterals
Quadtrees
Systems Theory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we present an algorithm that utilizes a quadtree data structure to construct a quadrilateral mesh for a simple polygonal region in which no newly created angle is smaller than or greater than . This is the first known result, to the best of our knowledge, on a direct quadrilateral mesh generation algorithm with a provable guarantee on the angles.
ISSN:0177-0667
1435-5663
DOI:10.1007/s00366-011-0215-0