Quadrilateral meshes for PSLGs

DOI10.1007/S00454-016-9771-9zbMATH Open1348.68279arXiv2007.10074OpenAlexW2334449006MaRDI QIDQ306496FDOQ306496

Authors: Christopher J. Bishop 

Publication date: 31 August 2016

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Abstract: We prove that every planar straight line graph with $n$ vertices has a conforming quadrilateral mesh with $O(n^2)$ elements, all angles $leq120^{c}irc$ and all new angles $geq60^{c}irc$. Both the complexity and the angle bounds are sharp. Moreover, all but $O(n)$ of the angles may be taken in a smaller interval, say $[89^{c}irc,91^{c}irc]$.

Full work available at URL: https://arxiv.org/abs/2007.10074

Recommendations

• Nonobtuse triangulations of PSLGs
• QUADRILATERAL MESHING BY CIRCLE PACKING
• CONSTRAINED QUADRILATERAL MESHES OF BOUNDED SIZE
• Small strictly convex quadrilateral meshes of point sets
• Improved approximations for minimum cardinality quadrangulations of finite element meshes

zbMATH Keywords

polynomial timeconforming meshesdissectionsnonobtuse triangulationoptimal angle boundsquadrilateral meshessinks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)

Cites Work

• Title not available (Why is that?)
• Linear-size nonobtuse triangulation of polygons
• Nonobtuse triangulations of PSLGs
• Faster Circle Packing with Application to Nonobtuse Triangulation
• QUADRILATERAL MESHING BY CIRCLE PACKING
• Optimal angle bounds for quadrilateral meshes
• Conformal mapping in linear time

Cited In (3)

• QUADRILATERAL MESHING BY CIRCLE PACKING
• Nonobtuse triangulations of PSLGs
• Uniformly acute triangulations of PSLGs

This page was built for publication: Quadrilateral meshes for PSLGs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q306496)