I agree that this site is using cookies. You can find further informations
here
.
X
Login
Merkliste (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
zur Desktop-Version
Toggle navigation
Merkliste
1 Ergebnisse
1
Extending Segment Tree for Polygon Clipping and Parallelizi..:
, In:
Proceedings of the 53rd International Conference on Parallel Processing
,
Mallika Kankanamalage, Buddhi Ashan
;
Puri, Satish
;
Prasad, Sushil K.
- p. 273-283 , 2024
Link:
https://dl.acm.org/doi/10.1145/3673038.3673141
RT T1 <cTitle>Proceedings of the 53rd International Conference on Parallel Processing</cTitle>: T1 <Title>Extending Segment Tree for Polygon Clipping and Parallelizing using OpenMP and OpenACC Directives</Title> UL https://suche.suub.uni-bremen.de/peid=acm-3673141&Exemplar=1&LAN=DE A1 Mallika Kankanamalage, Buddhi Ashan A1 Puri, Satish A1 Prasad, Sushil K. PB ACM YR 2024 K1 Degenerate cases for intersection K1 Foster's algorithm K1 OpenACC K1 OpenMP K1 Polygon clipping K1 Segment tree K1 Vatti's algorithm K1 computational geometry K1 Computing methodologies K1 Parallel computing methodologies K1 Parallel algorithms K1 Shared memory algorithms SP 273 OP 283 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3673038.3673141 DO https://dl.acm.org/doi/10.1145/3673038.3673141 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
