Dania H. Al-Harasis

Mrs. Dania H. Al-Harasis

orcid

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 February 2025 in Building Research & Information
Verified
Journal Article
Open access
Dania H. Al-HarasisDania H. Al-Harasis
Dania H. Al-Harasis
Wassim JabiWassim Jabi
Wassim Jabi
Tania SharminTania Sharmin
Tania Sharmin

14 April 2025 in Buildings
Verified
Journal Article
Open access
PDF file
AMAngelo Massafra
Angelo Massafra
Dania H. Al-HarasisDania H. Al-Harasis
Dania H. Al-Harasis
LSLorenzo Stefanini
Lorenzo Stefanini
Wassim JabiWassim Jabi
Wassim Jabi
Most of Italy’s residential building stock predates contemporary structural safety and energy efficiency regulatory frameworks. Today, policymakers face the challenge of choosing whether to prioritise renovation or opt for demolition and reconstruction; both options carry significant socio-economic and environmental consequences and require extensive knowledge of the built heritage. However, detailed architecture-specific data remain scarce, as existing databases lack granular information. Moreover, traditional urban-level knowledge mapping approaches may be resource-intensive. To address this data gap, this study proposes a semi-automated methodology for generating graph-based digital models representing residential building floor plans. Using graph theory, floor spatial layouts are mapped into connectivity graphs and transformed into topological models. These models are enriched with functional data about spaces by assigning conditional topological rules based on node centrality metrics. The method was tested on 98 buildings in Bologna, Italy, yielding an 89.8% success rate and demonstrating its effectiveness in data-limited contexts. The resulting dataset facilitates the analysis of floor spatial configurations and the extraction of geometric attributes, laying the foundation for future analyses that will integrate machine learning techniques for functional detection and typological clustering.

21 July 2026
Verified
Book Chapter
Closed access
PDF file
OAOmar M. Amireh
Omar M. Amireh
Dania H. Al-HarasisDania H. Al-Harasis
Dania H. Al-Harasis
ZOZaineh S. Abu Omar
Zaineh S. Abu Omar
SZSaja A. Zeadeh
Saja A. Zeadeh

12 October 2026 in Proceedings of Digital Frontiers in Buildings and Infrastructure International Conference Series
Verified
Journal Article
Open access
PDF file
Dania H. Al-HarasisDania H. Al-Harasis
Dania H. Al-Harasis
Wassim JabiWassim Jabi
Wassim Jabi
Layout evaluation in early-stage building design often relies on manual inspection to verify compliance with spatial requirements such as adjacency, accessibility, capacity, and programme-specific constraints. As programmes grow in size and interdependency, review becomes time-consuming, inconsistent across reviewers, and difficult to integrate into rapid iteration. This paper proposes an automated method to identify and repair non-compliant spatial layouts represented as graphs, while preserving interpretability and limiting unnecessary changes to designer intent. A candidate layout is encoded as an attributed, weighted graph, and requirements are formalised as a target benchmark graph specifying expected spaces, relations, and admissible attribute ranges. Structured compliance checking aligns candidate and benchmark graphs to detect structural violations, including missing or redundant spaces and incomplete connectivity, and attribute violations, including incorrect capacities, distances, edge weights, or constraint-relevant labels. The method then applies modular repair operators, including node insertion or deletion, edge completion, weight correction, and constraint-aware attribute adjustment, to produce a revised graph with improved benchmark conformity. Each edit is logged with its triggering violation, the operation applied, and the resulting change in compliance metrics, enabling transparent auditing and traceability. Experiments across multiple scenarios and benchmark configurations show consistent gains after repair, reducing detected violations and increasing overall benchmark alignment. The resulting logs provide actionable evidence for automated pipelines and human review, positioning graph repair as a practical quality-assurance layer for compliance-oriented generative layout workflows. Future work will scale to larger and noisier benchmarks and incorporate designer preferences and multi-objective trade-offs.