## Discrete Algorithms and Complexity: Proceedings of the Japan-US Joint Seminar, June 4-6, 1986, Kyoto, Japan |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Generalized Colorings | 35 |

Contributors | 51 |

Voronoi Diagram for Points in a Simple Polygon | 55 |

Copyright | |

19 other sections not shown

### Other editions - View all

### Common terms and phrases

algorithm apply array assignment assume basic begin bound boundary called coding complexity computation condition consider constant construct contains corresponding curve cycle defined Definition denote determined discrete distance edges element example exists expected face factoring finite flow function geodes given graph homomorphism independent input integer iterative known least Lemma length linear logarithm lower method node Note obtained operations Output pair parallel partition planar polynomial position prime probability problem procedure produce Proof prove random redundant region represent respectively result root running satisfies scheme selected shortest path shown signature simple polygon solve sort space stage Step subset Suppose surface tape Theorem Theory tree triangulation variables vertex vertices weighted Woronoi diagram