Matching edges and faces in polygonal partitions

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

Matching edges and faces in polygonal partitions

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

Research output: Contribution to conference › Paper › peer-review

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 language	English
Pages	126-129
Number of pages	4
State	Published - 1 Jan 2005
Externally published	Yes
Event	17th Canadian Conference on Computational Geometry, CCCG 2005 - Windsor, Canada Duration: 10 Aug 2005 → 12 Aug 2005

Conference

Conference	17th Canadian Conference on Computational Geometry, CCCG 2005
Country/Territory	Canada
City	Windsor
Period	10/08/05 → 12/08/05

ASJC Scopus subject areas

Geometry and Topology
Computational Mathematics

Cite this

@conference{330a831c731048a38ff7a1584e8f782a,

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 S. Ray and B. Vogtenhuber",

note = "Publisher Copyright: {\textcopyright} 2005 Canadian Conference on Computational Geometry. All rights reserved.; 17th Canadian Conference on Computational Geometry, CCCG 2005 ; Conference date: 10-08-2005 Through 12-08-2005",

year = "2005",

month = jan,

day = "1",

language = "English",

pages = "126--129",

}

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, S.

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 - https://www.scopus.com/pages/publications/85065560613

M3 - Paper

AN - SCOPUS:85065560613

SP - 126

EP - 129

T2 - 17th Canadian Conference on Computational Geometry, CCCG 2005

Y2 - 10 August 2005 through 12 August 2005

ER -

Matching edges and faces in polygonal partitions

Abstract

Conference

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this