Revision as of 04:03, 28 February 2024 edit WikiCleanerBot (talk \| contribs) Bots 1,007,735 edits m v2.05b - Bot T20 CW#61 - Fix errors for CW project (Reference before punctuation) Tag: WPCleaner ← Previous edit		Revision as of 06:56, 17 March 2024 edit undo Headbomb (talk \| contribs) Edit filter managers, Autopatrolled, Extended confirmed users, Page movers, File movers, New page reviewers, Pending changes reviewers, Rollbackers, Template editors 473,332 edits ce Next edit →
Line 152: {{cite journal \|first1=B. \|last1=Naylor \|first2=J. \|last2=Amanatides \|first3=W. \|last3=Thibault \|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 &and ~~Algorithms~~Applications \|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 \|doi-access=free}} *{{cite thesis \|first=H.M.S. \|last=Radha \|title=Efficient Image Representation using Binary Space Partitioning Trees \|date=1993 \|type=PhD \|publisher=Columbia University \|oclc=30775044}}

Binary space partitioning: Difference between revisions