Optimal Angular Resolution for Face-Symmetric Drawings

Details Optimal Angular Resolution for Face-Symmetric Drawings Optimal Angular Resolution for Face-Symmetric Drawings

2009-07-31

arxiv.org/abs/0907.5474v1

Computer Science

Data Structures and Algorithms

10 pages, 6 figures

Scientific paper

Let G be a graph that may be drawn in the plane in such a way that all internal faces are centrally symmetric convex polygons. We show how to find a drawing of this type that maximizes the angular resolution of the drawing, the minimum angle between any two incident edges, in polynomial time, by reducing the problem to one of finding parametric shortest paths in an auxiliary graph. The running time is at most O(t^3), where t is a parameter of the input graph that is at most O(n) but is more typically proportional to n^.5.

Affiliated with

Also associated with

No associations

Rating

Optimal Angular Resolution for Face-Symmetric Drawings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Optimal Angular Resolution for Face-Symmetric Drawings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal Angular Resolution for Face-Symmetric Drawings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-267322