Deferred, Self-Organizing BSP Trees

@article{Ar2002DeferredSB,
  title={Deferred, Self-Organizing BSP Trees},
  author={Sigal Ar and Gil Montag and Ayellet Tal},
  journal={Comput. Graph. Forum},
  year={2002},
  volume={21},
  pages={269-278}
}
bsptrees and KD trees are fundamental data structures for collision detection in walkthrough environments. A basic issue in the construction of these hierarchical data structures is the choice of cutting planes. Rather than base these choices solely on the properties of the scene, we propose using information about how the tree is used in order to determine its structure. We demonstrate how this leads to the creation ofbsptrees that are small, do not require much preprocessing time, and respond… CONTINUE READING
BETA

Similar Papers

References

Publications referenced by this paper.
SHOWING 1-10 OF 15 REFERENCES

Average-caseray shooting andminimumweighttriangulations, Proc.13thAnnu

B. Aronov, S. Fortune
  • ACM Symp.Comput.Geom.(1997),203-211. c TheEurographicsAssociationandBlackwellPublishers2002
  • 2002

Klosowski, andJ.S.B.Mitchell, Evaluation of collision detectionmethodsfor virtual reality flythroughs, Proc.7thCanadianConf.Computational Geometry, pp.205–210(1995)

J. T. Held
  • 1995

Computingdynamic changesto BSPtrees, ComputerGraphicsForum(EUROGRAPHICS’92 Proceedings)

Y. Chrysanthou, M. Slater
  • 1992