Matching edges and faces in polygonal partitions

O. Aichholzer, F. Aurenhammer, P. Gonzalez-Nava, T. Hackl, C. Huemer, F. Hurtado, H. Krassex, Saurabh Ray, B. Vogtenhuber

Research output: Contribution to conferencePaper

Abstract

We define general Laman (count) conditions for edges and faces of polygonal partitions in the plane-Several well-known classes, including k-regular partitions, k-angulations, and rank-A; pseudo-triangulations, are shown to fulfill such conditions. As a consequence, non-trivial perfect matchings exist between the edge sets (or face sets) of two such structures when they live on the same point set. We also describe a link to spanning tree decompositions that applies to quadrangula-tions and certain pseudo-triangulations.

Original languageEnglish (US)
Pages126-129
Number of pages4
StatePublished - Jan 1 2005
Event17th Canadian Conference on Computational Geometry, CCCG 2005 - Windsor, Canada
Duration: Aug 10 2005Aug 12 2005

Conference

Conference17th Canadian Conference on Computational Geometry, CCCG 2005
CountryCanada
CityWindsor
Period8/10/058/12/05

Fingerprint

Pseudo-triangulation
Triangulation
Partition
Face
Tree Decomposition
Perfect Matching
Spanning tree
Point Sets
Count
Decomposition

ASJC Scopus subject areas

  • Geometry and Topology
  • Computational Mathematics

Cite this

Aichholzer, O., Aurenhammer, F., Gonzalez-Nava, P., Hackl, T., Huemer, C., Hurtado, F., ... Vogtenhuber, B. (2005). Matching edges and faces in polygonal partitions. 126-129. Paper presented at 17th Canadian Conference on Computational Geometry, CCCG 2005, Windsor, Canada.

Matching edges and faces in polygonal partitions. / Aichholzer, O.; Aurenhammer, F.; Gonzalez-Nava, P.; Hackl, T.; Huemer, C.; Hurtado, F.; Krassex, H.; Ray, Saurabh; Vogtenhuber, B.

2005. 126-129 Paper presented at 17th Canadian Conference on Computational Geometry, CCCG 2005, Windsor, Canada.

Research output: Contribution to conferencePaper

Aichholzer, O, Aurenhammer, F, Gonzalez-Nava, P, Hackl, T, Huemer, C, Hurtado, F, Krassex, H, Ray, S & Vogtenhuber, B 2005, 'Matching edges and faces in polygonal partitions' Paper presented at 17th Canadian Conference on Computational Geometry, CCCG 2005, Windsor, Canada, 8/10/05 - 8/12/05, pp. 126-129.
Aichholzer O, Aurenhammer F, Gonzalez-Nava P, Hackl T, Huemer C, Hurtado F et al. Matching edges and faces in polygonal partitions. 2005. Paper presented at 17th Canadian Conference on Computational Geometry, CCCG 2005, Windsor, Canada.
Aichholzer, O. ; Aurenhammer, F. ; Gonzalez-Nava, P. ; Hackl, T. ; Huemer, C. ; Hurtado, F. ; Krassex, H. ; Ray, Saurabh ; Vogtenhuber, B. / Matching edges and faces in polygonal partitions. Paper presented at 17th Canadian Conference on Computational Geometry, CCCG 2005, Windsor, Canada.4 p.
@conference{7fd643cfa3594b95805b63586961d58f,
title = "Matching edges and faces in polygonal partitions",
abstract = "We define general Laman (count) conditions for edges and faces of polygonal partitions in the plane-Several well-known classes, including k-regular partitions, k-angulations, and rank-A; pseudo-triangulations, are shown to fulfill such conditions. As a consequence, non-trivial perfect matchings exist between the edge sets (or face sets) of two such structures when they live on the same point set. We also describe a link to spanning tree decompositions that applies to quadrangula-tions and certain pseudo-triangulations.",
author = "O. Aichholzer and F. Aurenhammer and P. Gonzalez-Nava and T. Hackl and C. Huemer and F. Hurtado and H. Krassex and Saurabh Ray and B. Vogtenhuber",
year = "2005",
month = "1",
day = "1",
language = "English (US)",
pages = "126--129",
note = "17th Canadian Conference on Computational Geometry, CCCG 2005 ; Conference date: 10-08-2005 Through 12-08-2005",

}

TY - CONF

T1 - Matching edges and faces in polygonal partitions

AU - Aichholzer, O.

AU - Aurenhammer, F.

AU - Gonzalez-Nava, P.

AU - Hackl, T.

AU - Huemer, C.

AU - Hurtado, F.

AU - Krassex, H.

AU - Ray, Saurabh

AU - Vogtenhuber, B.

PY - 2005/1/1

Y1 - 2005/1/1

N2 - We define general Laman (count) conditions for edges and faces of polygonal partitions in the plane-Several well-known classes, including k-regular partitions, k-angulations, and rank-A; pseudo-triangulations, are shown to fulfill such conditions. As a consequence, non-trivial perfect matchings exist between the edge sets (or face sets) of two such structures when they live on the same point set. We also describe a link to spanning tree decompositions that applies to quadrangula-tions and certain pseudo-triangulations.

AB - We define general Laman (count) conditions for edges and faces of polygonal partitions in the plane-Several well-known classes, including k-regular partitions, k-angulations, and rank-A; pseudo-triangulations, are shown to fulfill such conditions. As a consequence, non-trivial perfect matchings exist between the edge sets (or face sets) of two such structures when they live on the same point set. We also describe a link to spanning tree decompositions that applies to quadrangula-tions and certain pseudo-triangulations.

UR - http://www.scopus.com/inward/record.url?scp=85065560613&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85065560613&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:85065560613

SP - 126

EP - 129

ER -