An approximate algorithm for the minimal vertex nested polygon problem
Data(s) |
1989
|
---|---|
Resumo |
Given two simple polygons, the Minimal Vertex Nested Polygon Problem is one of finding a polygon nested between the given polygons having the minimum number of vertices. In this paper, we suggest efficient approximate algorithms for interesting special cases of the above using the shortest-path finding graph algorithms. |
Formato |
application/pdf |
Identificador |
http://eprints.iisc.ernet.in/30421/1/an.pdf Bhaskar, Dasgupta and Veni, Madhavan CE (1989) An approximate algorithm for the minimal vertex nested polygon problem. In: Information Processing Letters, 33 (1). pp. 35-44. |
Publicador |
Elsevier Science |
Relação |
http://dx.doi.org/10.1016/0020-0190(89)90185-3 http://eprints.iisc.ernet.in/30421/ |
Palavras-Chave | #Computer Science & Automation (Formerly, School of Automation) |
Tipo |
Journal Article PeerReviewed |