3D Viewpoint Management and Navigation in Urban Planning: Application to the Exploratory Phase
Bibliographic record
Abstract
3D geovisualization is essential in urban planning as it assists the analysis of geospatial data and decision making in the design and development of land use and built environment. However, we noted that 3D geospatial models are commonly visualized arbitrarily as current 3D viewers often lack of design instructions to assist end users. This is especially the case for the occlusion management in most 3D environments where the high density and diversity of 3D data to be displayed require efficient visualization techniques for extracting all the geoinformation. In this paper, we propose a theoretical and operational solution to manage occlusion by automatically computing best viewpoints. Based on user’s parameters, a viewpoint management algorithm initially calculates optimal camera settings for visualizing a set of 3D objects of interest through parallel projections. Precomputed points of view are then integrated into a flythrough creation algorithm for producing an automatic navigation within the 3D geospatial model. The algorithm’s usability is illustrated within the scope of a fictive exploratory phase for the public transport services access in the European quarter of Brussels. Eventually, the proposed algorithms may also assist additional urban planning phases in achieving their purposes.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".