Skip to main content
SpringerLink
Log in

Planar Matchings for Weighted Straight Skeletons

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8889))

Included in the following conference series:

Abstract

In this paper, we introduce planar matchings on directed pseudo-line arrangements, which yield a planar set of pseudo-line segments such that only matching-partners are adjacent. By translating the planar matching problem into a corresponding stable roommates problem we show that such matchings always exist.

Using our new framework, we establish, for the first time, a complete, rigorous definition of weighted straight skeletons, which are based on a so-called wavefront propagation process. We present a generalized and unified approach to treat structural changes in the wavefront that focuses on the restoration of weak planarity by finding planar matchings.

T. Biedl was supported by NSERC and the Ross and Muriel Cheriton Fellowship. P. Palfrader was supported by Austrian Science Fund (FWF): P25816-N15.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aichholzer, O., Alberts, D., Aurenhammer, F., Gärtner, B.: Straight Skeletons of Simple Polygons. In: Proc. 4th Int’l Symp. of LIESMARS, pp. 114–124 (1995)

    Google Scholar 

  2. Aurenhammer, F.: Weighted Skeletons and Fixed-Share Decomposition. Comput. Geom. Theory and Appl. 40(2), 93–101 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  3. Barequet, G., Eppstein, D., Goodrich, M.T., Vaxman, A.: Straight Skeletons of Three-Dimensional Polyhedra. In: Proc. 16th Annu. Europ. Symp. Algorithms, pp. 148–160 (September 2008)

    Google Scholar 

  4. Biedl, T., Held, M., Huber, S., Kaaser, D., Palfrader, P.: Weighted Straight Skeletons in the Plane. Comput. Geom. Theory and Appl. 48(2), 120–133 (2015)

    Article  MathSciNet  Google Scholar 

  5. Eppstein, D., Erickson, J.: Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions. Discrete Comput. Geom. 22(4), 569–592 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  6. Fleiner, T., Irving, R.W., Manlove, D.F.: Efficient algorithms for generalized stable marriage and roommates problems. Theoretical Computer Science 381(13), 162–176 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  7. Haunert, J.-H., Sester, M.: Area Collapse and Road Centerlines Based on Straight Skeletons. GeoInformatica 12, 169–191 (2008)

    Article  Google Scholar 

  8. Huber, S.: Computing Straight Skeletons and Motorcycle Graphs: Theory and Practice. Shaker Verlag (April 2012). ISBN: 978-3-8440-0938-5

    Google Scholar 

  9. Kelly, T., Wonka, P.: Interactive Architectural Modeling with Procedural Extrusions. ACM Trans. Graph. 30(2), 14:1–14:15 (2011)

    Article  Google Scholar 

  10. Laycock, R., Day, A.: Automatically Generating Large Urban Environments Based on the Footprint Data of Buildings. In: Proc. 8th Symp. Solid Modeling Applications, pp. 346–351 (June 2003)

    Google Scholar 

  11. Tan, J.J.: A Necessary and Sufficient Condition for the Existence of a Complete Stable Matching. Journal of Algorithms 12(1), 154–178 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  12. Tan, J.J., Hsueh, Y.-C.: A generalization of the stable matching problem. Discrete Applied Mathematics 59(1), 87–102 (1995)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, ON, N2L 1A2, Canada

    Therese Biedl

  2. Institute of Science and Technology Austria, 3400, Klosterneuburg, Austria

    Stefan Huber

  3. FB Computerwissenschaften, Universität Salzburg, 5020, Salzburg, Austria

    Peter Palfrader

Authors
  1. Therese Biedl
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stefan Huber
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Peter Palfrader
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Stefan Huber .

Editor information

Editors and Affiliations

  1. Pohang University of Science and Technology, Pohang, Korea, Republic of (South Korea)

    Hee-Kap Ahn

  2. Hankuk University of Foreign Studies, Yongin-si, Korea, Republic of (South Korea)

    Chan-Su Shin

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Biedl, T., Huber, S., Palfrader, P. (2014). Planar Matchings for Weighted Straight Skeletons. In: Ahn, HK., Shin, CS. (eds) Algorithms and Computation. ISAAC 2014. Lecture Notes in Computer Science(), vol 8889. Springer, Cham. https://doi.org/10.1007/978-3-319-13075-0_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-13075-0_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-13074-3

  • Online ISBN: 978-3-319-13075-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation