Close
Metadata

1. Identity statement
Reference TypeConference Paper (Conference Proceedings)
Sitesibgrapi.sid.inpe.br
Holder Codeibi 8JMKD3MGPEW34M/46T9EHH
Identifier8JMKD3MGPBW34M/3C9BMJS
Repositorysid.inpe.br/sibgrapi/2012/07.12.01.25
Last Update2012:07.12.01.25.16 (UTC) administrator
Metadata Repositorysid.inpe.br/sibgrapi/2012/07.12.01.25.16
Metadata Last Update2022:06.14.00.07.29 (UTC) administrator
DOI10.1109/SIBGRAPI.2012.26
Citation KeyMachadoeSilvaEspeOliv:2012:EfHPRe
TitleEfficient HPR-based Rendering of Point Clouds
FormatDVD, On-line.
Year2012
Access Date2025, Mar. 21
Number of Files1
Size3672 KiB
2. Context
Author1 Machado e Silva, Renan
2 Esperança, Claudio
3 Oliveira, Antonio
Affiliation1 COPPE/UFRJ
2 COPPE/UFRJ
3 COPPE/UFRJ
EditorFreitas, Carla Maria Dal Sasso
Sarkar, Sudeep
Scopigno, Roberto
Silva, Luciano
e-Mail Addressrenangms@gmail.com
Conference NameConference on Graphics, Patterns and Images, 25 (SIBGRAPI)
Conference LocationOuro Preto, MG, Brazil
Date22-25 Aug. 2012
PublisherIEEE Computer Society
Publisher CityLos Alamitos
Book TitleProceedings
Tertiary TypeFull Paper
History (UTC)2012-09-20 16:45:34 :: renangms@gmail.com -> administrator :: 2012
2022-03-08 21:03:23 :: administrator -> menottid@gmail.com :: 2012
2022-03-10 12:59:30 :: menottid@gmail.com -> administrator :: 2012
2022-06-14 00:07:29 :: administrator -> :: 2012
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Version Typefinaldraft
Keywordspoint cloud visibility
point based rendering
surface reconstruction
AbstractRecently, Katz et al. have shown how visibility information for a point cloud may be estimated by the so-called HPR operator. In a nutshell, the operator consists of a simple transformation of the cloud followed by a convex hull computation. Since convex hulls take $O(n \log n)$ time to compute in the worst case, this method has been considered impractical for real-time rendering of medium to large point clouds. In this paper, we describe a GPU implementation of an approximate convex-hull algorithm that runs in $O(n+k)$ time, where $k$ is a parameter of the method. Experiments show that the method is suitable for real-time rendering and partial reconstruction of point clouds with millions of points.
Arrangement 1urlib.net > SDLA > Fonds > SIBGRAPI 2012 > Efficient HPR-based Rendering...
Arrangement 2urlib.net > SDLA > Fonds > Full Index > Efficient HPR-based Rendering...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Content
agreement.html 11/07/2012 22:25 0.7 KiB 
4. Conditions of access and use
data URLhttp://urlib.net/ibi/8JMKD3MGPBW34M/3C9BMJS
zipped data URLhttp://urlib.net/zip/8JMKD3MGPBW34M/3C9BMJS
Languageen
Target FilePID2445025.pdf
User Grouprenangms@gmail.com
Visibilityshown
5. Allied materials
Mirror Repositorysid.inpe.br/banon/2001/03.30.15.38.24
Next Higher Units8JMKD3MGPEW34M/46SL8GS
8JMKD3MGPEW34M/4742MCS
Citing Item Listsid.inpe.br/sibgrapi/2022/05.15.03.31 33
sid.inpe.br/sibgrapi/2022/06.10.21.49 4
Host Collectionsid.inpe.br/banon/2001/03.30.15.38
6. Notes
Empty Fieldsarchivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination documentstage edition electronicmailaddress group isbn issn label lineage mark nextedition notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url volume


Close