Generating spherical multiquadrangulations by restricted vertex splittings and the reducibility of equilibrium classes

Richárd Kápolnai, G. Domokos, Tímea Szabó

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

We study the combinatorial properties associated with an earlier published, geometric algorithm capable of generating convex bodies in any primary equilibrium class (i.e. bodies with arbitrary numbers of equilibrium points) from a single ancestor. Primary equilibrium classes contain several topological secondary classes based on the arrangement of the equilibrium points. Here we show that the associated graph expansion algorithm is incomplete in the sense that using the same ancestor, not all secondary classes can be generated and we point out the nontrivial set of ancestors necessary to generate all secondary classes.

Original languageEnglish
Pages (from-to)11-20
Number of pages10
JournalPeriodica Polytechnica, Electrical Engineering
Volume56
Issue number1
DOIs
Publication statusPublished - 2012

Keywords

  • Census
  • Convex body
  • Equilibrium class
  • Plane multiquadrangulation
  • Unrooted unsensed colored map
  • Vertex splitting

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Generating spherical multiquadrangulations by restricted vertex splittings and the reducibility of equilibrium classes. / Kápolnai, Richárd; Domokos, G.; Szabó, Tímea.

In: Periodica Polytechnica, Electrical Engineering, Vol. 56, No. 1, 2012, p. 11-20.

Research output: Contribution to journalArticle

@article{f99f8d7bce0d4ccc89c235f16ceaa637,
title = "Generating spherical multiquadrangulations by restricted vertex splittings and the reducibility of equilibrium classes",
abstract = "We study the combinatorial properties associated with an earlier published, geometric algorithm capable of generating convex bodies in any primary equilibrium class (i.e. bodies with arbitrary numbers of equilibrium points) from a single ancestor. Primary equilibrium classes contain several topological secondary classes based on the arrangement of the equilibrium points. Here we show that the associated graph expansion algorithm is incomplete in the sense that using the same ancestor, not all secondary classes can be generated and we point out the nontrivial set of ancestors necessary to generate all secondary classes.",
keywords = "Census, Convex body, Equilibrium class, Plane multiquadrangulation, Unrooted unsensed colored map, Vertex splitting",
author = "Rich{\'a}rd K{\'a}polnai and G. Domokos and T{\'i}mea Szab{\'o}",
year = "2012",
doi = "10.3311/PPee.7074",
language = "English",
volume = "56",
pages = "11--20",
journal = "Periodica polytechnica Electrical engineering and computer science",
issn = "2064-5260",
publisher = "Budapest University of Technology and Economics",
number = "1",

}

TY - JOUR

T1 - Generating spherical multiquadrangulations by restricted vertex splittings and the reducibility of equilibrium classes

AU - Kápolnai, Richárd

AU - Domokos, G.

AU - Szabó, Tímea

PY - 2012

Y1 - 2012

N2 - We study the combinatorial properties associated with an earlier published, geometric algorithm capable of generating convex bodies in any primary equilibrium class (i.e. bodies with arbitrary numbers of equilibrium points) from a single ancestor. Primary equilibrium classes contain several topological secondary classes based on the arrangement of the equilibrium points. Here we show that the associated graph expansion algorithm is incomplete in the sense that using the same ancestor, not all secondary classes can be generated and we point out the nontrivial set of ancestors necessary to generate all secondary classes.

AB - We study the combinatorial properties associated with an earlier published, geometric algorithm capable of generating convex bodies in any primary equilibrium class (i.e. bodies with arbitrary numbers of equilibrium points) from a single ancestor. Primary equilibrium classes contain several topological secondary classes based on the arrangement of the equilibrium points. Here we show that the associated graph expansion algorithm is incomplete in the sense that using the same ancestor, not all secondary classes can be generated and we point out the nontrivial set of ancestors necessary to generate all secondary classes.

KW - Census

KW - Convex body

KW - Equilibrium class

KW - Plane multiquadrangulation

KW - Unrooted unsensed colored map

KW - Vertex splitting

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

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

U2 - 10.3311/PPee.7074

DO - 10.3311/PPee.7074

M3 - Article

AN - SCOPUS:84890473905

VL - 56

SP - 11

EP - 20

JO - Periodica polytechnica Electrical engineering and computer science

JF - Periodica polytechnica Electrical engineering and computer science

SN - 2064-5260

IS - 1

ER -