Urban scenes are one class of complex geometrical environments in computer graphics. In order to develop navigation systems for urban sceneries, extraction and cellulization of navigation space is one of the most commonly used technique providing a suitable structure for visibility computations. Surprisingly, there is not much work done for the extraction of the navigable area automatically. Urban models, except for the ones where the building footprints are used to generate the model, generally lack navigation space information. Because of this, it is hard to extract and discretize the navigable area for complex urban scenery. In this paper, we propose an algorithm for the extraction of navigation space for urban scenes in three-dimensions (3D). Our navigation space extraction algorithm works for scenes, where the buildings are in high complexity. The building models may have pillars or holes where seeing through them is also possible. Besides, for the urban data acquired from different sources which may contain errors, our approach provides a simple and efficient way of discretizing both navigable space and the model itself. The extracted space can instantly be used for visibility calculations such as occlusion culling in 3D space. Furthermore, terrain height field information can be extracted from the resultant structure, hence providing a way to implement urban navigation systems including terrains.
[1]
Joëlle Thollot,et al.
Conservative visibility preprocessing using extended projections
,
2000,
SIGGRAPH.
[2]
Michael Wimmer,et al.
Fast walkthroughs with image caches and ray casting
,
1999,
Comput. Graph..
[3]
Michael Wimmer,et al.
Visibility Preprocessing with Occluder Fusion for Urban Walkthroughs
,
2000,
Rendering Techniques.
[4]
François X. Sillion,et al.
Conservative volumetric visibility with occluder fusion
,
2000,
SIGGRAPH.
[5]
Dieter Schmalstieg,et al.
Exploiting coherence in 2.5-D visibility computation
,
1997,
Comput. Graph..
[6]
Carlos Andújar,et al.
Integrating Occlusion Culling and Levels of Detail through Hardly‐Visible Sets
,
2000,
Comput. Graph. Forum.
[7]
Pere Brunet,et al.
The visibility octree: a data structure for 3D navigation
,
1999,
Comput. Graph..
[8]
Carlo H. Séquin,et al.
Occlusion horizons for driving through urban scenery
,
2001,
I3D '01.
[9]
Carlo H. Séquin,et al.
Management of large amounts of data in interactive building walkthroughs
,
1992,
I3D '92.
[10]
William Ribarsky,et al.
Real-time visualization of scalably large collections of heterogeneous objects
,
1999,
Proceedings Visualization '99 (Cat. No.99CB37067).