Computational geometry: an introduction
Computational geometry: an introduction
A new heuristic for minimum weight triangulation
SIAM Journal on Algebraic and Discrete Methods
Transitions in geometric minimum spanning trees (extended abstract)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Computing the minimum weight triangulation of a set of linearly ordered points
Information Processing Letters
The realization problem for Euclidean minimum spanning trees is NP-hard
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computing a subgraph of the minimum weight triangulation
Computational Geometry: Theory and Applications
Algorithms for drawing graphs: an annotated bibliography
Computational Geometry: Theory and Applications
Drawing outerplanar minimum weight triangulations
Information Processing Letters
| Hi-index | 0.00 |
In this paper, we investigate the maximum weight triangulation of a polygon inscribed in a circle (simply inscribed polygon). A complete characterization of maximum weight triangulation of such polygons has been obtained. As a consequence of this characterization, an O(n2) algorithm for finding the maximum weight triangulation of an inscribed n-gon is designed. In case of a regular polygon, the complexity of this algorithm can be reduced to O(n). We also show that a tree admits a maximum weight drawing if its internal node connects at most 2 nonleaf nodes. The drawing can be done in O(n) time. Furthermore, we prove a property of maximum planar graphs which do not admit a maximum weight drawing on any set of convex points.