Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 308-329 |
| Number of pages | 22 |
| Journal | Discrete and Computational Geometry |
| Volume | 44 |
| Issue number | 2 |
| DOIs | |
| State | Published - 2010 |
Keywords
- Linear time
- Quadrilateral meshes
- Riemann mapping
- Thick/thin decomposition
Fingerprint
Dive into the research topics of 'Optimal angle bounds for quadrilateral meshes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver