Path: chuka.playstation.co.uk!news From: "Shaun Gibson" Newsgroups: scee.yaroze.freetalk.english Subject: Quadtrees (again) Date: Fri, 29 Jun 2001 01:12:23 +0100 Organization: PlayStation Net Yaroze (SCEE) Lines: 16 Message-ID: <9hgh6q$b9r8@www.netyaroze-europe.com> NNTP-Posting-Host: warp8-103.enta-net.co.uk X-Priority: 3 X-MSMail-Priority: Normal X-Newsreader: Microsoft Outlook Express 5.50.4133.2400 X-MimeOLE: Produced By Microsoft MimeOLE V5.50.4133.2400 OK, so I read the previous posts on quad/octtrees and then researched for myself a bit. I fully understand the concept, but what I'm having difficulty with is the implementation. For example, how would you determine which areas are visible (especially if the size of the areas are number of polygons rather than physical size) and how do you keep track of where objects are and which area leads to which other areas. There are more points which I can't quite think of at the moment, but have realised are important in the past when trying to solve this problem. Does anyone know of a site (or books) which describes the implementation of them? When I searched, I just found lots of information on what they are and very few specific examples. Cheers.