Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: convex decomposition

Sortuj według:

Ogranicz wyniki do:

Lattices respecting convex decompositions, II

Beran L., Saarimäki M.

Demonstratio Mathematica

2002

Vol. 35, nr 3

455-460

Let (L1,L2) be a convex decomposition of a lattice L. We prove that L is a lattice satisfying the atomic covering property provided L1 and L2 possess the same property. Moreover we show that L satisfies the general disjointness property (GD) whenever L1 satisfies GD and L2 is a modular lattice or whenever L1 is a modular lattice with 0 and L2 satisfies GD.

Lattices respecting convex decompositions, I

Beran L., Saarimäki M.

Demonstratio Mathematica

2002

Vol. 35, nr 2

217-224

We prove the following results: Let (L1 L2) be a convex decomposition of a lattice L. If L1 and L2 are 0-modular, then L is 0-modular. If L1 is 0-distributive (or L1 is distributive with 0) and L2 is distributive (or L2 is 0-distributive), then L is 0-distributive.

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.