Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
2006
*January
*February
*March
*April
*May
*June
*July
*August
*September
*October
*November
*December
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 2006

[Date Index] [Thread Index] [Author Index]

Search the Archive

How to identify "intersections" between to data sets?

  • To: mathgroup at smc.vnet.net
  • Subject: [mg69181] How to identify "intersections" between to data sets?
  • From: Doug Lundin <dlundin at aol.com>
  • Date: Fri, 1 Sep 2006 06:40:47 -0400 (EDT)
  • Sender: owner-wri-mathgroup at wolfram.com

Hello,

I am working on a project with my son and, essentially, we have two data sets with discrete points. These data sets intersect at various points. Without fitting a line to the data, is there a way to determine these intersections? I've already considered set intersection but that won't work because the x-axis datum do not match exactly.

For example,
Set1 {{1.01,5},{2.1,4},{4.3,4}}
Set2 {{1.02,4},{3,8},{4.305,8})

I would like to be able to identify x=1.01 and x=4.3 as matches.

Thoughts?

Thanks!
Doug


  • Prev by Date: Re: efficient term collection algorithm
  • Next by Date: Re: efficient term collection algorithm
  • Previous by thread: Re: efficient term collection algorithm
  • Next by thread: Re: How to identify "intersections" between to data sets?