# 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} }

- Published in Comput. Geom. 2016
DOI:10.1016/j.comgeo.2016.05.004

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

## Matchings in Geometric Graphs

VIEW 18 EXCERPTS

CITES BACKGROUND & RESULTS

## Plane Bichromatic Trees of Low Degree

VIEW 3 EXCERPTS

CITES BACKGROUND & METHODS

## Plane Bichromatic Trees of Low Degree

VIEW 2 EXCERPTS

CITES METHODS & BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 14 REFERENCES

## Properly Colored Geometric Matchings and 3-Trees Without Crossings on Multicolored Points in the Plane

VIEW 7 EXCERPTS

HIGHLY INFLUENTIAL

## Computing geodesic properties inside a simple polygon

VIEW 8 EXCERPTS

HIGHLY INFLUENTIAL

## MAXIMUM MATCHINGS IN COMPLETE MULTIPARTITE GRAPHS

VIEW 3 EXCERPTS

HIGHLY INFLUENTIAL

## Geodesic-Preserving Polygon Simplification

VIEW 1 EXCERPT

## Relative Convex Hulls in Semi-dynamic Subdivisions

VIEW 1 EXCERPT

## Geodesic ham-sandwich cuts

VIEW 2 EXCERPTS