Two new algorithms for line clipping in E2 and their comparison

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F00%3A00055246" target="_blank" >RIV/49777513:23520/00:00055246 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Two new algorithms for line clipping in E2 and their comparison

Original language description

New efficient algorithms for the line clipping by the given rectangle in E2 are presented. The first algorithms 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.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

JC - Computer hardware and software

OECD FORD branch

—

Project

<a href="/en/project/VS97155" target="_blank" >VS97155: Computer Graphics and Data Visualization in Parallel and Distributed Environment</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2000

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Machine Graphics & Vision

ISSN

12300535

e-ISSN

—

Volume of the periodical

—

Issue of the periodical within the volume

č. 1/2

Country of publishing house

NA - NAMIBIA

Number of pages

10

Pages from-to

—

UT code for WoS article

—

EID of the result in the Scopus database

—