Re: multi-dimensional search algorithm blues...

Discussion in 'C++' started by =?iso-8859-1?Q?Juli=E1n?= Albo, Jul 2, 2003.

  1. John Everett escribió:

    > There are two arrays ( A_dots and B_dots ).
    > each array is set up like this:
    > float A_dots[100000][3];
    > float B_dots[100000][3];
    >
    > each array holds the x,y,z coordinates of a point in space.
    >
    > Here is the problem:
    >
    > There are ~1000 points in A_dots that are NOT in B_dots and
    > I need to find them.


    You can sort both arrays and then use std::set_difference.

    Regards.
     
    =?iso-8859-1?Q?Juli=E1n?= Albo, Jul 2, 2003
    #1
    1. Advertising

  2. =?iso-8859-1?Q?Juli=E1n?= Albo

    John Everett Guest

    News group,

    Both the data structure setup and especially the
    set difference idea seem promising. I will post back
    any success. Thanks for your help.

    ~ John
     
    John Everett, Jul 4, 2003
    #2
    1. Advertising

Want to reply to this thread or ask your own question?

It takes just 2 minutes to sign up (and it's free!). Just click the sign up button to choose a username and then you can ask your own questions on the forum.
Similar Threads
  1. Yu Cao
    Replies:
    0
    Views:
    464
    Yu Cao
    Jul 1, 2003
  2. Stuart Golodetz
    Replies:
    1
    Views:
    483
    Yu Cao
    Jul 2, 2003
  3. Alf P. Steinbach
    Replies:
    0
    Views:
    439
    Alf P. Steinbach
    Aug 18, 2003
  4. Angus
    Replies:
    14
    Views:
    496
    James Kanze
    Mar 10, 2011
  5. Wirianto Djunaidi
    Replies:
    2
    Views:
    204
    Wirianto Djunaidi
    Apr 29, 2008
Loading...

Share This Page