About 3,360,000 results
Open links in new tab
  1. Binary Space Partitioning - GeeksforGeeks

    Jul 15, 2025 · Binary space partitioning arose in the context of 3D computer graphics in 1969, where the structure of a BSP tree allows for spatial information about the objects in a scene that is useful in …

  2. Binary Space Partitioning Trees in Computer Graphics

    Binary Space Partitioning (BSP) trees are used for efficiently solving the visibility problem, mostly when dealing with planar polygons. Visibility is the challenge of determining which parts of a scene are …

  3. Binary Space Partitioning - Online Tutorials Library

    A binary space partition is a data structure used in computer graphics and algorithmic geometry to divide a space into smaller parts. BSP was developed in the environment of 3D computer graphics.

  4. Difference Between Graph and Tree - GeeksforGeeks

    Jul 11, 2025 · Graphs and trees are two fundamental data structures used in computer science to represent relationships between objects. While they share some similarities, they also have distinct …

  5. Octree | Insertion and Searching - GeeksforGeeks

    Feb 2, 2023 · Your All-in-One Learning Portal: GeeksforGeeks is a comprehensive educational platform that empowers learners across domains-spanning computer science and programming, school …

  6. Projections in Computer Graphics - GeeksforGeeks

    Dec 6, 2022 · Your All-in-One Learning Portal: GeeksforGeeks is a comprehensive educational platform that empowers learners across domains-spanning computer science and programming, school …

  7. Define a quadtree and its applications in computer graphics.

    A quadtree is a tree data structure used in computer graphics to partition a two-dimensional space into smaller regions. In more detail, a quadtree is a type of hierarchical tree structure where each node …

  8. An overview of hierarchical data structures for representing images, such as the quadtree and octree, is presented. They are based on the principle of recursive decomposition. The emphasis is on the …

  9. Place first edge in tree as root Add subsequent edges based on whether they are inside or outside of edges already in the tree. Inside edges go to the right, outside to the left. (opposite of Hill) Edges that …

  10. Directed Acyclic Graph (DAG) Models Could use tree to represent object Actually, a DAG (directed acyclic graph) is better: can re-use objects Note that each arrow needs a separate modeling …