Matchmaker: constructing constrained texture maps
ACM SIGGRAPH 2003 Papers
The geometric thickness of low degree graphs
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
On simultaneous planar graph embeddings
Computational Geometry: Theory and Applications
Mesh parameterization methods and their applications
Foundations and Trends® in Computer Graphics and Vision
Graph-Theoretic Concepts in Computer Science
Connected Rectilinear Graphs on Point Sets
Graph Drawing
Mesh parameterization: theory and practice
ACM SIGGRAPH ASIA 2008 courses
Angle and distance constraints on tree drawings
GD'06 Proceedings of the 14th international conference on Graph drawing
Embedding graphs simultaneously with fixed edges
GD'06 Proceedings of the 14th international conference on Graph drawing
GD'06 Proceedings of the 14th international conference on Graph drawing
Feature-Constrained texturing system for 3d models
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part III
Drawing planar graphs on points inside a polygon
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
Let G be a planar graph of n vertices, v1,..., vn, and let {p1,...,pn} be a set of n points in the plane. We present an algorithm for constructing in O(n2) time a planar embedding of G, where vertex vi is represented by point pi and each edge is represented by a polygonal curve with O(n) bends (internal vertices.) This bound is asymptotically optimal in the worst case. In fact, if G is a planar graph containing at least m pairwise independent edges and the vertices of G are randomly assigned to points in convex position, then, almost surely, every planar embedding of G mapping vertices to their assigned points and edges to polygonal curves has at least m/20 edges represented by curves with at least m/403 bends.