Abstract
We prove that every planar straight line graph with n vertices has a conforming quadrilateral mesh with \(O(n^2)\) elements, all angles \(\le \) 120\(^\circ \) and all new angles \(\ge \) 60\(^\circ \). Both the complexity and the angle bounds are sharp.
Similar content being viewed by others
References
Ahlfors, L.V.: Lectures on Quasiconformal Mappings. The Wadsworth & Brooks/Cole Mathematics Series. Wadsworth & Brooks/Cole Advanced Books & Software, Monterey, CA. With the assistance of Clifford Earle, J., Jr., Reprint of the 1966 original (1987)
Bern, M., Eppstein, D.: Quadrilateral meshing by circle packing. Int. J. Comput. Geom. Appl. 10(4), 347–360 (2000). Selected papers from the Sixth International Meshing Roundtable, Part II (Park City, UT, 1997)
Bern, M., Mitchell, S., Ruppert, J.: Linear-size nonobtuse triangulation of polygons. Discrete Comput. Geom. 14(4), 411–428 (1995). ACM Symposium on Computational Geometry (Stony Brook, NY, 1994)
Bishop, C.J.: Conformal mapping in linear time. Discrete Comput. Geom. 44(2), 330–428 (2010)
Bishop, C.J.: Optimal angle bounds for quadrilateral meshes. Discrete Comput. Geom. 44(2), 308–329 (2010)
Bishop, C.J.: Nonobtuse triangulations of PSLGs. Discrete Comput. Geom. (2016). doi:10.1007/s00454-016-9772-8
Eppstein, D.: Faster circle packing with application to nonobtuse triangulation. Int. J. Comput. Geom. Appl. 7(5), 485–491 (1997)
Eppstein, D., Goodrich, M.T., Kim, E., Tamstorf, R.: Motorcycle graphs: Canonical quad mesh partitioning. In: Eurographics Symposium on Geometric Processing 2008, vol. 27, no. 5 (2009)
Garnett, J.B., Marshall, D.E.: Harmonic Measure. New Mathematical Monographs. Cambridge University Press, Cambridge, UK (2005)
Acknowledgments
The author is partially supported by NSF Grant DMS 13-05233. I thank Joe Mitchell and Estie Arkin for numerous helpful conversations about computational geometry in general, and about the results of this paper in particular. Also thanks to two anonymous referees whose thoughtful remarks and suggestions on two versions of the paper greatly improved the precision and clarity of the exposition. A proof suggested by one of the referees is included in Sect. 8.
Author information
Authors and Affiliations
Corresponding author
Additional information
Editor in Charge: Herbert Edelsbrunner
Rights and permissions
About this article
Cite this article
Bishop, C.J. Quadrilateral Meshes for PSLGs. Discrete Comput Geom 56, 1–42 (2016). https://doi.org/10.1007/s00454-016-9771-9
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-016-9771-9
Keywords
- Quadrilateral meshes
- Sinks
- Polynomial time
- Nonobtuse triangulation
- Dissections
- Conforming meshes
- Optimal angle bounds