Near-Optimal Construction of Partitioning Trees by Evolutionary Techniques

We present a technique to construct space partitioning trees that can be used to efficiently represent , operate and manipulate geometric models. Our method is based on casting the tree construction problem as an optimization problem and using evolutionary techniques [13, 10, 19] to arrive at a nearoptimal solution. Different metrics and cost models are used to evaluate the constructed trees. The metrics are aimed at optimizing criteria that are related to fast rendering, spatial operations such as point location and ray tracing. Extensions to other applications such as multi-resolution representation and compression are straightforward.

[1]  John Amanatides,et al.  Merging BSP trees yields polyhedral set operations , 1990, SIGGRAPH.

[2]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.

[3]  Lawrence J. Fogel,et al.  Artificial Intelligence through Simulated Evolution , 1966 .

[4]  Jon Louis Bentley,et al.  Data Structures for Range Searching , 1979, CSUR.

[5]  Donald S. Fussell,et al.  Adaptive mesh generation for global diffuse illumination , 1990, SIGGRAPH.

[6]  A. T. Campbell.  Modeling global diffuse illumination for image synthesis , 1992 .

[7]  Hanan Samet,et al.  Applications of spatial data structures , 1989 .

[8]  Hans-Paul Schwefel,et al.  Numerical optimization of computer models , 1981 .

[9]  Karl Sims,et al.  Artificial evolution for computer graphics , 1991, SIGGRAPH.

[10]  James Arvo,et al.  Fast ray tracing by ray classification , 1987, SIGGRAPH '87.

[11]  Ingo Rechenberg,et al.  Evolutionsstrategie : Optimierung technischer Systeme nach Prinzipien der biologischen Evolution , 1973 .

[12]  Donald S. Fussell,et al.  Automatic Termination Criteria for Ray Tracing Hierarchies , 1991 .

[13]  Hanan Samet,et al.  The Design and Analysis of Spatial Data Structures , 1989 .

[14]  Kalpathi R. Subramanian,et al.  Adapting search structures to scene characteristics for ray tracing , 1991 .

[15]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[16]  Kalpathi R. Subramanian,et al.  Representing medical images with partitioning trees , 1992, Proceedings Visualization '92.

[17]  Kalpathi R. Subramanian,et al.  Factors Affecting Performance of Ray Tracing Hierarchies , 1990 .

[18]  Henry Fuchs,et al.  On visible surface generation by a priori tree structures , 1980, SIGGRAPH '80.

[19]  Andrew S. Glassner,et al.  Space subdivision for fast ray tracing , 1984, IEEE Computer Graphics and Applications.

[20]  Steven K. Feiner,et al.  Near real-time shadow generation using BSP trees , 1989, SIGGRAPH '89.

[21]  John Salmon,et al.  Automatic Creation of Object Hierarchies for Ray Tracing , 1987, IEEE Computer Graphics and Applications.

[22]  Bruce F. Naylor,et al.  Constructing good partitioning trees , 1993 .

[23]  Eric Hoines,et al.  A Proposal for Standard Graphics Environments , 1987, IEEE Computer Graphics and Applications.