×

The BOXEL framework for 2.5D data with applications to virtual drivethroughs and ray tracing. (English) Zbl 1154.65306

Summary: The framework of boxels is developed to represent 2.5D datasets, such as urban environments. Boxels are axis-aligned non-intersecting boxes which can be used to directly represent objects in the scene or as bounding volumes. L. J. Guibas and F. F. Yao [in: Miller, Raymond E. (ed.), Conference proceedings of the twelfth annual ACM symposium on theory of computing, held at Los Angeles, California, April 28-30, 1980. Sponsored by the Association for Computing Machinery, Special Interest Group on Automata and Computability Theory, with the Cooperation of the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing and Computer Science Department, University of Southern California, Los Angeles, California. New York: The Association for Computing Machinery, 154–160 (1980; Zbl 0476.68003), also in: Advances in computing research 1, 61–77 (1983)] have shown that axis-aligned disjoint rectangles in the plane can be ordered into four total orders so that any ray meets them in one of the four orders. This is also applicable to boxels, and it is shown that there exist four different partitionings of the boxels into ordered sequences of disjoint sets, called antichains, so that boxels in one antichain can act as occluders of the boxels in subsequent antichains. The expected runtime for the antichain partitioning is \(O(n\log n)\), where \(n\) is the number of boxels. This partitioning can be used for the efficient implementation of virtual drivethroughs and ray tracing. Boxels can also be easily organized into hierarchies to speed up the rendering. For drivethroughs, the antichains are processed in front-to-back order together with a run-length encoding of the boxel horizon, yielding real-time rendering of scenes with up to 300,000 buildings. For ray tracing, a ray intersects at most one boxel in an antichain, and the time to determine that boxel is O(1) for most “natural” scenes, and at worst, logarithmic in the size of the antichain. Objects which are not axis-aligned can also be handled by a simple modification. Boxel rendering can also be parallelized for multi-core machines.

MSC:

65D18 Numerical aspects of computer graphics, image analysis, and computational geometry

Citations:

Zbl 0476.68003

Software:

BOXEL
Full Text: DOI

References:

[1] Aho, A. V.; Hopcroft, J. E.; Ullman, J. D., The Design and Analysis of Computer Algorithms (1974), Addison-Wesley: Addison-Wesley Reading, MA · Zbl 0286.68029
[2] Asano, T.; de Berg, M.; Cheong, O.; Everett, H.; Haverkort, H.; Katoh, N.; Wolff, A., Optimal spanners for axis-aligned rectangles, Computational Geometry: Theory and Applications, 30, 1, 59-77 (2005) · Zbl 1066.65025
[3] Asano, T.; Edahiro, M.; Imai, H.; Iri, M.; Murota, K., Practical use of bucketing techniques in computational geometry, (Toussaint, G. T., Computational Geometry, Machine Intelligence and Pattern Recognition, vol. 2 (1985), Elsevier: Elsevier Amsterdam), 153-195 · Zbl 0588.68017
[4] Bellantoni, S.; Ben-Arroyo Hartman, I.; Przytycka, T.; Whitesides, S., Grid intersection graphs and boxicity, Discrete Mathematics, 114, 41-49 (1993) · Zbl 0784.05031
[5] Cazals, F.; Puech, P., Bucket-like partitioning data structures with applications to ray-tracing, (Proceedings 13th Ann. Symp. on Computational Geometry, Annual Conference. Proceedings 13th Ann. Symp. on Computational Geometry, Annual Conference, Nice, France (1997), ACM), 11-20
[6] Cohen-Or, D.; Chrysanthou, Y.; Silva, C.; Durand, F., Survey of visibility for walkthrough applications, IEEE Trans. on Visualization and Computer Graphics, 9, 3, 412-431 (2003)
[7] L. Downs, T. Moller, C.H. Sequin, Occlusion horizons for driving through urban scenery, in: Proc. ACM Symposium on Interactive 3D Graphics, Berkeley, CA, 2001, pp. 121-124; L. Downs, T. Moller, C.H. Sequin, Occlusion horizons for driving through urban scenery, in: Proc. ACM Symposium on Interactive 3D Graphics, Berkeley, CA, 2001, pp. 121-124
[8] Foley, J. D.; van Dam, A.; Feiner, S. K.; Hughes, J., Computer Graphics: Principles and Practice (1990), Addison-Wesley: Addison-Wesley Reading, MA
[9] Frieder, G.; Gordon, D.; Reynolds, R. A., Back-to-front display of voxel-based objects, IEEE Computer Graphics & Applications, 5, 1, 52-60 (1985)
[10] (Glassner, A. S., An Introduction to Ray Tracing (1989), Academic Press: Academic Press London) · Zbl 0729.68088
[11] Gordon, D., Eliminating the flag in threaded binary search trees, Information Processing Letters, 23, 209-214 (1986) · Zbl 0627.68053
[12] D. Gordon, Boxels: A new framework for 2.5D and 3D objects, in: Proc. Israel-Korea Conf. on New Themes in Computerized Geometrical Modeling, Tel-Aviv, Israel, Feb. 1998, pp. 223-226; D. Gordon, Boxels: A new framework for 2.5D and 3D objects, in: Proc. Israel-Korea Conf. on New Themes in Computerized Geometrical Modeling, Tel-Aviv, Israel, Feb. 1998, pp. 223-226
[13] D. Gordon, Theoretical foundations of boxels—a new framework for 2.5D and 3D objects, Technical report, Dept. of Computer Science, The Technion, December 1998; D. Gordon, Theoretical foundations of boxels—a new framework for 2.5D and 3D objects, Technical report, Dept. of Computer Science, The Technion, December 1998
[14] Gordon, D.; Chen, S., Front-to-back display of BSP trees, IEEE Computer Graphics & Applications, 11, 5, 79-85 (1991)
[15] Guibas, L. J.; Yao, F. F., On translating a set of rectangles, Advances in Computing Research, 1, 61-77 (1983), Also in: 12th ACM STOC, 1980, pp. 154-160
[16] Kaufman, A., Volume Visualization (1991), IEEE Computer Society Press: IEEE Computer Society Press Los Alamitos, CA
[17] Manber, U., Introduction to Algorithms (1989), Addison-Wesley: Addison-Wesley Reading, MA · Zbl 0825.68397
[18] Meagher, D. J., Efficient synthetic image generation of arbitrary 3D objects, (Proceedings IEEE Computer Society Conference on Pattern Recognition and Image Processing, Annual Conference (1982), IEEE Computer Society Press: IEEE Computer Society Press June), 473-478
[19] Meagher, D. J., Geometric modelling using octree encoding, Computer Graphics & Image Processing, 19, 129-147 (1982)
[20] Preparata, F. P.; Shamos, M. I., Computational Geometry (1985), Springer-Verlag: Springer-Verlag New York · Zbl 0759.68037
[21] Reynolds, R. A.; Gordon, D.; Chen, L.-S., A dynamic screen technique for shaded graphics display of slice-represented objects, Computer Vision, Graphics & Image Processing, 38, 3, 275-298 (1987)
[22] Samet, H., Applications of Spatial Data Structures (1990), Addison-Wesley: Addison-Wesley Reading, MA
[23] Samet, H., The Design and Analysis of Spatial Data Structures (1990), Addison-Wesley: Addison-Wesley Reading, MA
[24] Samet, H., Foundations of Multidimensional and Metric Data Structures (2006), Morgan-Kaufmann: Morgan-Kaufmann San Francisco, CA · Zbl 1139.68022
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.