Wyniki wyszukiwania - BazTech

Ograniczanie wyników

1 Machine Graphics and Vision

1 2000

Powiadomienia systemowe

Sesja wygasła!

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: compatible convex decoposition

Sortuj według:

Ogranicz wyniki do:

Compatible convex decompositions of simple polygons

Dharmaratne A., Harada K.

Machine Graphics and Vision

2000

Vol. 9, No. 4

851-866

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.