Minimum Convex Partition of a Polygon with Holes by Cuts in...

Theory of Computing Systems 1998 / 10 Vol. 31; Iss. 5

Minimum Convex Partition of a Polygon with Holes by Cuts in Given Directions

A. Lingas, V. Soltan
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
31
Language:
english
Pages:
32
Journal:
Theory of Computing Systems
DOI:
10.1007/s002240000101
Date:
October, 1998
File:
PDF, 382 KB
english, 1998
Conversion to is in progress
Conversion to is failed