Python Octree Implementation

Python Octree Implementation 1.0

Python Octree Implementation 1.0 Download Summary

  • Language: Python
  • Platform: Windows / Linux / Mac OS / BSD / Solaris
  • License: Other Free / Open Source License - Python License
  • Databases: N/A
  • Downloads: 642
  • Released: Jun 6, 2007

Python Octree Implementation 1.0 Description

This script is a simple implementation of an octree data structure in python. Its use is primarily for fast collision or view frustrum culling in interactive 3d environments, but its possible uses are quite open-ended.

It was originally written for use with the pyOgre 3d engine binding. The code makes use of recursive functions to insert and find nodes in the octree, and is heavily commented.

It can store any type of object you create, so long as that object has a 'position' property in the form of a 3-vector tuple. It includes a test function which relies on the random module, but the octree itself has no required dependencies. It will try to use the psyco module to speed up its execution, but that is not essential. < speed up

Requirements:

· psyco module

Python Octree Implementation Bookmark

Hyperlink code:
Hyperlink for Forum code:

Python Octree Implementation 1.0 Script Download Notice

Top 4 Download periodically updates information of Python Octree Implementation 1.0 script from the developer, but some information may be slightly out-of-date.

Our script download links are directly from our mirrors or publisher's website. Python Octree Implementation 1.0 torrent files or shared files from free file sharing and free upload services, including Rapidshare, MegaUpload, YouSendIt, MailBigFile, DropSend, HellShare, HotFile, FileServe, MediaMax, zUpload, MyOtherDrive, SendSpace, DepositFiles, Letitbit, LeapFile, DivShare or MediaFire, are not allowed!

An interval mapping data structure

This structure is a kind of dictionary which allows you to map data intervals to values. You can then query the structure for a given point, and it returns the value associated to the interval which ...
Python

Deque collection class

This script is a pure python drop in replacement for collections.deque(). It uses a dictionary as the underlying data structure for the deque (pronounced "deck", short for "double-ended queue", a ...
Python

A queue for string data

This script is a queue data structure, for string data only, which looks like a File object. This class takes care of the list.append ...
Python

Quick and easy FIFO queue class

... is an easy First-In-First-Out queue class based on Python's List data structure. ...
Python

Two pass Pairing Heap with Auxiliary List

This script allows you to manage data collections.For random data, this implementation still makes more comparisons than a sort using heapq or the builtin sort. For partially ordered data, it can perform better than the builtin sort. Because of the list of lists data structure, it always takes more memory than either ...
Python