2020
DOI: 10.1061/(asce)cp.1943-5487.0000894
|View full text |Cite
|
Sign up to set email alerts
|

IFC File Content Compression Based on Reference Relationships

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(2 citation statements)
references
References 21 publications
0
2
0
Order By: Relevance
“…To parse the information in the IFC file efficiently, some researchers have investigated the field of IFC file analysis, processing, and storage [34][35][36][37]. Khalili and Chua [38] developed a graph data model (GDM) to employ semantic information, to extract, analyze, and present the topological relationships among 3D objects in 3D space, and to perform topological queries faster.…”
Section: Approaches To Ifc Information Extraction and Storagementioning
confidence: 99%
“…To parse the information in the IFC file efficiently, some researchers have investigated the field of IFC file analysis, processing, and storage [34][35][36][37]. Khalili and Chua [38] developed a graph data model (GDM) to employ semantic information, to extract, analyze, and present the topological relationships among 3D objects in 3D space, and to perform topological queries faster.…”
Section: Approaches To Ifc Information Extraction and Storagementioning
confidence: 99%
“…Especially some fundament types like IfcCartesianPoint and IfcPropertySingleValue will have some duplicate instances. There are some compression algorithms to remove these like the IFCCompressor which compresses the IFC files by line by line (Sun et al, 2015) and ACC4IFC which takes the default value into consideration (Du et al, 2020). The basic ideas of these algorithms are very concise.…”
Section: Model Compression In Bimmentioning
confidence: 99%