An O(n2logn) time algorithm for the minmax angle triangulation
SIAM Journal on Scientific and Statistical Computing
The farthest point Delaunay triangulation minimizes angles
Computational Geometry: Theory and Applications
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Angle-restricted tours in the plane
Computational Geometry: Theory and Applications
The Angular-Metric Traveling Salesman Problem
SIAM Journal on Computing
LMT-skeleton heuristics for several new classes of optimal triangulations
Computational Geometry: Theory and Applications
Pseudotriangulations from Surfaces and a Novel Type of Edge Flip
SIAM Journal on Computing
Acute Triangulations of Polygons
Discrete & Computational Geometry
Planar minimally rigid graphs and pseudo-triangulations
Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
SIAM Journal on Discrete Mathematics
Drawing hamiltonian cycles with no large angles
GD'09 Proceedings of the 17th international conference on Graph Drawing
Hi-index | 0.00 |
Let G = (S,E) be a plane straight-line graph on a finite point set S ⊂ R2 in general position. The incident angles of a point p ∈ S in G are the angles between any two edges of G that appear consecutively in the circular order of the edges incident to p. A plane straight-line graph is called ϕ-open if each vertex has an incident angle of size at least ϕ. In this paper we study the following type of question: What is the maximum angle ϕ such that for any finite set S ⊂ R2 of points in general position we can find a graph from a certain class of graphs on S that is ϕ-open? In particular, we consider the classes of triangulations, spanning trees, and paths on S and give tight bounds in most cases.