Compatible convex decompositions of simple polygons

• Autorzy: Dharmaratne A. , Harada K.
• Języki publikacji: EN

Abstrakty

EN

In this paper, we presnt an algorithm for constructing compatible convex decompositions of two simple polygons. Given two simple polygons with an equal number of vertices, convex decompositions of these polygons are to be compatible if there exist a one-to-one mapping between them such that the two polygons are decoposed into an equal number of convex sub-polygons and the coresponding sub-polygons are defined by the corresponding sequence of vertices. In general, it may not be possible to decompose two polygons compatibly if additional vertices inside the polygon (commonly called Steiner points) are not allowed. Our algorithm calculates a compatible convex decomposition of two polugons with/without introducing Steiner points.

Słowa kluczowe

EN

simple polygons; convex decomposition; Steiner points; compatible convex decoposition

• Wydawca: Institute of Information Technology of the Warsaw University of Life Sciences – SGGW
• Czasopismo: Machine Graphics and Vision
• Rocznik: 2000
• Tom: Vol. 9, No. 4
• Strony: 851--866
• Opis fizyczny: Bibliogr. 15 poz.

Twórcy

autor

Dharmaratne A.

autor

Harada K.

• Department of Mathematics and Information Science, Hiroshima University, Japan,