Binary space partitioning: Difference between revisions

Revision as of 17:53, 13 April 2022

Revision as of 05:48, 18 July 2022

Line 159:

{{refbegin}}

*{{cite journal |first1=B. |last1=Naylor |first2=J. |last2=Amanatides |first3=W. |last3=Thibualt |title=Merging BSP Trees Yields Polyhedral Set Operations |journal= ACM SIGGRAPH Computer Graphics|volume=24 |issue=4 |pages=115–124 |date=August 1990 |doi=10.1145/97880.97892 |citeseerx=10.1.1.69.292 }}

*{{cite journal |first=B. |last=Naylor |title=Constructing Good Partitioning Trees |date=May 1993 |journal=Graphics Interface |url=https://www.academia.edu/download/34035855/93-Naylor.pdf |citeseerx=10.1.1.16.4432}}{{dead link|date=July 2022|bot=medic}}{{cbignore|bot=medic}}

*{{cite journal |first1=S. |last1=Chen |first2=D. |last2=Gordon |title=Front-to-Back Display of BSP Trees |journal=IEEE Computer Graphics & Algorithms |volume=11 |issue=5 |pages=79–85 |date=September 1991 |doi=10.1109/38.90569 |s2cid=19056967 |url=}}

*{{cite journal |first1=H. |last1=Radha |first2=R. |last2=Leoonardi |first3=M. |last3=Vetterli |first4=B. |last4=Naylor |title=Binary space partitioning tree representation of images |journal=Journal of Visual Communications and Image Processing |volume=2 |issue=3 |pages=201–221 |date=1991 |doi=10.1016/1047-3203(91)90023-9 |url=http://infoscience.epfl.ch/record/33911}}