Wyniki wyszukiwania - Biblioteka Nauki

Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl

Ograniczanie wyników

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: algorithm complexity

Sortuj według:

Ogranicz wyniki do:

Faster algorithm for line clipping against a pyramid in E³

100%

Skala V. , Bui D. H.

Machine Graphics and Vision

2000

tom Vol. 9, No. 4

841-850

A new algorithm for line clipping against a pyramid in E³ is presented. The suggested algorithm is based on the use of a separation function and avoids conmputation of intersection points that are not endpoints of the output line segment. It also allows to solved all cases more effictively. The performance of this algorithm is shown to be consistently better than the traditional Liang-Barsky's algorithm for line clipping in E³. Experimental are also presented.

Selected multicriteria shortest path problems: an analysis of complexity, models and adaptation of standard algorithms

100%

Tarapata Z.

tom 17

nr 2

269-287

The paper presents selected multicriteria (multiobjective) approaches to shortest path problems. A classification of multi-objective shortest path (MOSP) problems is given. Different models of MOSP problems are discussed in detail. Methods of solving the formulated optimization problems are presented. An analysis of the complexity of the presented methods and ways of adapting of classical algorithms for solving multiobjective shortest path problems are described. A comparison of the effectiveness of solving selected MOSP problems defined as mathematical programming problems (using the CPLEX 7.0 solver) and multi-weighted graph problems (using modified Dijkstra's algorithm) is given. Experimental results of using the presented methods for multicriteria path selection in a terrain-based grid network are given.