Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon

@article{Biniaz2016PlaneGS,
  title={Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon},
  author={Ahmad Biniaz and Prosenjit Bose and Anil Maheshwari and Michiel H. M. Smid},
  journal={Comput. Geom.},
  year={2016},
  volume={57},
  pages={27-39}
}
Let S be a finite set of points in the interior of a simple polygon P. A geodesic graph, G P ( S , E ) , is a graph with vertex set S and edge set E such that each edge ( a , b ) ź E is the shortest geodesic path between a and b inside P. G P is said to be plane if the edges in E do not cross. If the points in S are colored, then G P is said to be properly colored provided that, for each edge ( a , b ) ź E , a and b have different colors. In this paper we consider the problem of computing… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-4 OF 4 CITATIONS

References

Publications referenced by this paper.