Computing simple circuits from a set of line segments is NP-complete
SIAM Journal on Computing
Computing simple circuits from a set of line segments
Discrete & Computational Geometry
Maintenance of a minimum spanning forest in a dynamic plane graph
Journal of Algorithms
Growing a tree from its branches
Journal of Algorithms
Minimal tangent visibility graphs
Computational Geometry: Theory and Applications
Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons
Proceedings of the eighteenth annual symposium on Computational geometry
Tight degree bounds for pseudo-triangulations of points
Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01
Lower bounds for algebraic computation trees
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Segment endpoint visibility graphs are Hamiltonian
Computational Geometry: Theory and Applications - Special issue on the thirteenth canadian conference on computational geometry - CCCG'01
Allocating Vertex π-Guards in Simple Polygons via Pseudo-Triangulations
Discrete & Computational Geometry
Pointed and colored binary encompassing trees
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Acute Triangulations of Polygons
Discrete & Computational Geometry
Encompassing colored planar straight line graphs
Computational Geometry: Theory and Applications
Triangulations without pointed spanning trees
Computational Geometry: Theory and Applications
A vertex-face assignment for plane graphs
Computational Geometry: Theory and Applications
Bichromatic compatible matchings
Proceedings of the twenty-ninth annual symposium on Computational geometry
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
For n disjoint line segments in the plane we construct in optimal O(nlogn) time and linear space an encompassing tree of maximum degree three such that at every vertex v all edges of the tree that are incident to v lie in a halfplane bounded by the line through the input segment which v is an endpoint of. In particular, this tree is pointed since every vertex has an incident angle greater than @p. Such a pointed binary tree can be augmented to a minimum pseudo-triangulation. It follows that every set of disjoint line segments in the plane has a constrained minimum pseudo-triangulation whose maximum vertex degree is bounded by a constant.