Close
Metadata

Identity statement area
Reference TypeConference Paper (Conference Proceedings)
Sitesibgrapi.sid.inpe.br
Identifier6qtX3pFwXQZeBBx/GFcUp
Repositorysid.inpe.br/banon/2005/07.06.12.15
Last Update2005:07.06.03.00.00 administrator
Metadatasid.inpe.br/banon/2005/07.06.12.15.20
Metadata Last Update2020:02.19.03.19.08 administrator
Citation KeyLageLewiLopeVelh:2005:ScToDa
TitleCHF: A scalable topological data structure for tetrahedral meshes
FormatOn-line
Year2005
Date9-12 Oct. 2005
Access Date2021, Jan. 19
Number of Files1
Size226 KiB
Context area
Author1 Lage, Marcos
2 Lewiner, Thomas
3 Lopes, Hélio
4 Velho, Luiz
Affiliation1 PUC–Rio — Departamento de Matemática — Matmídia Project — Rio de Janeiro — Brazil
2 INRIA — Géométrica Project — Sophia Antipolis — France
3 IMPA — Visgraf Project — Rio de Janeiro — Brazil
EditorRodrigues, Maria Andréia Formico
Frery, Alejandro César
e-Mail Addresstomlew@mat.puc-rio.br
Conference NameBrazilian Symposium on Computer Graphics and Image Processing, 18 (SIBGRAPI)
Conference LocationNatal
Book TitleProceedings
PublisherIEEE Computer Society
Publisher CityLos Alamitos
Tertiary TypeFull Paper
History2005-07-06 12:15:21 :: tomlew -> banon ::
2005-07-07 19:44:15 :: banon -> tomlew ::
2008-07-17 14:10:59 :: tomlew -> banon ::
2008-08-26 15:17:01 :: banon -> administrator ::
2009-08-13 20:37:44 :: administrator -> banon ::
2010-08-28 20:01:17 :: banon -> administrator ::
2020-02-19 03:19:08 :: administrator -> :: 2005
Content and structure area
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Content TypeExternal Contribution
KeywordsGeometric Modeling, Data Structures, Object Oriented Programming, Generic Containers.
AbstractThis work introduces a scalable topological data structure for manifold tetrahedral meshes called Compact HalfFace (CHF). It provides a high degree of scalability, since it is able to optimize the memory consumption / execution time ratio for different applications and data by using features of its different levels. An objectoriented API using class inheritance and virtual instantiation enables a unique interface for each function at any level. CHF requires very few memory, is simple to implement and easy to use, since it substitutes pointers by container of integers and basic bitwise rules.
source Directory Contentthere are no files
agreement Directory Contentthere are no files
Conditions of access and use area
data URLhttp://urlib.net/rep/6qtX3pFwXQZeBBx/GFcUp
zipped data URLhttp://urlib.net/zip/6qtX3pFwXQZeBBx/GFcUp
Languageen
Target FileCHF_Sibgrapi_final.pdf
User Grouptomlew
administrator
Visibilityshown
Allied materials area
Host Collectionsid.inpe.br/banon/2001/03.30.15.38
Notes area
Empty Fieldsaccessionnumber archivingpolicy archivist area callnumber copyholder copyright creatorhistory descriptionlevel dissemination documentstage doi edition electronicmailaddress group holdercode isbn issn label lineage mark mirrorrepository nextedition nexthigherunit notes numberofvolumes orcid organization pages 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