@techreport{TD:100133,
	att_abstract={{In this paper, we consider the problem of representing graphs by
triangles whose sides touch.
We present linear time algorithms for creating
touching triangle representations for outerplanar graphs, square grid
graphs, and hexagonal grid graphs.
The class of graphs with touching triangle representations is
not closed under minors, making characterization difficult.
We do show that pairs of vertices can only have a small common neighborhood,
and we present a complete characterization of the subclass of
biconnected graphs that can be represented as triangulations of some polygon.}},
	att_authors={eg3218, yh573v},
	att_categories={C_IIS.7, C_CCF.1},
	att_copyright={{Springer-Verlag}},
	att_copyright_notice={{The definitive version was published in 18th International Symposium on Graph Drawing  {{, Volume 6502}}{{, 2010-10-22}}}},
	att_donotupload={},
	att_private={false},
	att_projects={IV_GRAPHVIZ},
	att_tags={},
	att_techdoc={true},
	att_techdoc_key={TD:100133},
	att_url={http://web1.research.att.com:81/techdocs_downloads/TD:100133_DS1_2010-07-27T18:35:07.901Z.pdf},
	author={Emden Gansner and Yifan Hu and Stepen Kobourov},
	institution={{18th International Symposium on Graph Drawing
Springer-Verlag LNCS}},
	month={October},
	title={{On Touching Triangle Graphs}},
	year=2010,
}