Colored simultaneous geometric embeddings and universal pointsets

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

Research output: Contribution to conferencePaperpeer-review

4 Scopus citations


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)
Number of pages4
StatePublished - Dec 1 2009
Externally publishedYes
Event21st Annual Canadian Conference on Computational Geometry, CCCG 2009 - Vancouver, BC, Canada
Duration: Aug 17 2009Aug 19 2009


Other21st Annual Canadian Conference on Computational Geometry, CCCG 2009
CityVancouver, BC

ASJC Scopus subject areas

  • Computational Mathematics
  • Geometry and Topology


Dive into the research topics of 'Colored simultaneous geometric embeddings and universal pointsets'. Together they form a unique fingerprint.

Cite this