Abstract
Many applications of computer-aided design (CAD) and scientific visualization involve representing and manipulating large CAD databases. Structural and mechanical designers often create models of ships, oil platforms, spacecraft, and process plants that are composed of hundreds of thousands of parts and take many gigabytes of storage space. Furthermore, their model complexity exceeds the interactive visualization and manipulation capabilities of current high-end graphics systems. Different applications like multi-disciplinary design reviews, simulation-based design and virtual prototyping desire the ability to directly perceive and manipulate such large models at interactive frame rates (i.e., more than 20 frames a second). However, current algorithms and systems are unable to handle such large databases at interactive rates. In this paper, we describe algorithms to automatically partition and order large CAD databases for interactive walkthroughs and proximity queries. These include techniques to localize the computations such that the algorithms use a relatively small and bounded memory footprint.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Airey, J. Rohlf, and F. Brooks. Towards Image Realism with Interactive Update Rates in Complex Virtual Building Environments. In Computer Graphics (1990 Symposium on Interactive 3D Graphics), pp. 41–50, ACM Press, 1990.
Aliaga et al. A framework for real-time walkthroughs of massive models. Technical Report TR98-013, Department of Computer Science, University of North Carolina, 1998. Appeared in Proc. Of ACM Symposium on Interactive 3D Graphics.
Lisa Sobierajski Avila and William Schroder. Interactive visualization of aircraft and power generation engines. In IEEE Visualization 97, Roni Yagel and Hans Hagen, eds., pp. 83–486. IEEE, November 1997.
G. Barequet, B. Chazelle, L. Guibas, J. Mitchell, and A. Tal. Boxtree: A hierarchical representation of surfaces in 3d. In Proc. Of Eurographics’ 96, 1996.
Richard Bukowski and Carlo H. Sequin. Interactive simulation of fire in virtual building environments. In SIGGRAPH 97 Conference Procedings, pp. 35–44, ACM SIGGRAPH, 1997.
S. Cameron. Approximation hierarchies and s-bounds. In Proceedings, Symposium on Solid Modeling Foundations and CAD/CAM Applications, pp. 129–137, Austin, TX, 1991.
S. Cameron. A comparison of two fast algorithms for computing the distance between convex polyhedra. IEEE Transactions on Robotics and Automation, 13(6):915–920, December 1996.
Michael B. Cox and David Ellsworth. Application-controlled demand paging for Out-of-Core visualization. In IEEE Visualization 97, Roni Yagel and Hans Hagen, eds., pp. 235–244. IEEE, November 1997.
J. Cohen, M. Lin, D. Manocha, and M. Ponamgi. I-Collide: An interactive and exact collision detection system for large-scale environments. In Proc. of ACM Interactive 3D Graphics Conference, pp. 189–196, 1996.
C. Erikson and D. Manocha. GAPS: General and Automatic Polygon Simplification. Technical Report TR98-033, Department of Computer Science, University of North Carolina, 1998. To appear in Proc. of ACM Symposium on Interactive 3D Graphics, 1999.
T. A. Funkhouser and C. H. Sequin. Adaptive display algorithm for interactive frame rates during visualization of complex virtual environments. In Proc. of ACM SIGGRAPH’ 93, pp. 247–254, ACM SIGGRAPH, 1993.
T. A. Funkhouser, C. Sequin, and S. Teller. Management of large amounts of data in interactive building walkthroughs. In Computer Graphics (1992 Symposium on Interactive 3D Graphics), volume 25, pp. 11–20, ACM, 1992.
E. G. Gilbert, D. W. Johnson, and S. S. Keerthi. A fast procedure for computing the distance between objects in three-dimensional space. IEEE Journal of Robotics and Automation, volume RA-4:193–203, 1988.
S. Gottschalk, M. Lin, and D. Manocha. OBB-Tree: A hierarchical structure for rapid interference detection. In Proc. of ACM SIGGRAPH’ 96, pp. 171–180, ACM SIGGRAPH, 1996.
S. Gottschalk. Collision Queries using Oriented Bounding Boxes. PhD thesis, University of North Carolina, Department of Computer Science, 1999.
B. Hendrickson and R. Leland. A multi-level algorithm for partitioning graphs. Technical report SAND93-1301, Sandia National Laboratory, 1993.
P. M. Hubbard. Interactive collision detection. In Proceedings of IEEE Symposium on Research Frontiers in Virtual Reality, October 1993.
D. Johnson and E. Cohen. A framework for efficient minimum distance computation. IEEE Conference on Robotics and Automation, pp. 3678–3683, 1998.
S. Krishnan, M. Gopi, M. Lin, D. Manocha, and A. Pattekar. Rapid and accurate contact determination between spline models using shelltrees. In Proc. of Eurographics’ 98, 1998. To appear.
J. Klosowski, M. Held, J. S. B. Mitchell, H. Sowizral, and K. Zikan. Efficient collision detection using bounding volume hierarchies of k-dops. In SIGGRAPH’ 96 Visual Proceedings, page 151, ACM SIGGRAPH, 1996.
G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing, pp. 269–278, 1996.
D. Luebke and C. Georges, Portals and Mirrors: Simple, Fast Evaluation of Potentially Visible Sets, in Proc. of ACM Interactive 3D Graphics Conference, ACM Press, 1995.
M. C. Lin and John F. Canny. Efficient algorithms for incremental distance compuation. In IEEE Conference on Robotics and Automation, pp. 1008–1014, 1991.
M. C. Lin and S. Gottschalk. Collision detection between geometric models: A survey. In Proc. of IMA Conference on Mathematics of Surfaces, 1998.
S. Quinlan. Efficient distance computation between non-convex objects. In Proceedings of International Conference on Robotics and Automation, pp. 3324–3329, 1994.
J. Rohlf and J. Helman. Iris Performer: A high performance multiprocessor toolkit for realtime 3D graphics. In SIGGRAPH’ 94 Conference Proceedings, pp. 381–394, ACM SIGGRAPH, 1994.
R. Seidel. Linear programming and convex hulls made easy. In 6 th Annual ACM Conference on Computational Geometry, pp. 211–215, Berkeley, California, 1990.
S. J. Teller. Visibility Computations in Densely Occluded Polyhedral Environments. PhD thesis, CS Division, UC Berkeley, 1992.
S. Teller, C. Fowler, T. Funkhouser, and P. Hanrahan. Partitioning and ordering large radiosity computations. In SIGGRAPH’ 94 Conference Proceedings, pp. 443–450, ACM SIGGRAPH, 1994.
S. Teller and C. H. Sequin. Visibility preprocessing for interactive walkthroughs. In SIGGRAPH’ 91 Conference Proceedings, pp. 61–69, ACM SIGGRAPH, 1991.
A. Wilson, E. Larsen, D. Manocha and M. C. Lin. IMMPACT: A System for Interactive Proximity Queries in Massive Models. Technical Report TR98-031, Department of Computer Science, University of North Carolina, 1998. To appear in Proc. of Eurographics 1999, Milan, Italy.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wilson, A., Manocha, D., Lin, M.C. (1999). Representation and Interactive Manipulation of Massive CAD Databases. In: Agouris, P., Stefanidis, A. (eds) Integrated Spatial Databases. ISD 1999. Lecture Notes in Computer Science, vol 1737. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46621-5_16
Download citation
DOI: https://doi.org/10.1007/3-540-46621-5_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66931-9
Online ISBN: 978-3-540-46621-5
eBook Packages: Springer Book Archive