A Novel Line Convex Polygon Clipping Algorithm in E2 with Parallel Processing Modification
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F21%3A43962407" target="_blank" >RIV/49777513:23520/21:43962407 - isvavai.cz</a>
Result on the web
<a href="http://hdl.handle.net/11025/46321" target="_blank" >http://hdl.handle.net/11025/46321</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-030-86976-2_1" target="_blank" >10.1007/978-3-030-86976-2_1</a>
Alternative languages
Result language
angličtina
Original language name
A Novel Line Convex Polygon Clipping Algorithm in E2 with Parallel Processing Modification
Original language description
This paper presents a new approach to line clipping by a convex polygon problem solution. The algorithm is based on a separation function, which separates the polygon vertices to the left or right hand side of the given line. It leads to numerically robust algorithms in comparison to the well-known Cyrus-Beck’s algorithm and its modifications.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2021
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Computational Science and Its Applications – ICCSA 2021
ISBN
978-3-030-86975-5
ISSN
0302-9743
e-ISSN
—
Number of pages
13
Pages from-to
3-15
Publisher name
Springer
Place of publication
Cham
Event location
Cagliari, Italy
Event date
Sep 13, 2021
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—