Efficient Distance Computation Between NonConvex Objects - PowerPoint PPT Presentation


PPT – Efficient Distance Computation Between NonConvex Objects PowerPoint presentation | free to view - id: 1d4ee3-M2JmO


The Adobe Flash plugin is needed to view this content

Get the plugin now

View by Category
About This Presentation

Efficient Distance Computation Between NonConvex Objects


Simple search routine that uses the hierarchical bounding ... And d d' d Typical Configuration of Chess Pieces. Search Size v. Relative Error ... – PowerPoint PPT presentation

Number of Views:46
Avg rating:3.0/5.0
Slides: 20
Provided by: Naza2


Write a Comment
User Comments (0)
Transcript and Presenter's Notes

Title: Efficient Distance Computation Between NonConvex Objects

Efficient Distance Computation Between Non-Convex
  • By Sean Quinlan
  • Reviewed by Mehboob A. Nazarani

  • Model objects as the union of a set of convex
  • Construct a hierarchical bounding representation
    based on sphere from this model
  • Simple search routine that uses the hierarchical
    bounding representation of each object and
    determines pairs of components to compare with a
    convex distance algorithm.
  • Compute the distance between pairs of convex
    components using preexisting techniques
  • Accept a relative error in the returned result

  • Underlying model is a surface representation
    consisting of a set of convex polygons
  • Collision not detected when one object completely
    contains another object.

Basic Structure
  • Bounding representation is based on Spheres.
  • Representation consists of a balanced binary tree
  • Each node of the tree contains a single sphere

Tree Properties
  • The Union of leaf spheres completely contains the
    surface of the object.
  • The sphere of each node completely contains the
    spheres of its descendant leaf nodes.

Idea Behind Bounding Representation
  • Leaf spheres closely approximate the surface of
    the object.
  • Interior nodes represent an approximation of
    descendant leaf spheres
  • Nodes determine the lower bound for the distance
    to any of the descendant leaf nodes

Building the Tree First Step
  • Cover surface with leaf nodes
  • Regular grid of equal-sized spheres covers the
    polygon with the center of each sphere lying in
    the plane of the polygon
  • Label each sphere with the polygon for which it
    was created.

Building the Tree Second Step
  • Build interior nodes through divide and conquer
  • Divide set of leaves into two subtrees
  • Build tree for each subset and combine them into
    a single tree by creating a new node with each
    subtree as children
  • Build subtrees through recursion until the set
    consists of single leaf node

The Bounding Tree for an Object
  • No optimal methods for splitting known
  • Objective is to split set of leaf nodes into two
    subsets so that the bounding sphere will be small
  • Bounding Rectanguloid

Splitting, contd.
  • Determine Min and Max value for 3 coordinates for
    the position vectors
  • Select axes along which bounding box is longest
    and divide leaf nodes using the average value
    along these axes as the discriminating node
  • Build a tree for each subset
  • Determine a bounding sphere

Computing the Sphere
  • First Heuristic Method
  • Find bounding sphere that contains spheres of 2
    children nodes.
  • Works well near the leaves.
  • Second Heuristic Method
  • Directly consider the leaf spheres. Select a
    center by using the average position of the
    centers of the leaf spheres.
  • Examine each descendant leaf sphere to determine
    minimum radius
  • Works well closer to the root.

Execution Time
  • Depth logn
  • Expected execution time O(nlogn)
  • O(n2), worst case
  • Precomputation

Computing the Distance
  • d is the distance between two objects
  • Goal is to show
  • Objects are d distance apart, or
  • Objects intersect

General Outline of Algorithm
  • d 8
  • Examine the pair of nodes in DFS manner starting
    with the root nodes of the two trees
  • if the distance between the two nodes is ? d
  • then do nothing
  • else
  • Examine the children of the nodes

Algorithm, contd.
  • Case 1 Both nodes are from interior
  • Split one of the nodes into two children
  • Recursively split the pair
  • Case 2 One interior and one leaf node
  • Split the interior node
  • Recursively search the pair
  • Case 3 Two leaf spheres less than d distance
  • Compute the distance between the underlying
  • Return new d

Relative Error
  • Relative Error ?
  • d such that d lt d
  • And d d lt ?d

Typical Configuration of Chess Pieces
Search Size v. Relative Error
About PowerShow.com