Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 2

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  line clipping
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote Two new algorithms for line clipping in E² and their comparison
EN
New efficient algorithms for the line clipping by the given rectangle in E² are presented. The first algoritm is based on the line direction evaluation the second one is based on a new coding technique of clipping rectangle's vertices. It allows solving all cases more effectively. A comparison of the proposed algorithms with the Liang-Barsky algorithm and some experimental results are presented, too.
2
Content available remote Faster algorithm for line clipping against a pyramid in E³
EN
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.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.