Faster algorithm for line clipping against a pyramid in E3

Result code in IS VaVaI

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

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Faster algorithm for line clipping against a pyramid in E3

Original language description

A new algorithm for line clipping against a pyramid in E3 is presented. The suggested algorithm is based on the use of a separation function and avoids computation of intersection points that are not endpoints of the outpu line segment. It also allows tosolve all casesmore effectively. The performance of this algorithm is shown to be consistently better than the traditional Liang-Barskys algorithm for line clipping in E3. Experimental result are also presented.

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

Result was created during the realization of more than one project. More information in the Projects tab.

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

č. 4

Country of publishing house

PL - POLAND

Number of pages

10

Pages from-to

—

UT code for WoS article

—

EID of the result in the Scopus database

—