Quadrilateral meshes with bounded minimum angle

Scott Hine, F. Betul Atalay, Dianna Xu, Suneeta Ramaswami

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Abstract

We present an algorithm that constructs a strictly convex quadrilat-eral mesh for a simple polygonal region in which no newly created angle is smaller than 18.43° (= arctan(1/3)). This is the first known result on quadrilateral mesh generation with a provable guarantee on the rninimum angle. 1.

Original languageEnglish (US)
Title of host publicationProceedings of the 25th Annual Symposium on Computational Geometry, SCG'09
Pages90-91
Number of pages2
DOIs
StatePublished - 2009
Event25th Annual Symposium on Computational Geometry, SCG'09 - Aarhus, Denmark
Duration: Jun 8 2009Jun 10 2009

Publication series

NameProceedings of the Annual Symposium on Computational Geometry

Other

Other25th Annual Symposium on Computational Geometry, SCG'09
Country/TerritoryDenmark
CityAarhus
Period6/8/096/10/09

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Geometry and Topology
  • Computational Mathematics

Keywords

  • Quadrilateral mesh generation

Fingerprint

Dive into the research topics of 'Quadrilateral meshes with bounded minimum angle'. Together they form a unique fingerprint.

Cite this