Binary space partitioning: Difference between revisions

Content deleted Content added
m Updated citation info
typo in citation
Line 150:
==Additional references==
{{refbegin}}
*{{cite journal |first1=B. |last1=Naylor |first2=J. |last2=Amanatides |first3=W. |last3=ThibualtThibault |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.researchgate.net/publication/2492209 |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=}}