Skip to main content
Log in

Quadrilateral Meshes for PSLGs

  • Published:
Discrete & Computational Geometry Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24
Fig. 25
Fig. 26
Fig. 27
Fig. 28
Fig. 29
Fig. 30
Fig. 31
Fig. 32
Fig. 33
Fig. 34
Fig. 35
Fig. 36
Fig. 37
Fig. 38
Fig. 39

Similar content being viewed by others

References

  1. 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)

  2. 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)

  3. 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)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bishop, C.J.: Conformal mapping in linear time. Discrete Comput. Geom. 44(2), 330–428 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  5. Bishop, C.J.: Optimal angle bounds for quadrilateral meshes. Discrete Comput. Geom. 44(2), 308–329 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  6. Bishop, C.J.: Nonobtuse triangulations of PSLGs. Discrete Comput. Geom. (2016). doi:10.1007/s00454-016-9772-8

    Google Scholar 

  7. Eppstein, D.: Faster circle packing with application to nonobtuse triangulation. Int. J. Comput. Geom. Appl. 7(5), 485–491 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  8. 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)

  9. Garnett, J.B., Marshall, D.E.: Harmonic Measure. New Mathematical Monographs. Cambridge University Press, Cambridge, UK (2005)

    Book  MATH  Google Scholar 

Download references

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

Authors

Corresponding author

Correspondence to Christopher J. Bishop.

Additional information

Editor in Charge: Herbert Edelsbrunner

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

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

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00454-016-9771-9

Keywords

Mathematics Subject Classification

Navigation