Close
Metadata

Identity statement area
Reference TypeConference Paper (Conference Proceedings)
Sitesibgrapi.sid.inpe.br
Identifier6qtX3pFwXQZeBBx/w5vee
Repositorysid.inpe.br/banon/2002/11.06.12.18
Last Update2002:11.06.02.00.00 administrator
Metadatasid.inpe.br/banon/2002/11.06.12.18.09
Metadata Last Update2020:02.19.02.58.51 administrator
Citation KeyFabrisAssiForr:2000:PaFiAl
TitleParallelization of filling algorithms on distributed memory machines using the point containment paradigm
Year2000
DateOctober
Access Date2021, Jan. 19
Number of Files1
Size520 KiB
Context area
Author1 Fabris, Antonio Elias
2 Assis, Marcos Machado Ottani
3 Forrest, A. Robin
EditorCarvalho, Paulo Cezar Pinto
Walter, Marcelo
Conference NameBrazilian Symposium on Computer Graphics and Image Processing, 13 (SIBGRAPI)
Conference LocationGramado, RS, Brazil
Pages235-242
PublisherIEEE Computer Society
Publisher CityLos Alamitos
Tertiary TypeFull Paper
OrganizationSBC - Brazilian Computer Society
History2008-07-17 14:10:50 :: administrator -> banon ::
2008-08-26 15:23:02 :: banon -> administrator ::
2009-08-13 20:36:58 :: administrator -> banon ::
2010-08-28 20:00:10 :: banon -> administrator ::
2020-02-19 02:58:51 :: administrator -> :: 2000
Content and structure area
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Content TypeExternal Contribution
Keywordsparallel algorithms, filling algorithm parallelization, distributed memory machines, point containment paradigm, point containment predicate, mathematically well-defined object, computer graphics, point-driven algorithms, parallel configurations, point-driven algorithm, standard uniprocessor software implementation, interactive editing.
AbstractThe point containment predicate which specifies if a point is part of a mathematically well-defined object is a crucial problem in computer graphics. Point-driven algorithms can be executed for several points in parallel as there is no interdependence among the computations for different points. The paper presents a variety of parallel configurations to counteract the main disadvantage of the point-driven algorithm: its slowness on a standard uniprocessor software implementation for interactive editing and manipulation.
source Directory Contentthere are no files
agreement Directory Contentthere are no files
Conditions of access and use area
data URLhttp://urlib.net/rep/6qtX3pFwXQZeBBx/w5vee
zipped data URLhttp://urlib.net/zip/6qtX3pFwXQZeBBx/w5vee
Target File235-242.pdf
User Groupadministrator
Visibilityshown
Allied materials area
Host Collectionsid.inpe.br/banon/2001/03.30.15.38
Notes area
NotesThe conference was held in Gramado, RS, Brazil, from October 17 to 20.
Empty Fieldsaccessionnumber affiliation archivingpolicy archivist area booktitle callnumber copyholder copyright creatorhistory descriptionlevel dissemination documentstage doi e-mailaddress edition electronicmailaddress format group holdercode isbn issn label language lineage mark mirrorrepository nextedition nexthigherunit numberofvolumes orcid parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url versiontype volume

Close