Colored simultaneous geometric embeddings and universal pointsets

Alejandro Estrella-Balderrama, J. Joseph Fowler, Stephen G Kobourov

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

A set of n points in the plane is a universal pointset for a given class of graphs, if any n-vertex graph in that class can be embedded in the plane so that vertices are mapped to points, edges are drawn with straight lines, and there are no crossings. A set of graphs defined on the same n vertices, which are partitioned into k colors, has a colored simultaneous geometric embedding if there exists a set of k-colored points in the plane such that each vertex can be mapped to a point of the same color, resulting in a straight-line plane drawing of each graph. We consider classes of trees and show that there exist universal or near universal pointsets for 3-colored cater- pillars, 3-colored radius-2 stars, and 2-colored spiders.

Original languageEnglish (US)
Title of host publicationProceedings of the 21st Annual Canadian Conference on Computational Geometry, CCCG 2009
Pages17-20
Number of pages4
StatePublished - 2009
Externally publishedYes
Event21st Annual Canadian Conference on Computational Geometry, CCCG 2009 - Vancouver, BC, Canada
Duration: Aug 17 2009Aug 19 2009

Other

Other21st Annual Canadian Conference on Computational Geometry, CCCG 2009
CountryCanada
CityVancouver, BC
Period8/17/098/19/09

Fingerprint

Point Sets
Color
Graph in graph theory
Straight Line
Stars
Spiders
Vertex of a graph
Star
Radius
Class

ASJC Scopus subject areas

  • Computational Mathematics
  • Geometry and Topology

Cite this

Estrella-Balderrama, A., Fowler, J. J., & Kobourov, S. G. (2009). Colored simultaneous geometric embeddings and universal pointsets. In Proceedings of the 21st Annual Canadian Conference on Computational Geometry, CCCG 2009 (pp. 17-20)

Colored simultaneous geometric embeddings and universal pointsets. / Estrella-Balderrama, Alejandro; Fowler, J. Joseph; Kobourov, Stephen G.

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, CCCG 2009. 2009. p. 17-20.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Estrella-Balderrama, A, Fowler, JJ & Kobourov, SG 2009, Colored simultaneous geometric embeddings and universal pointsets. in Proceedings of the 21st Annual Canadian Conference on Computational Geometry, CCCG 2009. pp. 17-20, 21st Annual Canadian Conference on Computational Geometry, CCCG 2009, Vancouver, BC, Canada, 8/17/09.
Estrella-Balderrama A, Fowler JJ, Kobourov SG. Colored simultaneous geometric embeddings and universal pointsets. In Proceedings of the 21st Annual Canadian Conference on Computational Geometry, CCCG 2009. 2009. p. 17-20
Estrella-Balderrama, Alejandro ; Fowler, J. Joseph ; Kobourov, Stephen G. / Colored simultaneous geometric embeddings and universal pointsets. Proceedings of the 21st Annual Canadian Conference on Computational Geometry, CCCG 2009. 2009. pp. 17-20
@inproceedings{015414948a3a4ab98c2c986bc372036f,
title = "Colored simultaneous geometric embeddings and universal pointsets",
abstract = "A set of n points in the plane is a universal pointset for a given class of graphs, if any n-vertex graph in that class can be embedded in the plane so that vertices are mapped to points, edges are drawn with straight lines, and there are no crossings. A set of graphs defined on the same n vertices, which are partitioned into k colors, has a colored simultaneous geometric embedding if there exists a set of k-colored points in the plane such that each vertex can be mapped to a point of the same color, resulting in a straight-line plane drawing of each graph. We consider classes of trees and show that there exist universal or near universal pointsets for 3-colored cater- pillars, 3-colored radius-2 stars, and 2-colored spiders.",
author = "Alejandro Estrella-Balderrama and Fowler, {J. Joseph} and Kobourov, {Stephen G}",
year = "2009",
language = "English (US)",
pages = "17--20",
booktitle = "Proceedings of the 21st Annual Canadian Conference on Computational Geometry, CCCG 2009",

}

TY - GEN

T1 - Colored simultaneous geometric embeddings and universal pointsets

AU - Estrella-Balderrama, Alejandro

AU - Fowler, J. Joseph

AU - Kobourov, Stephen G

PY - 2009

Y1 - 2009

N2 - A set of n points in the plane is a universal pointset for a given class of graphs, if any n-vertex graph in that class can be embedded in the plane so that vertices are mapped to points, edges are drawn with straight lines, and there are no crossings. A set of graphs defined on the same n vertices, which are partitioned into k colors, has a colored simultaneous geometric embedding if there exists a set of k-colored points in the plane such that each vertex can be mapped to a point of the same color, resulting in a straight-line plane drawing of each graph. We consider classes of trees and show that there exist universal or near universal pointsets for 3-colored cater- pillars, 3-colored radius-2 stars, and 2-colored spiders.

AB - A set of n points in the plane is a universal pointset for a given class of graphs, if any n-vertex graph in that class can be embedded in the plane so that vertices are mapped to points, edges are drawn with straight lines, and there are no crossings. A set of graphs defined on the same n vertices, which are partitioned into k colors, has a colored simultaneous geometric embedding if there exists a set of k-colored points in the plane such that each vertex can be mapped to a point of the same color, resulting in a straight-line plane drawing of each graph. We consider classes of trees and show that there exist universal or near universal pointsets for 3-colored cater- pillars, 3-colored radius-2 stars, and 2-colored spiders.

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

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

M3 - Conference contribution

SP - 17

EP - 20

BT - Proceedings of the 21st Annual Canadian Conference on Computational Geometry, CCCG 2009

ER -